TSTP Solution File: SYN227-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN227-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 : n020.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:02 EDT 2023
% Result : Unsatisfiable 12.63s 4.64s
% Output : CNFRefutation 12.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 60
% Syntax : Number of formulae : 71 ( 9 unt; 53 typ; 0 def)
% Number of atoms : 35 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 37 ( 20 ~; 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 : 16 (; 16 !; 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_71,axiom,
l0(c),
file(unknown,unknown) ).
tff(f_79,axiom,
k0(b),
file(unknown,unknown) ).
tff(f_52,axiom,
r0(b),
file(unknown,unknown) ).
tff(f_242,axiom,
! [I,J] :
( m1(I,J,I)
| ~ l0(I)
| ~ k0(J) ),
file(unknown,unknown) ).
tff(f_1485,axiom,
! [D,E] :
( p2(D,E,D)
| ~ m1(E,D,E) ),
file(unknown,unknown) ).
tff(f_1807,axiom,
! [G,H] :
( l3(G,H)
| ~ r0(G)
| ~ p2(G,H,G) ),
file(unknown,unknown) ).
tff(f_2764,axiom,
~ l3(b,c),
file(unknown,unknown) ).
tff(c_48,plain,
l0(c),
inference(cnfTransformation,[status(thm)],[f_71]) ).
tff(c_64,plain,
k0(b),
inference(cnfTransformation,[status(thm)],[f_79]) ).
tff(c_18,plain,
r0(b),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_9473,plain,
! [J_1965,I_1966] :
( ~ k0(J_1965)
| ~ l0(I_1966)
| m1(I_1966,J_1965,I_1966) ),
inference(cnfTransformation,[status(thm)],[f_242]) ).
tff(c_428,plain,
! [E_319,D_318] :
( ~ m1(E_319,D_318,E_319)
| p2(D_318,E_319,D_318) ),
inference(cnfTransformation,[status(thm)],[f_1485]) ).
tff(c_9476,plain,
! [J_1965,I_1966] :
( p2(J_1965,I_1966,J_1965)
| ~ k0(J_1965)
| ~ l0(I_1966) ),
inference(resolution,[status(thm)],[c_9473,c_428]) ).
tff(c_9787,plain,
! [G_2034,H_2035] :
( ~ p2(G_2034,H_2035,G_2034)
| ~ r0(G_2034)
| l3(G_2034,H_2035) ),
inference(cnfTransformation,[status(thm)],[f_1807]) ).
tff(c_10214,plain,
! [J_2091,I_2092] :
( ~ r0(J_2091)
| l3(J_2091,I_2092)
| ~ k0(J_2091)
| ~ l0(I_2092) ),
inference(resolution,[status(thm)],[c_9476,c_9787]) ).
tff(c_738,plain,
~ l3(b,c),
inference(cnfTransformation,[status(thm)],[f_2764]) ).
tff(c_10217,plain,
( ~ r0(b)
| ~ k0(b)
| ~ l0(c) ),
inference(resolution,[status(thm)],[c_10214,c_738]) ).
tff(c_10221,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_48,c_64,c_18,c_10217]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SYN227-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/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 : n020.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 17:17:07 EDT 2023
% 0.15/0.37 % CPUTime :
% 12.63/4.64 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 12.63/4.64
% 12.63/4.64 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 12.89/4.67
% 12.89/4.67 Inference rules
% 12.89/4.67 ----------------------
% 12.89/4.67 #Ref : 0
% 12.89/4.67 #Sup : 1586
% 12.89/4.67 #Fact : 0
% 12.89/4.67 #Define : 0
% 12.89/4.67 #Split : 195
% 12.89/4.67 #Chain : 0
% 12.89/4.67 #Close : 0
% 12.89/4.67
% 12.89/4.67 Ordering : KBO
% 12.89/4.67
% 12.89/4.67 Simplification rules
% 12.89/4.67 ----------------------
% 12.89/4.67 #Subsume : 183
% 12.89/4.67 #Demod : 2100
% 12.89/4.67 #Tautology : 1758
% 12.89/4.67 #SimpNegUnit : 84
% 12.89/4.67 #BackRed : 131
% 12.89/4.67
% 12.89/4.67 #Partial instantiations: 0
% 12.89/4.67 #Strategies tried : 1
% 12.89/4.67
% 12.89/4.67 Timing (in seconds)
% 12.89/4.67 ----------------------
% 12.89/4.67 Preprocessing : 0.99
% 12.89/4.67 Parsing : 0.55
% 12.89/4.67 CNF conversion : 0.08
% 12.89/4.67 Main loop : 2.62
% 12.89/4.67 Inferencing : 0.80
% 12.89/4.67 Reduction : 0.95
% 12.89/4.67 Demodulation : 0.60
% 12.89/4.67 BG Simplification : 0.11
% 12.89/4.67 Subsumption : 0.50
% 12.89/4.67 Abstraction : 0.04
% 12.89/4.67 MUC search : 0.00
% 12.89/4.67 Cooper : 0.00
% 12.89/4.67 Total : 3.65
% 12.89/4.67 Index Insertion : 0.00
% 12.89/4.67 Index Deletion : 0.00
% 12.89/4.67 Index Matching : 0.00
% 12.89/4.67 BG Taut test : 0.00
%------------------------------------------------------------------------------