TSTP Solution File: SYN195-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN195-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 : n019.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:53 EDT 2023
% Result : Unsatisfiable 11.92s 3.96s
% Output : CNFRefutation 12.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 65
% Syntax : Number of formulae : 89 ( 17 unt; 53 typ; 0 def)
% Number of atoms : 62 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 57 ( 31 ~; 26 |; 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 : 49 (; 49 !; 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_2042,axiom,
! [H] :
( p3(H,H,H)
| ~ n2(H) ),
file(unknown,unknown) ).
tff(f_81,axiom,
n0(c,d),
file(unknown,unknown) ).
tff(f_96,axiom,
! [G,H] :
( l1(G,G)
| ~ n0(H,G) ),
file(unknown,unknown) ).
tff(f_1480,axiom,
! [F,G] :
( p2(F,F,F)
| ~ l1(G,F) ),
file(unknown,unknown) ).
tff(f_2007,axiom,
! [D,E,F] :
( n3(D)
| ~ p2(E,F,D) ),
file(unknown,unknown) ).
tff(f_79,axiom,
k0(b),
file(unknown,unknown) ).
tff(f_2733,axiom,
! [C,D] :
( r5(C,D)
| ~ s4(C)
| ~ k0(b)
| ~ n3(D) ),
file(unknown,unknown) ).
tff(f_2764,axiom,
~ r5(d,d),
file(unknown,unknown) ).
tff(f_2522,axiom,
! [A,B,C,D] :
( s4(A)
| ~ p3(B,C,D)
| ~ l1(A,C) ),
file(unknown,unknown) ).
tff(c_28,plain,
! [X_2] : p0(b,X_2),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_3319,plain,
! [C_1065,B_1066] :
( ~ p0(C_1065,B_1066)
| p1(B_1066,B_1066,B_1066) ),
inference(cnfTransformation,[status(thm)],[f_761]) ).
tff(c_3342,plain,
! [X_1067] : p1(X_1067,X_1067,X_1067),
inference(resolution,[status(thm)],[c_28,c_3319]) ).
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_3346,plain,
! [X_1067] : n2(X_1067),
inference(resolution,[status(thm)],[c_3342,c_350]) ).
tff(c_564,plain,
! [H_442] :
( ~ n2(H_442)
| p3(H_442,H_442,H_442) ),
inference(cnfTransformation,[status(thm)],[f_2042]) ).
tff(c_3359,plain,
! [H_442] : p3(H_442,H_442,H_442),
inference(demodulation,[status(thm),theory(equality)],[c_3346,c_564]) ).
tff(c_68,plain,
n0(c,d),
inference(cnfTransformation,[status(thm)],[f_81]) ).
tff(c_1297,plain,
! [H_748,G_749] :
( ~ n0(H_748,G_749)
| l1(G_749,G_749) ),
inference(cnfTransformation,[status(thm)],[f_96]) ).
tff(c_1321,plain,
l1(d,d),
inference(resolution,[status(thm)],[c_68,c_1297]) ).
tff(c_3249,plain,
! [G_1060,F_1061] :
( ~ l1(G_1060,F_1061)
| p2(F_1061,F_1061,F_1061) ),
inference(cnfTransformation,[status(thm)],[f_1480]) ).
tff(c_3260,plain,
p2(d,d,d),
inference(resolution,[status(thm)],[c_1321,c_3249]) ).
tff(c_556,plain,
! [E_432,F_433,D_431] :
( ~ p2(E_432,F_433,D_431)
| n3(D_431) ),
inference(cnfTransformation,[status(thm)],[f_2007]) ).
tff(c_3272,plain,
n3(d),
inference(resolution,[status(thm)],[c_3260,c_556]) ).
tff(c_64,plain,
k0(b),
inference(cnfTransformation,[status(thm)],[f_79]) ).
tff(c_730,plain,
! [D_620,C_619] :
( ~ n3(D_620)
| ~ k0(b)
| ~ s4(C_619)
| r5(C_619,D_620) ),
inference(cnfTransformation,[status(thm)],[f_2733]) ).
tff(c_4379,plain,
! [D_1198,C_1199] :
( ~ n3(D_1198)
| ~ s4(C_1199)
| r5(C_1199,D_1198) ),
inference(demodulation,[status(thm),theory(equality)],[c_64,c_730]) ).
tff(c_738,plain,
~ r5(d,d),
inference(cnfTransformation,[status(thm)],[f_2764]) ).
tff(c_4382,plain,
( ~ n3(d)
| ~ s4(d) ),
inference(resolution,[status(thm)],[c_4379,c_738]) ).
tff(c_4385,plain,
~ s4(d),
inference(demodulation,[status(thm),theory(equality)],[c_3272,c_4382]) ).
tff(c_6433,plain,
! [A_1486,C_1487,B_1488,D_1489] :
( ~ l1(A_1486,C_1487)
| ~ p3(B_1488,C_1487,D_1489)
| s4(A_1486) ),
inference(cnfTransformation,[status(thm)],[f_2522]) ).
tff(c_6435,plain,
! [B_1488,D_1489] :
( ~ p3(B_1488,d,D_1489)
| s4(d) ),
inference(resolution,[status(thm)],[c_1321,c_6433]) ).
tff(c_6452,plain,
! [B_1490,D_1491] : ~ p3(B_1490,d,D_1491),
inference(negUnitSimplification,[status(thm)],[c_4385,c_6435]) ).
tff(c_6457,plain,
$false,
inference(resolution,[status(thm)],[c_3359,c_6452]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : SYN195-1 : TPTP v8.1.2. Released v1.1.0.
% 0.13/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.13/0.35 % Computer : n019.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 17:22:31 EDT 2023
% 0.13/0.35 % CPUTime :
% 11.92/3.96 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 11.92/3.97
% 11.92/3.97 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 12.08/4.00
% 12.08/4.00 Inference rules
% 12.08/4.00 ----------------------
% 12.08/4.00 #Ref : 0
% 12.08/4.00 #Sup : 982
% 12.08/4.00 #Fact : 0
% 12.08/4.00 #Define : 0
% 12.08/4.00 #Split : 110
% 12.08/4.00 #Chain : 0
% 12.08/4.00 #Close : 0
% 12.08/4.00
% 12.08/4.00 Ordering : KBO
% 12.08/4.00
% 12.08/4.00 Simplification rules
% 12.08/4.00 ----------------------
% 12.08/4.00 #Subsume : 111
% 12.08/4.00 #Demod : 1165
% 12.08/4.00 #Tautology : 967
% 12.08/4.00 #SimpNegUnit : 42
% 12.08/4.00 #BackRed : 47
% 12.08/4.00
% 12.08/4.00 #Partial instantiations: 0
% 12.08/4.00 #Strategies tried : 1
% 12.08/4.00
% 12.08/4.00 Timing (in seconds)
% 12.08/4.00 ----------------------
% 12.08/4.00 Preprocessing : 0.99
% 12.08/4.00 Parsing : 0.56
% 12.08/4.00 CNF conversion : 0.08
% 12.08/4.00 Main loop : 1.94
% 12.08/4.00 Inferencing : 0.59
% 12.08/4.00 Reduction : 0.69
% 12.08/4.00 Demodulation : 0.45
% 12.08/4.00 BG Simplification : 0.10
% 12.08/4.00 Subsumption : 0.37
% 12.08/4.00 Abstraction : 0.04
% 12.08/4.00 MUC search : 0.00
% 12.08/4.00 Cooper : 0.00
% 12.08/4.00 Total : 2.99
% 12.08/4.00 Index Insertion : 0.00
% 12.08/4.00 Index Deletion : 0.00
% 12.08/4.00 Index Matching : 0.00
% 12.08/4.00 BG Taut test : 0.00
%------------------------------------------------------------------------------