TSTP Solution File: SYN249-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN249-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:10:11 EDT 2023
% Result : Unsatisfiable 17.84s 7.19s
% Output : CNFRefutation 17.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 59
% Syntax : Number of formulae : 71 ( 12 unt; 53 typ; 0 def)
% Number of atoms : 29 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 25 ( 14 ~; 11 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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 : 13 (; 13 !; 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_77,axiom,
n0(e,e),
file(unknown,unknown) ).
tff(f_91,axiom,
! [I,J] :
( k1(I)
| ~ n0(J,I) ),
file(unknown,unknown) ).
tff(f_63,axiom,
! [X] : q0(X,d),
file(unknown,unknown) ).
tff(f_84,axiom,
n0(b,a),
file(unknown,unknown) ).
tff(f_348,axiom,
! [A,B] :
( m1(A,B,B)
| ~ k1(a)
| ~ k1(B)
| ~ q0(A,A) ),
file(unknown,unknown) ).
tff(f_2764,axiom,
~ m1(d,e,e),
file(unknown,unknown) ).
tff(c_60,plain,
n0(e,e),
inference(cnfTransformation,[status(thm)],[f_77]) ).
tff(c_15834,plain,
! [J_2765,I_2766] :
( ~ n0(J_2765,I_2766)
| k1(I_2766) ),
inference(cnfTransformation,[status(thm)],[f_91]) ).
tff(c_15868,plain,
k1(e),
inference(resolution,[status(thm)],[c_60,c_15834]) ).
tff(c_34,plain,
! [X_3] : q0(X_3,d),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_74,plain,
n0(b,a),
inference(cnfTransformation,[status(thm)],[f_84]) ).
tff(c_15861,plain,
k1(a),
inference(resolution,[status(thm)],[c_74,c_15834]) ).
tff(c_144,plain,
! [A_67,B_68] :
( ~ q0(A_67,A_67)
| ~ k1(B_68)
| ~ k1(a)
| m1(A_67,B_68,B_68) ),
inference(cnfTransformation,[status(thm)],[f_348]) ).
tff(c_24923,plain,
! [A_3989,B_3990] :
( ~ q0(A_3989,A_3989)
| ~ k1(B_3990)
| m1(A_3989,B_3990,B_3990) ),
inference(demodulation,[status(thm),theory(equality)],[c_15861,c_144]) ).
tff(c_24942,plain,
! [B_3991] :
( ~ k1(B_3991)
| m1(d,B_3991,B_3991) ),
inference(resolution,[status(thm)],[c_34,c_24923]) ).
tff(c_738,plain,
~ m1(d,e,e),
inference(cnfTransformation,[status(thm)],[f_2764]) ).
tff(c_24952,plain,
~ k1(e),
inference(resolution,[status(thm)],[c_24942,c_738]) ).
tff(c_24961,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_15868,c_24952]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN249-1 : TPTP v8.1.2. Released v1.1.0.
% 0.00/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 : n008.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:08:33 EDT 2023
% 0.13/0.35 % CPUTime :
% 17.84/7.19 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 17.84/7.19
% 17.84/7.19 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 17.84/7.22
% 17.84/7.22 Inference rules
% 17.84/7.22 ----------------------
% 17.84/7.22 #Ref : 0
% 17.84/7.22 #Sup : 4171
% 17.84/7.22 #Fact : 0
% 17.84/7.22 #Define : 0
% 17.84/7.22 #Split : 440
% 17.84/7.22 #Chain : 0
% 17.84/7.22 #Close : 0
% 17.84/7.22
% 17.84/7.22 Ordering : KBO
% 17.84/7.22
% 17.84/7.22 Simplification rules
% 17.84/7.22 ----------------------
% 17.84/7.22 #Subsume : 655
% 17.84/7.22 #Demod : 5310
% 17.84/7.22 #Tautology : 4441
% 17.84/7.22 #SimpNegUnit : 259
% 17.84/7.22 #BackRed : 348
% 17.84/7.22
% 17.84/7.22 #Partial instantiations: 0
% 17.84/7.22 #Strategies tried : 1
% 17.84/7.22
% 17.84/7.22 Timing (in seconds)
% 17.84/7.22 ----------------------
% 17.84/7.22 Preprocessing : 1.01
% 17.84/7.22 Parsing : 0.57
% 17.84/7.22 CNF conversion : 0.08
% 17.84/7.22 Main loop : 5.09
% 17.84/7.22 Inferencing : 1.66
% 17.84/7.22 Reduction : 1.83
% 17.84/7.22 Demodulation : 1.20
% 17.84/7.22 BG Simplification : 0.12
% 17.84/7.22 Subsumption : 0.96
% 17.84/7.22 Abstraction : 0.07
% 17.84/7.22 MUC search : 0.00
% 17.84/7.22 Cooper : 0.00
% 17.84/7.22 Total : 6.14
% 17.84/7.22 Index Insertion : 0.00
% 17.84/7.22 Index Deletion : 0.00
% 17.84/7.22 Index Matching : 0.00
% 17.84/7.22 BG Taut test : 0.00
%------------------------------------------------------------------------------