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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SYN117-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 : n008.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:09:40 EDT 2023

% Result   : Unsatisfiable 11.51s 3.81s
% Output   : CNFRefutation 11.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   66
% Syntax   : Number of formulae    :   96 (  21 unt;  53 typ;   0 def)
%            Number of atoms       :   71 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   62 (  34   ~;  28   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 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   :   59 (;  59   !;   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_59,axiom,
    ! [X] : p0(b,X),
    file(unknown,unknown) ).

tff(f_761,axiom,
    ! [B,C] :
      ( p1(B,B,B)
      | ~ p0(C,B) ),
    file(unknown,unknown) ).

tff(f_1169,axiom,
    ! [A,B,C] :
      ( n2(A)
      | ~ p1(B,C,A) ),
    file(unknown,unknown) ).

tff(f_77,axiom,
    n0(e,e),
    file(unknown,unknown) ).

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

tff(f_1475,axiom,
    ! [H] :
      ( p2(H,H,H)
      | ~ n2(H)
      | ~ k1(e) ),
    file(unknown,unknown) ).

tff(f_2231,axiom,
    ! [B,C,D] :
      ( r3(B,C,B)
      | ~ p2(B,D,C) ),
    file(unknown,unknown) ).

tff(f_2042,axiom,
    ! [H] :
      ( p3(H,H,H)
      | ~ n2(H) ),
    file(unknown,unknown) ).

tff(f_1112,axiom,
    ( k2(e,e)
    | ~ l1(e,e) ),
    file(unknown,unknown) ).

tff(f_96,axiom,
    ! [G,H] :
      ( l1(G,G)
      | ~ n0(H,G) ),
    file(unknown,unknown) ).

tff(f_2530,axiom,
    ! [E,F,G] :
      ( k5(E)
      | ~ s4(F)
      | ~ r3(G,E,E) ),
    file(unknown,unknown) ).

tff(f_2522,axiom,
    ! [A,B,C,D] :
      ( s4(A)
      | ~ p3(B,C,D)
      | ~ l1(A,C) ),
    file(unknown,unknown) ).

tff(f_2764,axiom,
    ~ k5(e),
    file(unknown,unknown) ).

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

tff(c_4237,plain,
    ! [C_1154,B_1155] :
      ( ~ p0(C_1154,B_1155)
      | p1(B_1155,B_1155,B_1155) ),
    inference(cnfTransformation,[status(thm)],[f_761]) ).

tff(c_4254,plain,
    ! [X_1156] : p1(X_1156,X_1156,X_1156),
    inference(resolution,[status(thm)],[c_28,c_4237]) ).

tff(c_350,plain,
    ! [B_257,C_258,A_256] :
      ( ~ p1(B_257,C_258,A_256)
      | n2(A_256) ),
    inference(cnfTransformation,[status(thm)],[f_1169]) ).

tff(c_4258,plain,
    ! [X_1156] : n2(X_1156),
    inference(resolution,[status(thm)],[c_4254,c_350]) ).

tff(c_60,plain,
    n0(e,e),
    inference(cnfTransformation,[status(thm)],[f_77]) ).

tff(c_1132,plain,
    ! [J_710,I_711] :
      ( ~ n0(J_710,I_711)
      | k1(I_711) ),
    inference(cnfTransformation,[status(thm)],[f_91]) ).

tff(c_1162,plain,
    k1(e),
    inference(resolution,[status(thm)],[c_60,c_1132]) ).

tff(c_424,plain,
    ! [H_315] :
      ( ~ k1(e)
      | ~ n2(H_315)
      | p2(H_315,H_315,H_315) ),
    inference(cnfTransformation,[status(thm)],[f_1475]) ).

tff(c_5000,plain,
    ! [H_1277] : p2(H_1277,H_1277,H_1277),
    inference(demodulation,[status(thm),theory(equality)],[c_4258,c_1162,c_424]) ).

tff(c_610,plain,
    ! [B_491,D_493,C_492] :
      ( ~ p2(B_491,D_493,C_492)
      | r3(B_491,C_492,B_491) ),
    inference(cnfTransformation,[status(thm)],[f_2231]) ).

tff(c_5006,plain,
    ! [H_1277] : r3(H_1277,H_1277,H_1277),
    inference(resolution,[status(thm)],[c_5000,c_610]) ).

tff(c_564,plain,
    ! [H_442] :
      ( ~ n2(H_442)
      | p3(H_442,H_442,H_442) ),
    inference(cnfTransformation,[status(thm)],[f_2042]) ).

tff(c_4271,plain,
    ! [H_442] : p3(H_442,H_442,H_442),
    inference(demodulation,[status(thm),theory(equality)],[c_4258,c_564]) ).

tff(c_336,plain,
    ( ~ l1(e,e)
    | k2(e,e) ),
    inference(cnfTransformation,[status(thm)],[f_1112]) ).

tff(c_1185,plain,
    ~ l1(e,e),
    inference(splitLeft,[status(thm)],[c_336]) ).

tff(c_1197,plain,
    ! [H_725,G_726] :
      ( ~ n0(H_725,G_726)
      | l1(G_726,G_726) ),
    inference(cnfTransformation,[status(thm)],[f_96]) ).

tff(c_1205,plain,
    l1(e,e),
    inference(resolution,[status(thm)],[c_60,c_1197]) ).

tff(c_1220,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_1185,c_1205]) ).

tff(c_1222,plain,
    l1(e,e),
    inference(splitRight,[status(thm)],[c_336]) ).

tff(c_676,plain,
    ! [G_574,E_572,F_573] :
      ( ~ r3(G_574,E_572,E_572)
      | ~ s4(F_573)
      | k5(E_572) ),
    inference(cnfTransformation,[status(thm)],[f_2530]) ).

tff(c_5086,plain,
    ! [F_573] : ~ s4(F_573),
    inference(splitLeft,[status(thm)],[c_676]) ).

tff(c_674,plain,
    ! [A_568,C_570,B_569,D_571] :
      ( ~ l1(A_568,C_570)
      | ~ p3(B_569,C_570,D_571)
      | s4(A_568) ),
    inference(cnfTransformation,[status(thm)],[f_2522]) ).

tff(c_5267,plain,
    ! [A_1319,C_1320,B_1321,D_1322] :
      ( ~ l1(A_1319,C_1320)
      | ~ p3(B_1321,C_1320,D_1322) ),
    inference(negUnitSimplification,[status(thm)],[c_5086,c_674]) ).

tff(c_5283,plain,
    ! [B_1323,D_1324] : ~ p3(B_1323,e,D_1324),
    inference(resolution,[status(thm)],[c_1222,c_5267]) ).

tff(c_5288,plain,
    $false,
    inference(resolution,[status(thm)],[c_4271,c_5283]) ).

tff(c_5290,plain,
    ! [G_1325,E_1326] :
      ( ~ r3(G_1325,E_1326,E_1326)
      | k5(E_1326) ),
    inference(splitRight,[status(thm)],[c_676]) ).

tff(c_5294,plain,
    ! [H_1277] : k5(H_1277),
    inference(resolution,[status(thm)],[c_5006,c_5290]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SYN117-1 : TPTP v8.1.2. Released v1.1.0.
% 0.00/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 : n008.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:30:48 EDT 2023
% 0.21/0.35  % CPUTime  : 
% 11.51/3.81  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 11.54/3.81  
% 11.54/3.81  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 11.54/3.84  
% 11.54/3.84  Inference rules
% 11.54/3.84  ----------------------
% 11.54/3.84  #Ref     : 0
% 11.54/3.84  #Sup     : 772
% 11.54/3.84  #Fact    : 0
% 11.54/3.84  #Define  : 0
% 11.54/3.84  #Split   : 96
% 11.54/3.84  #Chain   : 0
% 11.54/3.84  #Close   : 0
% 11.54/3.84  
% 11.54/3.84  Ordering : KBO
% 11.54/3.84  
% 11.54/3.84  Simplification rules
% 11.54/3.84  ----------------------
% 11.54/3.84  #Subsume      : 84
% 11.54/3.84  #Demod        : 1025
% 11.54/3.84  #Tautology    : 874
% 11.54/3.84  #SimpNegUnit  : 41
% 11.54/3.84  #BackRed      : 68
% 11.54/3.84  
% 11.54/3.84  #Partial instantiations: 0
% 11.54/3.84  #Strategies tried      : 1
% 11.54/3.84  
% 11.54/3.84  Timing (in seconds)
% 11.54/3.84  ----------------------
% 11.54/3.85  Preprocessing        : 1.03
% 11.54/3.85  Parsing              : 0.57
% 11.54/3.85  CNF conversion       : 0.09
% 11.54/3.85  Main loop            : 1.76
% 11.54/3.85  Inferencing          : 0.50
% 11.54/3.85  Reduction            : 0.63
% 11.54/3.85  Demodulation         : 0.40
% 11.54/3.85  BG Simplification    : 0.11
% 11.54/3.85  Subsumption          : 0.36
% 11.54/3.85  Abstraction          : 0.04
% 11.54/3.85  MUC search           : 0.00
% 11.54/3.85  Cooper               : 0.00
% 11.54/3.85  Total                : 2.85
% 11.54/3.85  Index Insertion      : 0.00
% 11.54/3.85  Index Deletion       : 0.00
% 11.54/3.85  Index Matching       : 0.00
% 11.54/3.85  BG Taut test         : 0.00
%------------------------------------------------------------------------------