TSTP Solution File: SYN960+1 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SYN960+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -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 : n023.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  : 300s
% DateTime : Tue Aug 22 11:16:59 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%$ a > #nlpp > #skF_2 > #skF_3 > #skF_1 > #skF_4

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(a,type,
    a: ( $i * $i ) > $o ).

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

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

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

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

tff(f_30,negated_conjecture,
    ~ ( ? [X,Y] : a(X,Y)
    <=> ? [Y,X] : a(X,Y) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

tff(c_2,plain,
    ! [X_2,Y_1,X_3,Y_4] :
      ( ~ a(X_2,Y_1)
      | ~ a(X_3,Y_4) ),
    inference(cnfTransformation,[status(thm)],[f_30]) ).

tff(c_15,plain,
    ! [X_3,Y_4] : ~ a(X_3,Y_4),
    inference(splitLeft,[status(thm)],[c_2]) ).

tff(c_4,plain,
    ! [X_3,Y_4] :
      ( a('#skF_1','#skF_2')
      | ~ a(X_3,Y_4) ),
    inference(cnfTransformation,[status(thm)],[f_30]) ).

tff(c_11,plain,
    ! [X_3,Y_4] : ~ a(X_3,Y_4),
    inference(splitLeft,[status(thm)],[c_4]) ).

tff(c_8,plain,
    ( a('#skF_1','#skF_2')
    | a('#skF_4','#skF_3') ),
    inference(cnfTransformation,[status(thm)],[f_30]) ).

tff(c_9,plain,
    a('#skF_4','#skF_3'),
    inference(splitLeft,[status(thm)],[c_8]) ).

tff(c_13,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_11,c_9]) ).

tff(c_14,plain,
    a('#skF_1','#skF_2'),
    inference(splitRight,[status(thm)],[c_4]) ).

tff(c_18,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_15,c_14]) ).

tff(c_19,plain,
    ! [X_2,Y_1] : ~ a(X_2,Y_1),
    inference(splitRight,[status(thm)],[c_2]) ).

tff(c_22,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_19,c_14]) ).

tff(c_24,plain,
    ~ a('#skF_4','#skF_3'),
    inference(splitRight,[status(thm)],[c_8]) ).

tff(c_6,plain,
    ! [X_2,Y_1] :
      ( ~ a(X_2,Y_1)
      | a('#skF_4','#skF_3') ),
    inference(cnfTransformation,[status(thm)],[f_30]) ).

tff(c_25,plain,
    ! [X_2,Y_1] : ~ a(X_2,Y_1),
    inference(splitLeft,[status(thm)],[c_6]) ).

tff(c_23,plain,
    a('#skF_1','#skF_2'),
    inference(splitRight,[status(thm)],[c_8]) ).

tff(c_27,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_25,c_23]) ).

tff(c_28,plain,
    a('#skF_4','#skF_3'),
    inference(splitRight,[status(thm)],[c_6]) ).

tff(c_29,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_24,c_28]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SYN960+1 : TPTP v8.1.2. Released v3.1.0.
% 0.07/0.13  % Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -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.35  % Computer : n023.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Thu Aug  3 17:41:22 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 2.30/1.52  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.30/1.52  
% 2.30/1.52  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.30/1.56  
% 2.30/1.56  Inference rules
% 2.30/1.56  ----------------------
% 2.30/1.56  #Ref     : 0
% 2.30/1.56  #Sup     : 0
% 2.30/1.56  #Fact    : 0
% 2.30/1.56  #Define  : 0
% 2.30/1.56  #Split   : 4
% 2.30/1.56  #Chain   : 0
% 2.30/1.56  #Close   : 0
% 2.30/1.56  
% 2.30/1.56  Ordering : KBO
% 2.30/1.56  
% 2.30/1.56  Simplification rules
% 2.30/1.56  ----------------------
% 2.30/1.56  #Subsume      : 1
% 2.30/1.56  #Demod        : 1
% 2.30/1.56  #Tautology    : 1
% 2.30/1.56  #SimpNegUnit  : 7
% 2.30/1.56  #BackRed      : 6
% 2.30/1.56  
% 2.30/1.56  #Partial instantiations: 0
% 2.30/1.56  #Strategies tried      : 1
% 2.30/1.56  
% 2.30/1.56  Timing (in seconds)
% 2.30/1.56  ----------------------
% 2.30/1.57  Preprocessing        : 0.37
% 2.30/1.57  Parsing              : 0.20
% 2.30/1.57  CNF conversion       : 0.02
% 2.30/1.57  Main loop            : 0.12
% 2.30/1.57  Inferencing          : 0.04
% 2.30/1.57  Reduction            : 0.02
% 2.30/1.57  Demodulation         : 0.01
% 2.30/1.57  BG Simplification    : 0.01
% 2.30/1.57  Subsumption          : 0.03
% 2.30/1.57  Abstraction          : 0.00
% 2.30/1.57  MUC search           : 0.00
% 2.30/1.57  Cooper               : 0.00
% 2.30/1.57  Total                : 0.55
% 2.30/1.57  Index Insertion      : 0.00
% 2.30/1.57  Index Deletion       : 0.00
% 2.30/1.57  Index Matching       : 0.00
% 2.30/1.57  BG Taut test         : 0.00
%------------------------------------------------------------------------------