TSTP Solution File: SYN221-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN221-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 : n023.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 9.12s 3.06s
% Output : CNFRefutation 9.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 61
% Syntax : Number of formulae : 77 ( 14 unt; 53 typ; 0 def)
% Number of atoms : 36 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 27 ( 15 ~; 12 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 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 : 23 (; 23 !; 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_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_1823,axiom,
! [C] :
( l3(C,C)
| ~ n2(C)
| ~ m2(b) ),
file(unknown,unknown) ).
tff(f_2765,axiom,
! [X] : ~ l3(X,c),
file(unknown,unknown) ).
tff(c_28,plain,
! [X_2] : p0(b,X_2),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_1489,plain,
! [C_777,B_778] :
( ~ p0(C_777,B_778)
| p1(B_778,B_778,B_778) ),
inference(cnfTransformation,[status(thm)],[f_761]) ).
tff(c_1510,plain,
! [X_781] : p1(X_781,X_781,X_781),
inference(resolution,[status(thm)],[c_28,c_1489]) ).
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_1514,plain,
! [X_781] : n2(X_781),
inference(resolution,[status(thm)],[c_1510,c_350]) ).
tff(c_348,plain,
( ~ k1(b)
| m2(b) ),
inference(cnfTransformation,[status(thm)],[f_1164]) ).
tff(c_845,plain,
~ k1(b),
inference(splitLeft,[status(thm)],[c_348]) ).
tff(c_30,plain,
n0(a,b),
inference(cnfTransformation,[status(thm)],[f_60]) ).
tff(c_863,plain,
! [J_638,I_639] :
( ~ n0(J_638,I_639)
| k1(I_639) ),
inference(cnfTransformation,[status(thm)],[f_91]) ).
tff(c_869,plain,
k1(b),
inference(resolution,[status(thm)],[c_30,c_863]) ).
tff(c_892,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_845,c_869]) ).
tff(c_893,plain,
m2(b),
inference(splitRight,[status(thm)],[c_348]) ).
tff(c_510,plain,
! [C_396] :
( ~ m2(b)
| ~ n2(C_396)
| l3(C_396,C_396) ),
inference(cnfTransformation,[status(thm)],[f_1823]) ).
tff(c_1729,plain,
! [C_808] : l3(C_808,C_808),
inference(demodulation,[status(thm),theory(equality)],[c_1514,c_893,c_510]) ).
tff(c_738,plain,
! [X_627] : ~ l3(X_627,c),
inference(cnfTransformation,[status(thm)],[f_2765]) ).
tff(c_1734,plain,
$false,
inference(resolution,[status(thm)],[c_1729,c_738]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SYN221-1 : TPTP v8.1.2. Released v1.1.0.
% 0.07/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 : n023.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:36:37 EDT 2023
% 0.13/0.35 % CPUTime :
% 9.12/3.06 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.12/3.07
% 9.12/3.07 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 9.12/3.09
% 9.12/3.09 Inference rules
% 9.12/3.09 ----------------------
% 9.12/3.09 #Ref : 0
% 9.12/3.09 #Sup : 154
% 9.12/3.09 #Fact : 0
% 9.12/3.09 #Define : 0
% 9.12/3.09 #Split : 33
% 9.12/3.09 #Chain : 0
% 9.12/3.09 #Close : 0
% 9.12/3.09
% 9.12/3.09 Ordering : KBO
% 9.12/3.09
% 9.12/3.09 Simplification rules
% 9.12/3.09 ----------------------
% 9.12/3.09 #Subsume : 50
% 9.12/3.09 #Demod : 171
% 9.12/3.09 #Tautology : 110
% 9.12/3.09 #SimpNegUnit : 21
% 9.12/3.10 #BackRed : 28
% 9.12/3.10
% 9.12/3.10 #Partial instantiations: 0
% 9.12/3.10 #Strategies tried : 1
% 9.12/3.10
% 9.12/3.10 Timing (in seconds)
% 9.12/3.10 ----------------------
% 9.12/3.10 Preprocessing : 0.97
% 9.12/3.10 Parsing : 0.55
% 9.12/3.10 CNF conversion : 0.08
% 9.12/3.10 Main loop : 1.09
% 9.12/3.10 Inferencing : 0.29
% 9.12/3.10 Reduction : 0.39
% 9.12/3.10 Demodulation : 0.25
% 9.12/3.10 BG Simplification : 0.10
% 9.12/3.10 Subsumption : 0.23
% 9.12/3.10 Abstraction : 0.02
% 9.12/3.10 MUC search : 0.00
% 9.12/3.10 Cooper : 0.00
% 9.12/3.10 Total : 2.11
% 9.12/3.10 Index Insertion : 0.00
% 9.12/3.10 Index Deletion : 0.00
% 9.12/3.10 Index Matching : 0.00
% 9.12/3.10 BG Taut test : 0.00
%------------------------------------------------------------------------------