TSTP Solution File: SYN177-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN177-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 : n025.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:50 EDT 2023
% Result : Unsatisfiable 14.43s 5.12s
% Output : CNFRefutation 14.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 60
% Syntax : Number of formulae : 73 ( 11 unt; 53 typ; 0 def)
% Number of atoms : 34 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 30 ( 16 ~; 14 |; 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_2765,axiom,
! [X] : ~ q3(X,b),
file(unknown,unknown) ).
tff(f_79,axiom,
k0(b),
file(unknown,unknown) ).
tff(f_60,axiom,
n0(a,b),
file(unknown,unknown) ).
tff(f_59,axiom,
! [X] : p0(b,X),
file(unknown,unknown) ).
tff(f_761,axiom,
! [B,C] :
( p1(B,B,B)
| ~ p0(C,B) ),
file(unknown,unknown) ).
tff(f_1493,axiom,
! [E,F] :
( q2(E,F,F)
| ~ k0(F)
| ~ p1(E,E,E) ),
file(unknown,unknown) ).
tff(f_2129,axiom,
! [G,H,I] :
( q3(G,H)
| ~ q2(I,G,H)
| ~ n0(I,G) ),
file(unknown,unknown) ).
tff(c_738,plain,
! [X_627] : ~ q3(X_627,b),
inference(cnfTransformation,[status(thm)],[f_2765]) ).
tff(c_64,plain,
k0(b),
inference(cnfTransformation,[status(thm)],[f_79]) ).
tff(c_30,plain,
n0(a,b),
inference(cnfTransformation,[status(thm)],[f_60]) ).
tff(c_28,plain,
! [X_2] : p0(b,X_2),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_11337,plain,
! [C_2174,B_2175] :
( ~ p0(C_2174,B_2175)
| p1(B_2175,B_2175,B_2175) ),
inference(cnfTransformation,[status(thm)],[f_761]) ).
tff(c_11342,plain,
! [X_2] : p1(X_2,X_2,X_2),
inference(resolution,[status(thm)],[c_28,c_11337]) ).
tff(c_430,plain,
! [E_320,F_321] :
( ~ p1(E_320,E_320,E_320)
| ~ k0(F_321)
| q2(E_320,F_321,F_321) ),
inference(cnfTransformation,[status(thm)],[f_1493]) ).
tff(c_13462,plain,
! [F_321,E_320] :
( ~ k0(F_321)
| q2(E_320,F_321,F_321) ),
inference(demodulation,[status(thm),theory(equality)],[c_11342,c_430]) ).
tff(c_13670,plain,
! [I_2500,G_2501,H_2502] :
( ~ n0(I_2500,G_2501)
| ~ q2(I_2500,G_2501,H_2502)
| q3(G_2501,H_2502) ),
inference(cnfTransformation,[status(thm)],[f_2129]) ).
tff(c_13693,plain,
! [E_2504,F_2505] :
( ~ n0(E_2504,F_2505)
| q3(F_2505,F_2505)
| ~ k0(F_2505) ),
inference(resolution,[status(thm)],[c_13462,c_13670]) ).
tff(c_13695,plain,
( q3(b,b)
| ~ k0(b) ),
inference(resolution,[status(thm)],[c_30,c_13693]) ).
tff(c_13712,plain,
q3(b,b),
inference(demodulation,[status(thm),theory(equality)],[c_64,c_13695]) ).
tff(c_13714,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_738,c_13712]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN177-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.15/0.35 % Computer : n025.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Thu Aug 3 17:37:49 EDT 2023
% 0.15/0.35 % CPUTime :
% 14.43/5.12 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 14.43/5.12
% 14.43/5.12 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 14.43/5.15
% 14.43/5.15 Inference rules
% 14.43/5.15 ----------------------
% 14.43/5.15 #Ref : 0
% 14.43/5.15 #Sup : 2211
% 14.43/5.15 #Fact : 0
% 14.43/5.15 #Define : 0
% 14.43/5.15 #Split : 222
% 14.43/5.15 #Chain : 0
% 14.43/5.15 #Close : 0
% 14.43/5.15
% 14.43/5.15 Ordering : KBO
% 14.43/5.15
% 14.43/5.15 Simplification rules
% 14.43/5.15 ----------------------
% 14.43/5.15 #Subsume : 242
% 14.43/5.15 #Demod : 2985
% 14.43/5.15 #Tautology : 2594
% 14.43/5.15 #SimpNegUnit : 94
% 14.43/5.15 #BackRed : 123
% 14.43/5.15
% 14.43/5.15 #Partial instantiations: 0
% 14.43/5.15 #Strategies tried : 1
% 14.43/5.15
% 14.43/5.15 Timing (in seconds)
% 14.43/5.15 ----------------------
% 14.43/5.15 Preprocessing : 1.02
% 14.43/5.15 Parsing : 0.58
% 14.90/5.15 CNF conversion : 0.09
% 14.90/5.15 Main loop : 3.07
% 14.90/5.15 Inferencing : 0.96
% 14.90/5.15 Reduction : 1.10
% 14.90/5.15 Demodulation : 0.72
% 14.90/5.15 BG Simplification : 0.11
% 14.90/5.15 Subsumption : 0.60
% 14.90/5.15 Abstraction : 0.05
% 14.90/5.15 MUC search : 0.00
% 14.90/5.15 Cooper : 0.00
% 14.90/5.15 Total : 4.14
% 14.90/5.15 Index Insertion : 0.00
% 14.90/5.15 Index Deletion : 0.00
% 14.90/5.15 Index Matching : 0.00
% 14.90/5.15 BG Taut test : 0.00
%------------------------------------------------------------------------------