TSTP Solution File: SYN196-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN196-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 : n032.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:54 EDT 2023
% Result : Unsatisfiable 9.03s 3.12s
% Output : CNFRefutation 9.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 58
% Syntax : Number of formulae : 69 ( 11 unt; 53 typ; 0 def)
% Number of atoms : 23 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 17 ( 10 ~; 7 |; 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 : 13 (; 13 !; 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,
~ s1(a),
file(unknown,unknown) ).
tff(f_83,axiom,
q0(a,b),
file(unknown,unknown) ).
tff(f_1081,axiom,
! [F,G,H] :
( s1(F)
| ~ q0(F,G)
| ~ s1(H) ),
file(unknown,unknown) ).
tff(f_59,axiom,
! [X] : p0(b,X),
file(unknown,unknown) ).
tff(f_1073,axiom,
! [I] :
( s1(I)
| ~ p0(I,I) ),
file(unknown,unknown) ).
tff(c_738,plain,
~ s1(a),
inference(cnfTransformation,[status(thm)],[f_2764]) ).
tff(c_72,plain,
q0(a,b),
inference(cnfTransformation,[status(thm)],[f_83]) ).
tff(c_328,plain,
! [H_236,F_234,G_235] :
( ~ s1(H_236)
| ~ q0(F_234,G_235)
| s1(F_234) ),
inference(cnfTransformation,[status(thm)],[f_1081]) ).
tff(c_1352,plain,
! [H_236] : ~ s1(H_236),
inference(splitLeft,[status(thm)],[c_328]) ).
tff(c_28,plain,
! [X_2] : p0(b,X_2),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_892,plain,
! [I_645] :
( ~ p0(I_645,I_645)
| s1(I_645) ),
inference(cnfTransformation,[status(thm)],[f_1073]) ).
tff(c_897,plain,
s1(b),
inference(resolution,[status(thm)],[c_28,c_892]) ).
tff(c_1355,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_1352,c_897]) ).
tff(c_1357,plain,
! [F_728,G_729] :
( ~ q0(F_728,G_729)
| s1(F_728) ),
inference(splitRight,[status(thm)],[c_328]) ).
tff(c_1366,plain,
s1(a),
inference(resolution,[status(thm)],[c_72,c_1357]) ).
tff(c_1381,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_738,c_1366]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SYN196-1 : TPTP v8.1.2. Released v1.1.0.
% 0.00/0.10 % 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.09/0.29 % Computer : n032.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Thu Aug 3 17:31:51 EDT 2023
% 0.09/0.29 % CPUTime :
% 9.03/3.12 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.03/3.13
% 9.03/3.13 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 9.36/3.16
% 9.36/3.16 Inference rules
% 9.36/3.16 ----------------------
% 9.36/3.16 #Ref : 0
% 9.36/3.16 #Sup : 100
% 9.36/3.16 #Fact : 0
% 9.36/3.16 #Define : 0
% 9.36/3.16 #Split : 19
% 9.36/3.16 #Chain : 0
% 9.36/3.16 #Close : 0
% 9.36/3.16
% 9.36/3.16 Ordering : KBO
% 9.36/3.16
% 9.36/3.16 Simplification rules
% 9.36/3.16 ----------------------
% 9.36/3.16 #Subsume : 38
% 9.36/3.16 #Demod : 128
% 9.36/3.16 #Tautology : 77
% 9.36/3.16 #SimpNegUnit : 4
% 9.36/3.16 #BackRed : 8
% 9.36/3.16
% 9.36/3.16 #Partial instantiations: 0
% 9.36/3.16 #Strategies tried : 1
% 9.36/3.16
% 9.36/3.16 Timing (in seconds)
% 9.36/3.16 ----------------------
% 9.36/3.16 Preprocessing : 1.08
% 9.36/3.16 Parsing : 0.61
% 9.36/3.16 CNF conversion : 0.10
% 9.36/3.16 Main loop : 1.08
% 9.36/3.16 Inferencing : 0.26
% 9.36/3.16 Reduction : 0.39
% 9.36/3.16 Demodulation : 0.25
% 9.36/3.16 BG Simplification : 0.11
% 9.36/3.16 Subsumption : 0.24
% 9.36/3.16 Abstraction : 0.02
% 9.36/3.16 MUC search : 0.00
% 9.36/3.16 Cooper : 0.00
% 9.36/3.16 Total : 2.21
% 9.36/3.16 Index Insertion : 0.00
% 9.36/3.16 Index Deletion : 0.00
% 9.36/3.16 Index Matching : 0.00
% 9.36/3.16 BG Taut test : 0.00
%------------------------------------------------------------------------------