TSTP Solution File: SYN250-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN250-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 : n014.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 148.28s 131.14s
% Output : CNFRefutation 148.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 65
% Syntax : Number of formulae : 88 ( 16 unt; 53 typ; 0 def)
% Number of atoms : 73 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 79 ( 41 ~; 38 |; 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 : 45 (; 45 !; 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_57,axiom,
r0(e),
file(unknown,unknown) ).
tff(f_68,axiom,
q0(b,e),
file(unknown,unknown) ).
tff(f_84,axiom,
n0(b,a),
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_56,axiom,
! [X] : m0(a,X,a),
file(unknown,unknown) ).
tff(f_264,axiom,
! [F,G,H] :
( m1(F,a,G)
| ~ m0(a,H,a)
| ~ q0(F,G)
| ~ m1(G,c,G) ),
file(unknown,unknown) ).
tff(f_49,axiom,
q0(b,b),
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_200,axiom,
! [H,I,J,A] :
( m1(H,I,I)
| ~ m1(J,I,H)
| ~ m1(J,A,I) ),
file(unknown,unknown) ).
tff(f_2764,axiom,
~ m1(e,a,a),
file(unknown,unknown) ).
tff(c_26,plain,
r0(e),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_42,plain,
q0(b,e),
inference(cnfTransformation,[status(thm)],[f_68]) ).
tff(c_74,plain,
n0(b,a),
inference(cnfTransformation,[status(thm)],[f_84]) ).
tff(c_1297,plain,
! [J_727,I_728] :
( ~ n0(J_727,I_728)
| k1(I_728) ),
inference(cnfTransformation,[status(thm)],[f_91]) ).
tff(c_1325,plain,
k1(a),
inference(resolution,[status(thm)],[c_74,c_1297]) ).
tff(c_28,plain,
! [X_2] : p0(b,X_2),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_550994,plain,
! [G_57650,I_57651,H_57652] :
( ~ r0(G_57650)
| ~ p0(I_57651,H_57652)
| m1(G_57650,H_57652,G_57650) ),
inference(cnfTransformation,[status(thm)],[f_136]) ).
tff(c_551000,plain,
! [G_57650,X_2] :
( ~ r0(G_57650)
| m1(G_57650,X_2,G_57650) ),
inference(resolution,[status(thm)],[c_28,c_550994]) ).
tff(c_24,plain,
! [X_1] : m0(a,X_1,a),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_124,plain,
! [G_52,F_51,H_53] :
( ~ m1(G_52,c,G_52)
| ~ q0(F_51,G_52)
| ~ m0(a,H_53,a)
| m1(F_51,a,G_52) ),
inference(cnfTransformation,[status(thm)],[f_264]) ).
tff(c_577847,plain,
! [G_59638,F_59639] :
( ~ m1(G_59638,c,G_59638)
| ~ q0(F_59639,G_59638)
| m1(F_59639,a,G_59638) ),
inference(demodulation,[status(thm),theory(equality)],[c_24,c_124]) ).
tff(c_577864,plain,
! [F_59639,G_57650] :
( ~ q0(F_59639,G_57650)
| m1(F_59639,a,G_57650)
| ~ r0(G_57650) ),
inference(resolution,[status(thm)],[c_551000,c_577847]) ).
tff(c_12,plain,
q0(b,b),
inference(cnfTransformation,[status(thm)],[f_49]) ).
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_570562,plain,
! [A_59099,B_59100] :
( ~ q0(A_59099,A_59099)
| ~ k1(B_59100)
| m1(A_59099,B_59100,B_59100) ),
inference(demodulation,[status(thm),theory(equality)],[c_1325,c_144]) ).
tff(c_570569,plain,
! [B_59100] :
( ~ k1(B_59100)
| m1(b,B_59100,B_59100) ),
inference(resolution,[status(thm)],[c_12,c_570562]) ).
tff(c_585445,plain,
! [J_60124,A_60125,I_60126,H_60127] :
( ~ m1(J_60124,A_60125,I_60126)
| ~ m1(J_60124,I_60126,H_60127)
| m1(H_60127,I_60126,I_60126) ),
inference(cnfTransformation,[status(thm)],[f_200]) ).
tff(c_590869,plain,
! [B_60419,H_60420] :
( ~ m1(b,B_60419,H_60420)
| m1(H_60420,B_60419,B_60419)
| ~ k1(B_60419) ),
inference(resolution,[status(thm)],[c_570569,c_585445]) ).
tff(c_590886,plain,
! [G_57650] :
( m1(G_57650,a,a)
| ~ k1(a)
| ~ q0(b,G_57650)
| ~ r0(G_57650) ),
inference(resolution,[status(thm)],[c_577864,c_590869]) ).
tff(c_591077,plain,
! [G_60423] :
( m1(G_60423,a,a)
| ~ q0(b,G_60423)
| ~ r0(G_60423) ),
inference(demodulation,[status(thm),theory(equality)],[c_1325,c_590886]) ).
tff(c_738,plain,
~ m1(e,a,a),
inference(cnfTransformation,[status(thm)],[f_2764]) ).
tff(c_591105,plain,
( ~ q0(b,e)
| ~ r0(e) ),
inference(resolution,[status(thm)],[c_591077,c_738]) ).
tff(c_591128,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_26,c_42,c_591105]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN250-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.14/0.36 % Computer : n014.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 17:25:18 EDT 2023
% 0.14/0.37 % CPUTime :
% 148.28/131.14 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 148.28/131.15
% 148.28/131.15 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 148.38/131.18
% 148.38/131.18 Inference rules
% 148.38/131.18 ----------------------
% 148.38/131.18 #Ref : 0
% 148.38/131.18 #Sup : 107035
% 148.38/131.18 #Fact : 0
% 148.38/131.18 #Define : 0
% 148.38/131.18 #Split : 9356
% 148.38/131.18 #Chain : 0
% 148.38/131.18 #Close : 0
% 148.38/131.18
% 148.38/131.18 Ordering : KBO
% 148.38/131.18
% 148.38/131.18 Simplification rules
% 148.38/131.18 ----------------------
% 148.38/131.18 #Subsume : 34978
% 148.38/131.18 #Demod : 105483
% 148.38/131.18 #Tautology : 60524
% 148.38/131.18 #SimpNegUnit : 7161
% 148.38/131.18 #BackRed : 7456
% 148.38/131.18
% 148.38/131.18 #Partial instantiations: 0
% 148.38/131.18 #Strategies tried : 1
% 148.38/131.18
% 148.38/131.18 Timing (in seconds)
% 148.38/131.18 ----------------------
% 148.38/131.18 Preprocessing : 1.05
% 148.38/131.18 Parsing : 0.59
% 148.38/131.18 CNF conversion : 0.09
% 148.38/131.18 Main loop : 129.05
% 148.38/131.19 Inferencing : 36.74
% 148.38/131.19 Reduction : 54.81
% 148.38/131.19 Demodulation : 38.98
% 148.38/131.19 BG Simplification : 0.46
% 148.38/131.19 Subsumption : 28.58
% 148.38/131.19 Abstraction : 1.04
% 148.38/131.19 MUC search : 0.00
% 148.38/131.19 Cooper : 0.00
% 148.38/131.19 Total : 130.16
% 148.38/131.19 Index Insertion : 0.00
% 148.38/131.19 Index Deletion : 0.00
% 148.38/131.19 Index Matching : 0.00
% 148.38/131.19 BG Taut test : 0.00
%------------------------------------------------------------------------------