TSTP Solution File: SYN006-1 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SYN006-1 : TPTP v8.1.2. Released v1.0.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 : n017.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:08:30 EDT 2023

% Result   : Unsatisfiable 2.69s 1.61s
% Output   : CNFRefutation 2.79s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   16
% Syntax   : Number of formulae    :   29 (  11 unt;   9 typ;   0 def)
%            Number of atoms       :   33 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   30 (  17   ~;  13   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   14 (   8   >;   6   *;   0   +;   0  <<)
%            Number of predicates  :    7 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-1 aty)
%            Number of variables   :   36 (;  36   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ q4 > q3 > q2 > q1 > p2 > p1 > #nlpp > g > f > a

%Foreground sorts:

%Background operators:

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

tff(a,type,
    a: $i ).

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

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

tff(f,type,
    f: $i > $i ).

tff(g,type,
    g: $i > $i ).

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

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

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

tff(f_30,axiom,
    ! [Y] : p1(a,Y),
    file(unknown,unknown) ).

tff(f_33,axiom,
    ! [X,Y] : ~ q2(X,f(Y)),
    file(unknown,unknown) ).

tff(f_28,axiom,
    ! [X,Y] :
      ( ~ p1(X,f(Y))
      | q1(f(X),Y)
      | q2(X,f(Y)) ),
    file(unknown,unknown) ).

tff(f_51,axiom,
    ! [X,Y] :
      ( ~ q1(X,f(Y))
      | p2(f(X),Y) ),
    file(unknown,unknown) ).

tff(f_43,axiom,
    ! [X,Y] : ~ q3(X,g(Y)),
    file(unknown,unknown) ).

tff(f_40,axiom,
    ! [X,Y] :
      ( ~ p2(X,f(Y))
      | q3(f(X),Y)
      | q4(X,f(Y)) ),
    file(unknown,unknown) ).

tff(f_46,axiom,
    ! [X,Y] : ~ q4(f(f(X)),f(g(f(Y)))),
    file(unknown,unknown) ).

tff(c_4,plain,
    ! [Y_3] : p1(a,Y_3),
    inference(cnfTransformation,[status(thm)],[f_30]) ).

tff(c_6,plain,
    ! [X_4,Y_5] : ~ q2(X_4,f(Y_5)),
    inference(cnfTransformation,[status(thm)],[f_33]) ).

tff(c_2,plain,
    ! [X_1,Y_2] :
      ( q2(X_1,f(Y_2))
      | q1(f(X_1),Y_2)
      | ~ p1(X_1,f(Y_2)) ),
    inference(cnfTransformation,[status(thm)],[f_28]) ).

tff(c_15,plain,
    ! [X_1,Y_2] :
      ( q1(f(X_1),Y_2)
      | ~ p1(X_1,f(Y_2)) ),
    inference(negUnitSimplification,[status(thm)],[c_6,c_2]) ).

tff(c_21,plain,
    ! [X_23,Y_24] :
      ( p2(f(X_23),Y_24)
      | ~ q1(X_23,f(Y_24)) ),
    inference(cnfTransformation,[status(thm)],[f_51]) ).

tff(c_26,plain,
    ! [X_1,Y_24] :
      ( p2(f(f(X_1)),Y_24)
      | ~ p1(X_1,f(f(Y_24))) ),
    inference(resolution,[status(thm)],[c_15,c_21]) ).

tff(c_10,plain,
    ! [X_8,Y_9] : ~ q3(X_8,g(Y_9)),
    inference(cnfTransformation,[status(thm)],[f_43]) ).

tff(c_28,plain,
    ! [X_27,Y_28] :
      ( q4(X_27,f(Y_28))
      | q3(f(X_27),Y_28)
      | ~ p2(X_27,f(Y_28)) ),
    inference(cnfTransformation,[status(thm)],[f_40]) ).

tff(c_12,plain,
    ! [X_10,Y_11] : ~ q4(f(f(X_10)),f(g(f(Y_11)))),
    inference(cnfTransformation,[status(thm)],[f_46]) ).

tff(c_31,plain,
    ! [X_10,Y_11] :
      ( q3(f(f(f(X_10))),g(f(Y_11)))
      | ~ p2(f(f(X_10)),f(g(f(Y_11)))) ),
    inference(resolution,[status(thm)],[c_28,c_12]) ).

tff(c_35,plain,
    ! [X_29,Y_30] : ~ p2(f(f(X_29)),f(g(f(Y_30)))),
    inference(negUnitSimplification,[status(thm)],[c_10,c_31]) ).

tff(c_41,plain,
    ! [X_31,Y_32] : ~ p1(X_31,f(f(f(g(f(Y_32)))))),
    inference(resolution,[status(thm)],[c_26,c_35]) ).

tff(c_46,plain,
    $false,
    inference(resolution,[status(thm)],[c_4,c_41]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SYN006-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.14  % 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 : n017.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 16:57:06 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 2.69/1.61  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.69/1.62  
% 2.69/1.62  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.79/1.65  
% 2.79/1.65  Inference rules
% 2.79/1.65  ----------------------
% 2.79/1.65  #Ref     : 0
% 2.79/1.65  #Sup     : 4
% 2.79/1.65  #Fact    : 0
% 2.79/1.65  #Define  : 0
% 2.79/1.65  #Split   : 0
% 2.79/1.65  #Chain   : 0
% 2.79/1.65  #Close   : 0
% 2.79/1.65  
% 2.79/1.65  Ordering : KBO
% 2.79/1.65  
% 2.79/1.65  Simplification rules
% 2.79/1.65  ----------------------
% 2.79/1.65  #Subsume      : 0
% 2.79/1.65  #Demod        : 0
% 2.79/1.65  #Tautology    : 0
% 2.79/1.65  #SimpNegUnit  : 2
% 2.79/1.65  #BackRed      : 0
% 2.79/1.65  
% 2.79/1.65  #Partial instantiations: 0
% 2.79/1.65  #Strategies tried      : 1
% 2.79/1.65  
% 2.79/1.65  Timing (in seconds)
% 2.79/1.65  ----------------------
% 2.79/1.65  Preprocessing        : 0.42
% 2.79/1.65  Parsing              : 0.23
% 2.79/1.65  CNF conversion       : 0.02
% 2.79/1.65  Main loop            : 0.18
% 2.79/1.65  Inferencing          : 0.09
% 2.79/1.65  Reduction            : 0.04
% 2.79/1.65  Demodulation         : 0.02
% 2.79/1.65  BG Simplification    : 0.01
% 2.79/1.65  Subsumption          : 0.02
% 2.79/1.65  Abstraction          : 0.01
% 2.79/1.65  MUC search           : 0.00
% 2.79/1.65  Cooper               : 0.00
% 2.79/1.65  Total                : 0.64
% 2.79/1.65  Index Insertion      : 0.00
% 2.79/1.65  Index Deletion       : 0.00
% 2.79/1.65  Index Matching       : 0.00
% 2.79/1.65  BG Taut test         : 0.00
%------------------------------------------------------------------------------