TSTP Solution File: SYN272-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN272-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 : n001.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:16 EDT 2023
% Result : Unsatisfiable 17.60s 7.03s
% Output : CNFRefutation 17.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 63
% Syntax : Number of formulae : 83 ( 14 unt; 53 typ; 0 def)
% Number of atoms : 53 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 50 ( 27 ~; 23 |; 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 : 44 (; 44 !; 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_81,axiom,
n0(c,d),
file(unknown,unknown) ).
tff(f_91,axiom,
! [I,J] :
( k1(I)
| ~ n0(J,I) ),
file(unknown,unknown) ).
tff(f_66,axiom,
! [X,Y] : m0(X,d,Y),
file(unknown,unknown) ).
tff(f_123,axiom,
! [B,C] :
( m1(B,C,B)
| ~ m0(C,C,B) ),
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_1638,axiom,
! [F,G] :
( k3(F,F,G)
| ~ k2(G,F) ),
file(unknown,unknown) ).
tff(f_2412,axiom,
! [B,C] :
( p4(B,C,B)
| ~ k3(B,B,C) ),
file(unknown,unknown) ).
tff(f_2765,axiom,
! [X] : ~ p4(d,e,X),
file(unknown,unknown) ).
tff(c_68,plain,
n0(c,d),
inference(cnfTransformation,[status(thm)],[f_81]) ).
tff(c_1299,plain,
! [J_730,I_731] :
( ~ n0(J_730,I_731)
| k1(I_731) ),
inference(cnfTransformation,[status(thm)],[f_91]) ).
tff(c_1326,plain,
k1(d),
inference(resolution,[status(thm)],[c_68,c_1299]) ).
tff(c_38,plain,
! [X_4,Y_5] : m0(X_4,d,Y_5),
inference(cnfTransformation,[status(thm)],[f_66]) ).
tff(c_16755,plain,
! [C_2923,B_2924] :
( ~ m0(C_2923,C_2923,B_2924)
| m1(B_2924,C_2923,B_2924) ),
inference(cnfTransformation,[status(thm)],[f_123]) ).
tff(c_16764,plain,
! [Y_5] : m1(Y_5,d,Y_5),
inference(resolution,[status(thm)],[c_38,c_16755]) ).
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_15906,plain,
! [A_2812,J_2813] :
( ~ q1(A_2812,J_2813,J_2813)
| k2(J_2813,J_2813) ),
inference(cnfTransformation,[status(thm)],[f_1108]) ).
tff(c_15942,plain,
! [A_205] : k2(A_205,A_205),
inference(resolution,[status(thm)],[c_774,c_15906]) ).
tff(c_23102,plain,
! [F_3724,D_3725,E_3726,C_3727] :
( ~ k2(F_3724,D_3725)
| ~ k1(F_3724)
| ~ m1(E_3726,D_3725,C_3727)
| k2(C_3727,D_3725) ),
inference(cnfTransformation,[status(thm)],[f_1092]) ).
tff(c_23106,plain,
! [A_3728,E_3729,C_3730] :
( ~ k1(A_3728)
| ~ m1(E_3729,A_3728,C_3730)
| k2(C_3730,A_3728) ),
inference(resolution,[status(thm)],[c_15942,c_23102]) ).
tff(c_23148,plain,
! [Y_5] :
( ~ k1(d)
| k2(Y_5,d) ),
inference(resolution,[status(thm)],[c_16764,c_23106]) ).
tff(c_23179,plain,
! [Y_5] : k2(Y_5,d),
inference(demodulation,[status(thm),theory(equality)],[c_1326,c_23148]) ).
tff(c_464,plain,
! [G_353,F_352] :
( ~ k2(G_353,F_352)
| k3(F_352,F_352,G_353) ),
inference(cnfTransformation,[status(thm)],[f_1638]) ).
tff(c_19970,plain,
! [B_3337,C_3338] :
( ~ k3(B_3337,B_3337,C_3338)
| p4(B_3337,C_3338,B_3337) ),
inference(cnfTransformation,[status(thm)],[f_2412]) ).
tff(c_738,plain,
! [X_627] : ~ p4(d,e,X_627),
inference(cnfTransformation,[status(thm)],[f_2765]) ).
tff(c_19979,plain,
~ k3(d,d,e),
inference(resolution,[status(thm)],[c_19970,c_738]) ).
tff(c_20197,plain,
~ k2(e,d),
inference(resolution,[status(thm)],[c_464,c_19979]) ).
tff(c_23194,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_23179,c_20197]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN272-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.14/0.35 % Computer : n001.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 17:55:40 EDT 2023
% 0.14/0.35 % CPUTime :
% 17.60/7.03 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 17.60/7.04
% 17.60/7.04 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 17.60/7.07
% 17.60/7.07 Inference rules
% 17.60/7.07 ----------------------
% 17.60/7.07 #Ref : 0
% 17.60/7.07 #Sup : 3863
% 17.60/7.07 #Fact : 0
% 17.60/7.07 #Define : 0
% 17.60/7.07 #Split : 409
% 17.60/7.07 #Chain : 0
% 17.60/7.07 #Close : 0
% 17.60/7.07
% 17.60/7.07 Ordering : KBO
% 17.60/7.07
% 17.60/7.07 Simplification rules
% 17.60/7.07 ----------------------
% 17.60/7.07 #Subsume : 654
% 17.60/7.07 #Demod : 4730
% 17.60/7.07 #Tautology : 3700
% 17.60/7.07 #SimpNegUnit : 237
% 17.60/7.07 #BackRed : 336
% 17.60/7.07
% 17.60/7.07 #Partial instantiations: 0
% 17.60/7.07 #Strategies tried : 1
% 17.60/7.07
% 17.60/7.07 Timing (in seconds)
% 17.60/7.07 ----------------------
% 17.60/7.07 Preprocessing : 1.03
% 17.60/7.07 Parsing : 0.59
% 17.60/7.07 CNF conversion : 0.09
% 17.60/7.07 Main loop : 4.97
% 17.60/7.07 Inferencing : 1.67
% 17.60/7.07 Reduction : 1.79
% 17.60/7.07 Demodulation : 1.18
% 17.60/7.07 BG Simplification : 0.12
% 17.60/7.07 Subsumption : 0.92
% 17.60/7.07 Abstraction : 0.06
% 17.60/7.07 MUC search : 0.00
% 17.60/7.07 Cooper : 0.00
% 17.60/7.07 Total : 6.05
% 17.60/7.07 Index Insertion : 0.00
% 17.60/7.07 Index Deletion : 0.00
% 17.60/7.07 Index Matching : 0.00
% 17.60/7.08 BG Taut test : 0.00
%------------------------------------------------------------------------------