TSTP Solution File: LCL666+1.001 by Beagle---0.9.47

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.47
% Problem  : LCL666+1.001 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -Xms512M -Xmx4G -Xss10M -XX:MaxPermSize=384M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s

% Computer : n004.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 600s
% DateTime : Sun Jul 17 07:45:30 EDT 2022

% Result   : Theorem 1.47s 1.02s
% Output   : CNFRefutation 1.47s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   15 (   5 unt;   7 typ;   0 def)
%            Number of atoms       :   15 (   0 equ)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :   19 (  12   ~;   5   |;   2   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    5 (   0 usr;   3 ari)
%            Number of type conns  :   10 (   6   >;   4   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   1 con; 0-2 aty)
%            Number of variables   :    5 (   4   !;   1   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ r1 > p201 > p101 > #nlpp > #skF_1

%Foreground sorts:

%Background operators:

%Foreground operators:
tff('#nlpp',type,
    '#nlpp': ( $real * $real ) > $real ).

tff(p101,type,
    p101: $i > $o ).

tff(p201,type,
    p201: $i > $o ).

tff(r1,type,
    r1: ( $i * $i ) > $o ).

tff('#skF_1',type,
    '#skF_1': $i ).

tff('#nlpp_001',type,
    '#nlpp': ( $rat * $rat ) > $rat ).

tff('#nlpp_002',type,
    '#nlpp': ( $int * $int ) > $int ).

tff(f_46,negated_conjecture,
    ~ ~ ? [X] :
          ~ ( ~ ! [Y] :
                  ( ~ r1(X,Y)
                  | ~ ( p201(Y)
                      & p101(Y) ) )
            | ~ ( p201(X)
                & p101(X) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).

tff(f_28,axiom,
    ! [X] : r1(X,X),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity) ).

tff(c_6,plain,
    p201('#skF_1'),
    inference(cnfTransformation,[status(thm)],[f_46]) ).

tff(c_4,plain,
    p101('#skF_1'),
    inference(cnfTransformation,[status(thm)],[f_46]) ).

tff(c_2,plain,
    ! [X_1] : r1(X_1,X_1),
    inference(cnfTransformation,[status(thm)],[f_28]) ).

tff(c_10,plain,
    ! [Y_5] :
      ( ~ p101(Y_5)
      | ~ p201(Y_5)
      | ~ r1('#skF_1',Y_5) ),
    inference(cnfTransformation,[status(thm)],[f_46]) ).

tff(c_14,plain,
    ( ~ p101('#skF_1')
    | ~ p201('#skF_1') ),
    inference(resolution,[status(thm)],[c_2,c_10]) ).

tff(c_18,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_6,c_4,c_14]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : LCL666+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13  % Command  : java -Xms512M -Xmx4G -Xss10M -XX:MaxPermSize=384M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.14/0.34  % Computer : n004.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Mon Jul  4 22:19:38 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.14/0.35  OpenJDK 64-Bit Server VM warning: ignoring option MaxPermSize=384M; support was removed in 8.0
% 1.47/1.02  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.47/1.02  
% 1.47/1.02  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 1.47/1.03  
% 1.47/1.03  Inference rules
% 1.47/1.03  ----------------------
% 1.47/1.03  #Ref     : 0
% 1.47/1.03  #Sup     : 1
% 1.47/1.03  #Fact    : 0
% 1.47/1.03  #Define  : 0
% 1.47/1.03  #Split   : 0
% 1.47/1.03  #Chain   : 0
% 1.47/1.03  #Close   : 0
% 1.47/1.03  
% 1.47/1.03  Ordering : KBO
% 1.47/1.03  
% 1.47/1.03  Simplification rules
% 1.47/1.03  ----------------------
% 1.47/1.03  #Subsume      : 0
% 1.47/1.03  #Demod        : 2
% 1.47/1.03  #Tautology    : 0
% 1.47/1.03  #SimpNegUnit  : 0
% 1.47/1.03  #BackRed      : 0
% 1.47/1.03  
% 1.47/1.03  #Partial instantiations: 0
% 1.47/1.03  #Strategies tried      : 1
% 1.47/1.03  
% 1.47/1.03  Timing (in seconds)
% 1.47/1.03  ----------------------
% 1.47/1.03  Preprocessing        : 0.23
% 1.47/1.03  Parsing              : 0.13
% 1.47/1.03  CNF conversion       : 0.01
% 1.47/1.03  Main loop            : 0.06
% 1.47/1.03  Inferencing          : 0.03
% 1.47/1.03  Reduction            : 0.01
% 1.47/1.03  Demodulation         : 0.01
% 1.47/1.03  BG Simplification    : 0.01
% 1.47/1.03  Subsumption          : 0.00
% 1.47/1.03  Abstraction          : 0.00
% 1.47/1.03  MUC search           : 0.00
% 1.47/1.03  Cooper               : 0.00
% 1.47/1.03  Total                : 0.31
% 1.47/1.03  Index Insertion      : 0.00
% 1.47/1.03  Index Deletion       : 0.00
% 1.47/1.03  Index Matching       : 0.00
% 1.47/1.03  BG Taut test         : 0.00
%------------------------------------------------------------------------------