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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SYN219-1 : TPTP v8.1.2. Released v1.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 : n002.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:10:00 EDT 2023

% Result   : Unsatisfiable 26.91s 13.52s
% Output   : CNFRefutation 27.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   68
% Syntax   : Number of formulae    :  108 (  30 unt;  53 typ;   0 def)
%            Number of atoms       :  100 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   96 (  51   ~;  45   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   90 (  48   >;  42   *;   0   +;   0  <<)
%            Number of predicates  :   49 (  48 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   58 (;  58   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ r3 > q2 > q1 > p5 > p4 > p3 > p2 > p1 > n1 > m3 > m1 > m0 > k3 > s3 > r5 > q5 > q4 > q3 > q0 > p0 > n5 > n4 > n0 > m5 > m4 > l3 > l2 > l1 > k2 > s5 > s4 > s2 > s1 > s0 > r4 > r2 > r1 > r0 > n3 > n2 > m2 > l5 > l4 > l0 > k5 > k4 > k1 > k0 > #nlpp > e > d > c > b > a

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(f_54,axiom,
    n0(e,b),
    file(unknown,unknown) ).

tff(f_66,axiom,
    ! [X,Y] : m0(X,d,Y),
    file(unknown,unknown) ).

tff(f_59,axiom,
    ! [X] : p0(b,X),
    file(unknown,unknown) ).

tff(f_63,axiom,
    ! [X] : q0(X,d),
    file(unknown,unknown) ).

tff(f_1081,axiom,
    ! [F,G,H] :
      ( s1(F)
      | ~ q0(F,G)
      | ~ s1(H) ),
    file(unknown,unknown) ).

tff(f_1073,axiom,
    ! [I] :
      ( s1(I)
      | ~ p0(I,I) ),
    file(unknown,unknown) ).

tff(f_1141,axiom,
    ! [J,A,B,C] :
      ( l2(J,J)
      | ~ p0(A,A)
      | ~ s1(B)
      | ~ m0(C,B,J) ),
    file(unknown,unknown) ).

tff(f_1164,axiom,
    ( m2(b)
    | ~ k1(b) ),
    file(unknown,unknown) ).

tff(f_60,axiom,
    n0(a,b),
    file(unknown,unknown) ).

tff(f_91,axiom,
    ! [I,J] :
      ( k1(I)
      | ~ n0(J,I) ),
    file(unknown,unknown) ).

tff(f_71,axiom,
    l0(c),
    file(unknown,unknown) ).

tff(f_1546,axiom,
    ! [D,E] :
      ( q2(D,c,E)
      | ~ k1(E)
      | ~ l0(c)
      | ~ l2(E,D) ),
    file(unknown,unknown) ).

tff(f_1597,axiom,
    ! [H] :
      ( s2(H)
      | ~ q2(b,H,b)
      | ~ s1(b) ),
    file(unknown,unknown) ).

tff(f_1123,axiom,
    ! [D,E] :
      ( l2(D,E)
      | ~ s1(D)
      | ~ n0(e,E)
      | ~ l2(E,E) ),
    file(unknown,unknown) ).

tff(f_2764,axiom,
    ~ l2(e,b),
    file(unknown,unknown) ).

tff(c_22,plain,
    n0(e,b),
    inference(cnfTransformation,[status(thm)],[f_54]) ).

tff(c_38,plain,
    ! [X_4,Y_5] : m0(X_4,d,Y_5),
    inference(cnfTransformation,[status(thm)],[f_66]) ).

tff(c_28,plain,
    ! [X_2] : p0(b,X_2),
    inference(cnfTransformation,[status(thm)],[f_59]) ).

tff(c_34,plain,
    ! [X_3] : q0(X_3,d),
    inference(cnfTransformation,[status(thm)],[f_63]) ).

tff(c_328,plain,
    ! [H_236,F_234,G_235] :
      ( ~ s1(H_236)
      | ~ q0(F_234,G_235)
      | s1(F_234) ),
    inference(cnfTransformation,[status(thm)],[f_1081]) ).

tff(c_45668,plain,
    ! [H_236] : ~ s1(H_236),
    inference(splitLeft,[status(thm)],[c_328]) ).

tff(c_1189,plain,
    ! [I_705] :
      ( ~ p0(I_705,I_705)
      | s1(I_705) ),
    inference(cnfTransformation,[status(thm)],[f_1073]) ).

tff(c_1194,plain,
    s1(b),
    inference(resolution,[status(thm)],[c_28,c_1189]) ).

tff(c_45672,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_45668,c_1194]) ).

tff(c_45674,plain,
    ! [F_6574,G_6575] :
      ( ~ q0(F_6574,G_6575)
      | s1(F_6574) ),
    inference(splitRight,[status(thm)],[c_328]) ).

tff(c_45693,plain,
    ! [X_3] : s1(X_3),
    inference(resolution,[status(thm)],[c_34,c_45674]) ).

tff(c_342,plain,
    ! [C_249,B_248,J_246,A_247] :
      ( ~ m0(C_249,B_248,J_246)
      | ~ s1(B_248)
      | ~ p0(A_247,A_247)
      | l2(J_246,J_246) ),
    inference(cnfTransformation,[status(thm)],[f_1141]) ).

tff(c_53230,plain,
    ! [C_249,B_248,J_246,A_247] :
      ( ~ m0(C_249,B_248,J_246)
      | ~ p0(A_247,A_247)
      | l2(J_246,J_246) ),
    inference(demodulation,[status(thm),theory(equality)],[c_45693,c_342]) ).

tff(c_53232,plain,
    ! [A_7501] : ~ p0(A_7501,A_7501),
    inference(splitLeft,[status(thm)],[c_53230]) ).

tff(c_53237,plain,
    $false,
    inference(resolution,[status(thm)],[c_28,c_53232]) ).

tff(c_53240,plain,
    ! [C_7502,B_7503,J_7504] :
      ( ~ m0(C_7502,B_7503,J_7504)
      | l2(J_7504,J_7504) ),
    inference(splitRight,[status(thm)],[c_53230]) ).

tff(c_53261,plain,
    ! [Y_5] : l2(Y_5,Y_5),
    inference(resolution,[status(thm)],[c_38,c_53240]) ).

tff(c_348,plain,
    ( ~ k1(b)
    | m2(b) ),
    inference(cnfTransformation,[status(thm)],[f_1164]) ).

tff(c_1142,plain,
    ~ k1(b),
    inference(splitLeft,[status(thm)],[c_348]) ).

tff(c_30,plain,
    n0(a,b),
    inference(cnfTransformation,[status(thm)],[f_60]) ).

tff(c_1154,plain,
    ! [J_700,I_701] :
      ( ~ n0(J_700,I_701)
      | k1(I_701) ),
    inference(cnfTransformation,[status(thm)],[f_91]) ).

tff(c_1160,plain,
    k1(b),
    inference(resolution,[status(thm)],[c_30,c_1154]) ).

tff(c_1183,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_1142,c_1160]) ).

tff(c_1185,plain,
    k1(b),
    inference(splitRight,[status(thm)],[c_348]) ).

tff(c_48,plain,
    l0(c),
    inference(cnfTransformation,[status(thm)],[f_71]) ).

tff(c_442,plain,
    ! [E_332,D_331] :
      ( ~ l2(E_332,D_331)
      | ~ l0(c)
      | ~ k1(E_332)
      | q2(D_331,c,E_332) ),
    inference(cnfTransformation,[status(thm)],[f_1546]) ).

tff(c_49476,plain,
    ! [E_7104,D_7105] :
      ( ~ l2(E_7104,D_7105)
      | ~ k1(E_7104)
      | q2(D_7105,c,E_7104) ),
    inference(demodulation,[status(thm),theory(equality)],[c_48,c_442]) ).

tff(c_454,plain,
    ! [H_345] :
      ( ~ s1(b)
      | ~ q2(b,H_345,b)
      | s2(H_345) ),
    inference(cnfTransformation,[status(thm)],[f_1597]) ).

tff(c_49181,plain,
    ! [H_345] :
      ( ~ q2(b,H_345,b)
      | s2(H_345) ),
    inference(demodulation,[status(thm),theory(equality)],[c_45693,c_454]) ).

tff(c_49480,plain,
    ( s2(c)
    | ~ l2(b,b)
    | ~ k1(b) ),
    inference(resolution,[status(thm)],[c_49476,c_49181]) ).

tff(c_49483,plain,
    ( s2(c)
    | ~ l2(b,b) ),
    inference(demodulation,[status(thm),theory(equality)],[c_1185,c_49480]) ).

tff(c_49484,plain,
    ~ l2(b,b),
    inference(splitLeft,[status(thm)],[c_49483]) ).

tff(c_53365,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_53261,c_49484]) ).

tff(c_53367,plain,
    l2(b,b),
    inference(splitRight,[status(thm)],[c_49483]) ).

tff(c_338,plain,
    ! [E_245,D_244] :
      ( ~ l2(E_245,E_245)
      | ~ n0(e,E_245)
      | ~ s1(D_244)
      | l2(D_244,E_245) ),
    inference(cnfTransformation,[status(thm)],[f_1123]) ).

tff(c_55691,plain,
    ! [E_7758,D_7759] :
      ( ~ l2(E_7758,E_7758)
      | ~ n0(e,E_7758)
      | l2(D_7759,E_7758) ),
    inference(demodulation,[status(thm),theory(equality)],[c_45693,c_338]) ).

tff(c_55693,plain,
    ! [D_7759] :
      ( ~ n0(e,b)
      | l2(D_7759,b) ),
    inference(resolution,[status(thm)],[c_53367,c_55691]) ).

tff(c_55696,plain,
    ! [D_7759] : l2(D_7759,b),
    inference(demodulation,[status(thm),theory(equality)],[c_22,c_55693]) ).

tff(c_738,plain,
    ~ l2(e,b),
    inference(cnfTransformation,[status(thm)],[f_2764]) ).

tff(c_55700,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_55696,c_738]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem  : SYN219-1 : TPTP v8.1.2. Released v1.1.0.
% 0.00/0.15  % 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.15/0.36  % Computer : n002.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37  % CPULimit : 300
% 0.15/0.37  % WCLimit  : 300
% 0.15/0.37  % DateTime : Thu Aug  3 17:35:01 EDT 2023
% 0.15/0.37  % CPUTime  : 
% 26.91/13.52  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 26.91/13.53  
% 26.91/13.53  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 27.18/13.56  
% 27.18/13.56  Inference rules
% 27.18/13.56  ----------------------
% 27.18/13.56  #Ref     : 0
% 27.18/13.56  #Sup     : 9553
% 27.18/13.56  #Fact    : 0
% 27.18/13.56  #Define  : 0
% 27.18/13.56  #Split   : 1038
% 27.18/13.56  #Chain   : 0
% 27.18/13.56  #Close   : 0
% 27.18/13.56  
% 27.18/13.56  Ordering : KBO
% 27.18/13.56  
% 27.18/13.56  Simplification rules
% 27.18/13.56  ----------------------
% 27.18/13.56  #Subsume      : 2471
% 27.18/13.56  #Demod        : 10638
% 27.18/13.56  #Tautology    : 7152
% 27.18/13.56  #SimpNegUnit  : 586
% 27.18/13.56  #BackRed      : 663
% 27.18/13.56  
% 27.18/13.56  #Partial instantiations: 0
% 27.18/13.56  #Strategies tried      : 1
% 27.18/13.56  
% 27.18/13.56  Timing (in seconds)
% 27.18/13.56  ----------------------
% 27.18/13.57  Preprocessing        : 1.04
% 27.18/13.57  Parsing              : 0.58
% 27.18/13.57  CNF conversion       : 0.09
% 27.18/13.57  Main loop            : 11.43
% 27.18/13.57  Inferencing          : 3.77
% 27.18/13.57  Reduction            : 4.22
% 27.18/13.57  Demodulation         : 2.78
% 27.18/13.57  BG Simplification    : 0.14
% 27.18/13.57  Subsumption          : 2.30
% 27.18/13.57  Abstraction          : 0.12
% 27.18/13.57  MUC search           : 0.00
% 27.18/13.57  Cooper               : 0.00
% 27.18/13.57  Total                : 12.53
% 27.18/13.57  Index Insertion      : 0.00
% 27.18/13.57  Index Deletion       : 0.00
% 27.18/13.57  Index Matching       : 0.00
% 27.18/13.57  BG Taut test         : 0.00
%------------------------------------------------------------------------------