TSTP Solution File: SYN225-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN225-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:10:02 EDT 2023
% Result : Unsatisfiable 14.07s 4.93s
% Output : CNFRefutation 14.07s
% 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_67,axiom,
l0(a),
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,a),
file(unknown,unknown) ).
tff(c_40,plain,
l0(a),
inference(cnfTransformation,[status(thm)],[f_67]) ).
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_11242,plain,
! [J_2236,I_2237] :
( ~ k0(J_2236)
| ~ l0(I_2237)
| m1(I_2237,J_2236,I_2237) ),
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_11245,plain,
! [J_2236,I_2237] :
( p2(J_2236,I_2237,J_2236)
| ~ k0(J_2236)
| ~ l0(I_2237) ),
inference(resolution,[status(thm)],[c_11242,c_428]) ).
tff(c_11506,plain,
! [G_2294,H_2295] :
( ~ p2(G_2294,H_2295,G_2294)
| ~ r0(G_2294)
| l3(G_2294,H_2295) ),
inference(cnfTransformation,[status(thm)],[f_1807]) ).
tff(c_11707,plain,
! [J_2319,I_2320] :
( ~ r0(J_2319)
| l3(J_2319,I_2320)
| ~ k0(J_2319)
| ~ l0(I_2320) ),
inference(resolution,[status(thm)],[c_11245,c_11506]) ).
tff(c_738,plain,
~ l3(b,a),
inference(cnfTransformation,[status(thm)],[f_2764]) ).
tff(c_11710,plain,
( ~ r0(b)
| ~ k0(b)
| ~ l0(a) ),
inference(resolution,[status(thm)],[c_11707,c_738]) ).
tff(c_11714,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_40,c_64,c_18,c_11710]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SYN225-1 : TPTP v8.1.2. Released v1.1.0.
% 0.00/0.11 % 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.13/0.31 % Computer : n032.cluster.edu
% 0.13/0.31 % Model : x86_64 x86_64
% 0.13/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.31 % Memory : 8042.1875MB
% 0.13/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.31 % CPULimit : 300
% 0.13/0.31 % WCLimit : 300
% 0.13/0.31 % DateTime : Thu Aug 3 17:08:06 EDT 2023
% 0.13/0.31 % CPUTime :
% 14.07/4.93 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 14.07/4.93
% 14.07/4.93 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 14.07/4.96
% 14.07/4.96 Inference rules
% 14.07/4.96 ----------------------
% 14.07/4.96 #Ref : 0
% 14.07/4.96 #Sup : 1833
% 14.07/4.96 #Fact : 0
% 14.07/4.96 #Define : 0
% 14.07/4.96 #Split : 209
% 14.07/4.96 #Chain : 0
% 14.07/4.96 #Close : 0
% 14.07/4.96
% 14.07/4.96 Ordering : KBO
% 14.07/4.96
% 14.07/4.96 Simplification rules
% 14.07/4.96 ----------------------
% 14.07/4.96 #Subsume : 224
% 14.07/4.96 #Demod : 2501
% 14.07/4.96 #Tautology : 2107
% 14.07/4.96 #SimpNegUnit : 72
% 14.07/4.96 #BackRed : 109
% 14.07/4.96
% 14.07/4.96 #Partial instantiations: 0
% 14.07/4.96 #Strategies tried : 1
% 14.07/4.96
% 14.07/4.96 Timing (in seconds)
% 14.07/4.96 ----------------------
% 14.07/4.96 Preprocessing : 1.05
% 14.07/4.96 Parsing : 0.57
% 14.07/4.96 CNF conversion : 0.09
% 14.07/4.96 Main loop : 2.89
% 14.07/4.96 Inferencing : 0.93
% 14.07/4.96 Reduction : 1.02
% 14.07/4.96 Demodulation : 0.67
% 14.07/4.96 BG Simplification : 0.12
% 14.07/4.96 Subsumption : 0.55
% 14.07/4.96 Abstraction : 0.05
% 14.07/4.96 MUC search : 0.00
% 14.07/4.96 Cooper : 0.00
% 14.07/4.96 Total : 4.00
% 14.07/4.96 Index Insertion : 0.00
% 14.07/4.96 Index Deletion : 0.00
% 14.07/4.96 Index Matching : 0.00
% 14.07/4.96 BG Taut test : 0.00
%------------------------------------------------------------------------------