TSTP Solution File: SYN110-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN110-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 : n021.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 22.75s 10.42s
% Output : CNFRefutation 22.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 64
% Syntax : Number of formulae : 86 ( 16 unt; 53 typ; 0 def)
% Number of atoms : 63 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 63 ( 33 ~; 30 |; 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 : 48 (; 48 !; 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_2764,axiom,
~ k2(c,a),
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_66,axiom,
! [X,Y] : m0(X,d,Y),
file(unknown,unknown) ).
tff(f_269,axiom,
! [C,D,E] :
( m1(C,C,C)
| ~ m0(D,E,C) ),
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_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_80,axiom,
q0(d,c),
file(unknown,unknown) ).
tff(c_738,plain,
~ k2(c,a),
inference(cnfTransformation,[status(thm)],[f_2764]) ).
tff(c_74,plain,
n0(b,a),
inference(cnfTransformation,[status(thm)],[f_84]) ).
tff(c_1320,plain,
! [J_742,I_743] :
( ~ n0(J_742,I_743)
| k1(I_743) ),
inference(cnfTransformation,[status(thm)],[f_91]) ).
tff(c_1348,plain,
k1(a),
inference(resolution,[status(thm)],[c_74,c_1320]) ).
tff(c_38,plain,
! [X_4,Y_5] : m0(X_4,d,Y_5),
inference(cnfTransformation,[status(thm)],[f_66]) ).
tff(c_34030,plain,
! [D_5352,E_5353,C_5354] :
( ~ m0(D_5352,E_5353,C_5354)
| m1(C_5354,C_5354,C_5354) ),
inference(cnfTransformation,[status(thm)],[f_269]) ).
tff(c_34047,plain,
! [Y_5] : m1(Y_5,Y_5,Y_5),
inference(resolution,[status(thm)],[c_38,c_34030]) ).
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_42699,plain,
! [G_6427,F_6428] :
( ~ m1(G_6427,c,G_6427)
| ~ q0(F_6428,G_6427)
| m1(F_6428,a,G_6427) ),
inference(demodulation,[status(thm),theory(equality)],[c_24,c_124]) ).
tff(c_42719,plain,
! [F_6428] :
( ~ q0(F_6428,c)
| m1(F_6428,a,c) ),
inference(resolution,[status(thm)],[c_34047,c_42699]) ).
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_31708,plain,
! [A_5003,J_5004] :
( ~ q1(A_5003,J_5004,J_5004)
| k2(J_5004,J_5004) ),
inference(cnfTransformation,[status(thm)],[f_1108]) ).
tff(c_31748,plain,
! [A_205] : k2(A_205,A_205),
inference(resolution,[status(thm)],[c_774,c_31708]) ).
tff(c_43493,plain,
! [F_6490,D_6491,E_6492,C_6493] :
( ~ k2(F_6490,D_6491)
| ~ k1(F_6490)
| ~ m1(E_6492,D_6491,C_6493)
| k2(C_6493,D_6491) ),
inference(cnfTransformation,[status(thm)],[f_1092]) ).
tff(c_43498,plain,
! [A_6495,E_6496,C_6497] :
( ~ k1(A_6495)
| ~ m1(E_6496,A_6495,C_6497)
| k2(C_6497,A_6495) ),
inference(resolution,[status(thm)],[c_31748,c_43493]) ).
tff(c_43504,plain,
! [F_6428] :
( ~ k1(a)
| k2(c,a)
| ~ q0(F_6428,c) ),
inference(resolution,[status(thm)],[c_42719,c_43498]) ).
tff(c_43546,plain,
! [F_6428] :
( k2(c,a)
| ~ q0(F_6428,c) ),
inference(demodulation,[status(thm),theory(equality)],[c_1348,c_43504]) ).
tff(c_43547,plain,
! [F_6428] : ~ q0(F_6428,c),
inference(negUnitSimplification,[status(thm)],[c_738,c_43546]) ).
tff(c_66,plain,
q0(d,c),
inference(cnfTransformation,[status(thm)],[f_80]) ).
tff(c_43573,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_43547,c_66]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN110-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.14/0.34 % Computer : n021.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu Aug 3 17:08:51 EDT 2023
% 0.14/0.35 % CPUTime :
% 22.75/10.42 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 22.75/10.43
% 22.75/10.43 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 22.95/10.46
% 22.95/10.46 Inference rules
% 22.95/10.46 ----------------------
% 22.95/10.46 #Ref : 0
% 22.95/10.46 #Sup : 7376
% 22.95/10.46 #Fact : 0
% 22.95/10.46 #Define : 0
% 22.95/10.46 #Split : 822
% 22.95/10.46 #Chain : 0
% 22.95/10.46 #Close : 0
% 22.95/10.46
% 22.95/10.46 Ordering : KBO
% 22.95/10.46
% 22.95/10.46 Simplification rules
% 22.95/10.46 ----------------------
% 22.95/10.46 #Subsume : 1479
% 22.95/10.46 #Demod : 8787
% 22.95/10.46 #Tautology : 6622
% 22.95/10.46 #SimpNegUnit : 456
% 22.95/10.46 #BackRed : 534
% 22.95/10.46
% 22.95/10.46 #Partial instantiations: 0
% 22.95/10.46 #Strategies tried : 1
% 22.95/10.46
% 22.95/10.46 Timing (in seconds)
% 22.95/10.46 ----------------------
% 22.97/10.46 Preprocessing : 1.02
% 22.97/10.46 Parsing : 0.57
% 22.97/10.46 CNF conversion : 0.09
% 22.97/10.46 Main loop : 8.40
% 22.97/10.46 Inferencing : 2.78
% 22.97/10.46 Reduction : 3.06
% 22.97/10.46 Demodulation : 2.04
% 22.97/10.46 BG Simplification : 0.13
% 22.97/10.46 Subsumption : 1.65
% 22.97/10.46 Abstraction : 0.10
% 22.97/10.46 MUC search : 0.00
% 22.97/10.46 Cooper : 0.00
% 22.97/10.46 Total : 9.47
% 22.97/10.46 Index Insertion : 0.00
% 22.97/10.46 Index Deletion : 0.00
% 22.97/10.46 Index Matching : 0.00
% 22.97/10.46 BG Taut test : 0.00
%------------------------------------------------------------------------------