TSTP Solution File: SYN206-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN206-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:56 EDT 2023
% Result : Unsatisfiable 129.44s 112.93s
% Output : CNFRefutation 129.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 66
% Syntax : Number of formulae : 94 ( 20 unt; 53 typ; 0 def)
% Number of atoms : 71 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 64 ( 34 ~; 30 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 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 : 52 (; 52 !; 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_60,axiom,
n0(a,b),
file(unknown,unknown) ).
tff(f_96,axiom,
! [G,H] :
( l1(G,G)
| ~ n0(H,G) ),
file(unknown,unknown) ).
tff(f_1567,axiom,
! [G,H] :
( q2(G,G,H)
| ~ l1(H,G) ),
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_59,axiom,
! [X] : p0(b,X),
file(unknown,unknown) ).
tff(f_1073,axiom,
! [I] :
( s1(I)
| ~ p0(I,I) ),
file(unknown,unknown) ).
tff(f_1597,axiom,
! [H] :
( s2(H)
| ~ q2(b,H,b)
| ~ s1(b) ),
file(unknown,unknown) ).
tff(f_761,axiom,
! [B,C] :
( p1(B,B,B)
| ~ p0(C,B) ),
file(unknown,unknown) ).
tff(f_1524,axiom,
! [I] :
( q2(I,I,I)
| ~ p1(I,I,I) ),
file(unknown,unknown) ).
tff(f_66,axiom,
! [X,Y] : m0(X,d,Y),
file(unknown,unknown) ).
tff(f_2297,axiom,
! [I,J,A,B] :
( s3(I,J)
| ~ q2(A,I,A)
| ~ s2(I)
| ~ m0(A,B,J) ),
file(unknown,unknown) ).
tff(f_2764,axiom,
~ s3(b,b),
file(unknown,unknown) ).
tff(c_30,plain,
n0(a,b),
inference(cnfTransformation,[status(thm)],[f_60]) ).
tff(c_14359,plain,
! [H_2653,G_2654] :
( ~ n0(H_2653,G_2654)
| l1(G_2654,G_2654) ),
inference(cnfTransformation,[status(thm)],[f_96]) ).
tff(c_14376,plain,
l1(b,b),
inference(resolution,[status(thm)],[c_30,c_14359]) ).
tff(c_448,plain,
! [H_339,G_338] :
( ~ l1(H_339,G_338)
| q2(G_338,G_338,H_339) ),
inference(cnfTransformation,[status(thm)],[f_1567]) ).
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_377784,plain,
! [H_236] : ~ s1(H_236),
inference(splitLeft,[status(thm)],[c_328]) ).
tff(c_28,plain,
! [X_2] : p0(b,X_2),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_1416,plain,
! [I_755] :
( ~ p0(I_755,I_755)
| s1(I_755) ),
inference(cnfTransformation,[status(thm)],[f_1073]) ).
tff(c_1421,plain,
s1(b),
inference(resolution,[status(thm)],[c_28,c_1416]) ).
tff(c_377788,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_377784,c_1421]) ).
tff(c_377799,plain,
! [F_41055,G_41056] :
( ~ q0(F_41055,G_41056)
| s1(F_41055) ),
inference(splitRight,[status(thm)],[c_328]) ).
tff(c_377822,plain,
! [X_3] : s1(X_3),
inference(resolution,[status(thm)],[c_34,c_377799]) ).
tff(c_454,plain,
! [H_345] :
( ~ s1(b)
| ~ q2(b,H_345,b)
| s2(H_345) ),
inference(cnfTransformation,[status(thm)],[f_1597]) ).
tff(c_524576,plain,
! [H_55184] :
( ~ q2(b,H_55184,b)
| s2(H_55184) ),
inference(demodulation,[status(thm),theory(equality)],[c_377822,c_454]) ).
tff(c_524580,plain,
( s2(b)
| ~ l1(b,b) ),
inference(resolution,[status(thm)],[c_448,c_524576]) ).
tff(c_524583,plain,
s2(b),
inference(demodulation,[status(thm),theory(equality)],[c_14376,c_524580]) ).
tff(c_237124,plain,
! [C_27595,B_27596] :
( ~ p0(C_27595,B_27596)
| p1(B_27596,B_27596,B_27596) ),
inference(cnfTransformation,[status(thm)],[f_761]) ).
tff(c_237130,plain,
! [X_2] : p1(X_2,X_2,X_2),
inference(resolution,[status(thm)],[c_28,c_237124]) ).
tff(c_438,plain,
! [I_327] :
( ~ p1(I_327,I_327,I_327)
| q2(I_327,I_327,I_327) ),
inference(cnfTransformation,[status(thm)],[f_1524]) ).
tff(c_525008,plain,
! [I_327] : q2(I_327,I_327,I_327),
inference(demodulation,[status(thm),theory(equality)],[c_237130,c_438]) ).
tff(c_38,plain,
! [X_4,Y_5] : m0(X_4,d,Y_5),
inference(cnfTransformation,[status(thm)],[f_66]) ).
tff(c_555396,plain,
! [A_57763,B_57764,J_57765,I_57766] :
( ~ m0(A_57763,B_57764,J_57765)
| ~ s2(I_57766)
| ~ q2(A_57763,I_57766,A_57763)
| s3(I_57766,J_57765) ),
inference(cnfTransformation,[status(thm)],[f_2297]) ).
tff(c_556454,plain,
! [I_57841,X_57842,Y_57843] :
( ~ s2(I_57841)
| ~ q2(X_57842,I_57841,X_57842)
| s3(I_57841,Y_57843) ),
inference(resolution,[status(thm)],[c_38,c_555396]) ).
tff(c_556483,plain,
! [I_57845,Y_57846] :
( ~ s2(I_57845)
| s3(I_57845,Y_57846) ),
inference(resolution,[status(thm)],[c_525008,c_556454]) ).
tff(c_738,plain,
~ s3(b,b),
inference(cnfTransformation,[status(thm)],[f_2764]) ).
tff(c_556489,plain,
~ s2(b),
inference(resolution,[status(thm)],[c_556483,c_738]) ).
tff(c_556494,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_524583,c_556489]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN206-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.13/0.34 % Computer : n008.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 3 17:32:03 EDT 2023
% 0.13/0.34 % CPUTime :
% 129.44/112.93 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 129.46/112.94
% 129.46/112.94 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 129.46/112.98
% 129.46/112.98 Inference rules
% 129.46/112.98 ----------------------
% 129.46/112.98 #Ref : 0
% 129.46/112.98 #Sup : 100158
% 129.46/112.98 #Fact : 0
% 129.46/112.98 #Define : 0
% 129.46/112.98 #Split : 8984
% 129.46/112.98 #Chain : 0
% 129.46/112.98 #Close : 0
% 129.46/112.98
% 129.46/112.98 Ordering : KBO
% 129.46/112.98
% 129.46/112.98 Simplification rules
% 129.46/112.98 ----------------------
% 129.46/112.98 #Subsume : 33051
% 129.46/112.98 #Demod : 100136
% 129.46/112.98 #Tautology : 58160
% 129.46/112.98 #SimpNegUnit : 7124
% 129.46/112.98 #BackRed : 7438
% 129.46/112.98
% 129.46/112.98 #Partial instantiations: 0
% 129.46/112.98 #Strategies tried : 1
% 129.46/112.98
% 129.46/112.98 Timing (in seconds)
% 129.46/112.98 ----------------------
% 129.46/112.98 Preprocessing : 1.06
% 129.46/112.98 Parsing : 0.58
% 129.46/112.98 CNF conversion : 0.10
% 129.46/112.98 Main loop : 110.87
% 129.46/112.98 Inferencing : 31.82
% 129.46/112.98 Reduction : 46.68
% 129.46/112.98 Demodulation : 32.58
% 129.46/112.98 BG Simplification : 0.40
% 129.46/112.98 Subsumption : 24.60
% 129.46/112.98 Abstraction : 0.90
% 129.46/112.98 MUC search : 0.00
% 129.46/112.98 Cooper : 0.00
% 129.46/112.98 Total : 111.98
% 129.46/112.98 Index Insertion : 0.00
% 129.46/112.98 Index Deletion : 0.00
% 129.46/112.98 Index Matching : 0.00
% 129.46/112.98 BG Taut test : 0.00
%------------------------------------------------------------------------------