TSTP Solution File: SYN294-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN294-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 : n002.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:20 EDT 2023
% Result : Unsatisfiable 18.25s 7.45s
% Output : CNFRefutation 18.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 61
% Syntax : Number of formulae : 79 ( 16 unt; 53 typ; 0 def)
% Number of atoms : 43 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 38 ( 21 ~; 17 |; 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 : 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_73,axiom,
n0(d,c),
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_992,axiom,
! [H,I,J] :
( q1(H,H,I)
| ~ r0(J)
| ~ m1(H,I,I) ),
file(unknown,unknown) ).
tff(f_52,axiom,
r0(b),
file(unknown,unknown) ).
tff(f_2764,axiom,
~ q1(d,d,c),
file(unknown,unknown) ).
tff(c_52,plain,
n0(d,c),
inference(cnfTransformation,[status(thm)],[f_73]) ).
tff(c_1162,plain,
! [J_715,I_716] :
( ~ n0(J_715,I_716)
| k1(I_716) ),
inference(cnfTransformation,[status(thm)],[f_91]) ).
tff(c_1194,plain,
k1(c),
inference(resolution,[status(thm)],[c_52,c_1162]) ).
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_1190,plain,
k1(a),
inference(resolution,[status(thm)],[c_74,c_1162]) ).
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_24966,plain,
! [A_4032,B_4033] :
( ~ q0(A_4032,A_4032)
| ~ k1(B_4033)
| m1(A_4032,B_4033,B_4033) ),
inference(demodulation,[status(thm),theory(equality)],[c_1190,c_144]) ).
tff(c_24974,plain,
! [B_4034] :
( ~ k1(B_4034)
| m1(d,B_4034,B_4034) ),
inference(resolution,[status(thm)],[c_34,c_24966]) ).
tff(c_302,plain,
! [H_216,I_217,J_218] :
( ~ m1(H_216,I_217,I_217)
| ~ r0(J_218)
| q1(H_216,H_216,I_217) ),
inference(cnfTransformation,[status(thm)],[f_992]) ).
tff(c_24073,plain,
! [J_218] : ~ r0(J_218),
inference(splitLeft,[status(thm)],[c_302]) ).
tff(c_18,plain,
r0(b),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_24076,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_24073,c_18]) ).
tff(c_24077,plain,
! [H_216,I_217] :
( ~ m1(H_216,I_217,I_217)
| q1(H_216,H_216,I_217) ),
inference(splitRight,[status(thm)],[c_302]) ).
tff(c_25002,plain,
! [B_4036] :
( q1(d,d,B_4036)
| ~ k1(B_4036) ),
inference(resolution,[status(thm)],[c_24974,c_24077]) ).
tff(c_738,plain,
~ q1(d,d,c),
inference(cnfTransformation,[status(thm)],[f_2764]) ).
tff(c_25005,plain,
~ k1(c),
inference(resolution,[status(thm)],[c_25002,c_738]) ).
tff(c_25009,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_1194,c_25005]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SYN294-1 : TPTP v8.1.2. Released v1.1.0.
% 0.00/0.15 % 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 : n002.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:46:46 EDT 2023
% 0.14/0.36 % CPUTime :
% 18.25/7.45 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 18.25/7.46
% 18.25/7.46 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 18.34/7.49
% 18.34/7.49 Inference rules
% 18.34/7.49 ----------------------
% 18.34/7.49 #Ref : 0
% 18.34/7.49 #Sup : 4176
% 18.34/7.49 #Fact : 0
% 18.34/7.49 #Define : 0
% 18.34/7.49 #Split : 447
% 18.34/7.49 #Chain : 0
% 18.34/7.49 #Close : 0
% 18.34/7.49
% 18.34/7.49 Ordering : KBO
% 18.34/7.49
% 18.34/7.49 Simplification rules
% 18.34/7.49 ----------------------
% 18.34/7.49 #Subsume : 998
% 18.34/7.49 #Demod : 4883
% 18.34/7.49 #Tautology : 3665
% 18.34/7.49 #SimpNegUnit : 267
% 18.34/7.49 #BackRed : 361
% 18.34/7.49
% 18.34/7.49 #Partial instantiations: 0
% 18.34/7.49 #Strategies tried : 1
% 18.34/7.49
% 18.34/7.49 Timing (in seconds)
% 18.34/7.49 ----------------------
% 18.34/7.49 Preprocessing : 1.00
% 18.34/7.49 Parsing : 0.56
% 18.34/7.49 CNF conversion : 0.09
% 18.34/7.49 Main loop : 5.42
% 18.34/7.49 Inferencing : 1.73
% 18.34/7.49 Reduction : 1.97
% 18.34/7.49 Demodulation : 1.29
% 18.34/7.49 BG Simplification : 0.12
% 18.34/7.49 Subsumption : 1.07
% 18.34/7.49 Abstraction : 0.07
% 18.34/7.49 MUC search : 0.00
% 18.34/7.49 Cooper : 0.00
% 18.34/7.49 Total : 6.47
% 18.34/7.49 Index Insertion : 0.00
% 18.34/7.49 Index Deletion : 0.00
% 18.34/7.49 Index Matching : 0.00
% 18.34/7.49 BG Taut test : 0.00
%------------------------------------------------------------------------------