TSTP Solution File: SYN240-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN240-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 : 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:06 EDT 2023
% Result : Unsatisfiable 6.61s 2.55s
% Output : CNFRefutation 7.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 56
% Syntax : Number of formulae : 61 ( 6 unt; 53 typ; 0 def)
% Number of atoms : 10 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 7 ( 5 ~; 2 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 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 : 2 (; 2 !; 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] : ~ m1(X,e,e),
file(unknown,unknown) ).
tff(f_310,axiom,
( m1(e,e,e)
| ~ r0(e) ),
file(unknown,unknown) ).
tff(f_57,axiom,
r0(e),
file(unknown,unknown) ).
tff(c_738,plain,
! [X_627] : ~ m1(X_627,e,e),
inference(cnfTransformation,[status(thm)],[f_2765]) ).
tff(c_136,plain,
( ~ r0(e)
| m1(e,e,e) ),
inference(cnfTransformation,[status(thm)],[f_310]) ).
tff(c_739,plain,
~ r0(e),
inference(negUnitSimplification,[status(thm)],[c_738,c_136]) ).
tff(c_26,plain,
r0(e),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_784,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_739,c_26]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN240-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/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.15/0.36 % Computer : n001.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 18:03:10 EDT 2023
% 0.15/0.36 % CPUTime :
% 6.61/2.55 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.61/2.56
% 6.61/2.56 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 7.10/2.60
% 7.10/2.60 Inference rules
% 7.10/2.60 ----------------------
% 7.10/2.60 #Ref : 0
% 7.10/2.60 #Sup : 0
% 7.10/2.60 #Fact : 0
% 7.10/2.60 #Define : 0
% 7.10/2.60 #Split : 0
% 7.10/2.60 #Chain : 0
% 7.10/2.60 #Close : 0
% 7.10/2.60
% 7.10/2.60 Ordering : KBO
% 7.10/2.60
% 7.10/2.60 Simplification rules
% 7.10/2.60 ----------------------
% 7.10/2.60 #Subsume : 359
% 7.10/2.60 #Demod : 23
% 7.10/2.60 #Tautology : 9
% 7.10/2.60 #SimpNegUnit : 4
% 7.10/2.60 #BackRed : 0
% 7.10/2.60
% 7.10/2.60 #Partial instantiations: 0
% 7.10/2.60 #Strategies tried : 1
% 7.10/2.60
% 7.10/2.60 Timing (in seconds)
% 7.10/2.60 ----------------------
% 7.10/2.61 Preprocessing : 1.03
% 7.10/2.61 Parsing : 0.59
% 7.10/2.61 CNF conversion : 0.09
% 7.10/2.61 Main loop : 0.49
% 7.10/2.61 Inferencing : 0.00
% 7.10/2.61 Reduction : 0.24
% 7.10/2.61 Demodulation : 0.16
% 7.10/2.61 BG Simplification : 0.10
% 7.10/2.61 Subsumption : 0.17
% 7.10/2.61 Abstraction : 0.02
% 7.10/2.61 MUC search : 0.00
% 7.10/2.61 Cooper : 0.00
% 7.10/2.61 Total : 1.59
% 7.10/2.61 Index Insertion : 0.00
% 7.10/2.61 Index Deletion : 0.00
% 7.10/2.61 Index Matching : 0.00
% 7.10/2.61 BG Taut test : 0.00
%------------------------------------------------------------------------------