TSTP Solution File: SYN109-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN109-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/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/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:38 EDT 2023
% Result : Unsatisfiable 45.76s 32.67s
% Output : CNFRefutation 45.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 63
% Syntax : Number of formulae : 81 ( 14 unt; 53 typ; 0 def)
% Number of atoms : 52 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 51 ( 27 ~; 24 |; 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 : 39 (; 39 !; 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_52,axiom,
r0(b),
file(unknown,unknown) ).
tff(f_73,axiom,
n0(d,c),
file(unknown,unknown) ).
tff(f_91,axiom,
! [I,J] :
( k1(I)
| ~ n0(J,I) ),
file(unknown,unknown) ).
tff(f_59,axiom,
! [X] : p0(b,X),
file(unknown,unknown) ).
tff(f_136,axiom,
! [G,H,I] :
( m1(G,H,G)
| ~ p0(I,H)
| ~ r0(G) ),
file(unknown,unknown) ).
tff(f_66,axiom,
! [X,Y] : m0(X,d,Y),
file(unknown,unknown) ).
tff(f_942,axiom,
! [A] :
( q1(e,A,A)
| ~ m0(A,d,A)
| ~ m0(e,d,A) ),
file(unknown,unknown) ).
tff(f_1108,axiom,
! [J,A] :
( k2(J,J)
| ~ q1(A,J,J) ),
file(unknown,unknown) ).
tff(f_1092,axiom,
! [C,D,E,F] :
( k2(C,D)
| ~ m1(E,D,C)
| ~ k1(F)
| ~ k2(F,D) ),
file(unknown,unknown) ).
tff(f_2764,axiom,
~ k2(b,c),
file(unknown,unknown) ).
tff(c_18,plain,
r0(b),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_52,plain,
n0(d,c),
inference(cnfTransformation,[status(thm)],[f_73]) ).
tff(c_18798,plain,
! [J_3304,I_3305] :
( ~ n0(J_3304,I_3305)
| k1(I_3305) ),
inference(cnfTransformation,[status(thm)],[f_91]) ).
tff(c_18828,plain,
k1(c),
inference(resolution,[status(thm)],[c_52,c_18798]) ).
tff(c_28,plain,
! [X_2] : p0(b,X_2),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_155094,plain,
! [G_18580,I_18581,H_18582] :
( ~ r0(G_18580)
| ~ p0(I_18581,H_18582)
| m1(G_18580,H_18582,G_18580) ),
inference(cnfTransformation,[status(thm)],[f_136]) ).
tff(c_155099,plain,
! [G_18580,X_2] :
( ~ r0(G_18580)
| m1(G_18580,X_2,G_18580) ),
inference(resolution,[status(thm)],[c_28,c_155094]) ).
tff(c_38,plain,
! [X_4,Y_5] : m0(X_4,d,Y_5),
inference(cnfTransformation,[status(thm)],[f_66]) ).
tff(c_290,plain,
! [A_205] :
( ~ m0(e,d,A_205)
| ~ m0(A_205,d,A_205)
| q1(e,A_205,A_205) ),
inference(cnfTransformation,[status(thm)],[f_942]) ).
tff(c_774,plain,
! [A_205] : q1(e,A_205,A_205),
inference(demodulation,[status(thm),theory(equality)],[c_38,c_38,c_290]) ).
tff(c_144252,plain,
! [A_17179,J_17180] :
( ~ q1(A_17179,J_17180,J_17180)
| k2(J_17180,J_17180) ),
inference(cnfTransformation,[status(thm)],[f_1108]) ).
tff(c_144276,plain,
! [A_205] : k2(A_205,A_205),
inference(resolution,[status(thm)],[c_774,c_144252]) ).
tff(c_158706,plain,
! [F_18940,D_18941,E_18942,C_18943] :
( ~ k2(F_18940,D_18941)
| ~ k1(F_18940)
| ~ m1(E_18942,D_18941,C_18943)
| k2(C_18943,D_18941) ),
inference(cnfTransformation,[status(thm)],[f_1092]) ).
tff(c_159005,plain,
! [A_18964,E_18965,C_18966] :
( ~ k1(A_18964)
| ~ m1(E_18965,A_18964,C_18966)
| k2(C_18966,A_18964) ),
inference(resolution,[status(thm)],[c_144276,c_158706]) ).
tff(c_159169,plain,
! [X_18971,G_18972] :
( ~ k1(X_18971)
| k2(G_18972,X_18971)
| ~ r0(G_18972) ),
inference(resolution,[status(thm)],[c_155099,c_159005]) ).
tff(c_738,plain,
~ k2(b,c),
inference(cnfTransformation,[status(thm)],[f_2764]) ).
tff(c_159177,plain,
( ~ k1(c)
| ~ r0(b) ),
inference(resolution,[status(thm)],[c_159169,c_738]) ).
tff(c_159185,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_18,c_18828,c_159177]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN109-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/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.17/0.35 % Computer : n008.cluster.edu
% 0.17/0.35 % Model : x86_64 x86_64
% 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.35 % Memory : 8042.1875MB
% 0.17/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.35 % CPULimit : 300
% 0.17/0.35 % WCLimit : 300
% 0.17/0.35 % DateTime : Thu Aug 3 17:23:33 EDT 2023
% 0.17/0.35 % CPUTime :
% 45.76/32.67 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 45.76/32.67
% 45.76/32.67 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 45.76/32.71
% 45.76/32.71 Inference rules
% 45.76/32.71 ----------------------
% 45.76/32.71 #Ref : 0
% 45.76/32.71 #Sup : 27907
% 45.76/32.71 #Fact : 0
% 45.76/32.71 #Define : 0
% 45.76/32.71 #Split : 2831
% 45.76/32.71 #Chain : 0
% 45.76/32.71 #Close : 0
% 45.76/32.71
% 45.76/32.71 Ordering : KBO
% 45.76/32.71
% 45.76/32.71 Simplification rules
% 45.76/32.71 ----------------------
% 45.76/32.71 #Subsume : 8870
% 45.76/32.71 #Demod : 30166
% 45.76/32.71 #Tautology : 18882
% 45.76/32.71 #SimpNegUnit : 1911
% 45.76/32.71 #BackRed : 2107
% 45.76/32.71
% 45.76/32.71 #Partial instantiations: 0
% 45.76/32.71 #Strategies tried : 1
% 45.76/32.71
% 45.76/32.71 Timing (in seconds)
% 45.76/32.71 ----------------------
% 45.76/32.71 Preprocessing : 1.01
% 45.76/32.71 Parsing : 0.58
% 45.76/32.71 CNF conversion : 0.08
% 45.76/32.71 Main loop : 30.63
% 45.76/32.71 Inferencing : 9.34
% 45.76/32.71 Reduction : 12.30
% 45.76/32.71 Demodulation : 8.38
% 45.76/32.71 BG Simplification : 0.18
% 45.76/32.71 Subsumption : 6.51
% 45.76/32.71 Abstraction : 0.26
% 45.76/32.71 MUC search : 0.00
% 45.76/32.71 Cooper : 0.00
% 45.76/32.71 Total : 31.70
% 45.76/32.71 Index Insertion : 0.00
% 45.76/32.71 Index Deletion : 0.00
% 45.76/32.71 Index Matching : 0.00
% 45.76/32.71 BG Taut test : 0.00
%------------------------------------------------------------------------------