TSTP Solution File: SYN187-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN187-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 : n026.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:52 EDT 2023
% Result : Unsatisfiable 12.47s 4.48s
% Output : CNFRefutation 12.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 59
% Syntax : Number of formulae : 70 ( 11 unt; 53 typ; 0 def)
% Number of atoms : 28 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 24 ( 13 ~; 11 |; 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 : 21 (; 21 !; 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_63,axiom,
! [X] : q0(X,d),
file(unknown,unknown) ).
tff(f_66,axiom,
! [X,Y] : m0(X,d,Y),
file(unknown,unknown) ).
tff(f_1044,axiom,
! [I,J,A] :
( q1(I,I,I)
| ~ m0(J,A,I) ),
file(unknown,unknown) ).
tff(f_44,axiom,
s0(d),
file(unknown,unknown) ).
tff(f_1068,axiom,
! [D,E] :
( r1(D)
| ~ q0(D,E)
| ~ s0(d)
| ~ q1(d,E,d) ),
file(unknown,unknown) ).
tff(f_2764,axiom,
~ r1(d),
file(unknown,unknown) ).
tff(c_34,plain,
! [X_3] : q0(X_3,d),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_38,plain,
! [X_4,Y_5] : m0(X_4,d,Y_5),
inference(cnfTransformation,[status(thm)],[f_66]) ).
tff(c_7771,plain,
! [J_1696,A_1697,I_1698] :
( ~ m0(J_1696,A_1697,I_1698)
| q1(I_1698,I_1698,I_1698) ),
inference(cnfTransformation,[status(thm)],[f_1044]) ).
tff(c_7794,plain,
! [Y_5] : q1(Y_5,Y_5,Y_5),
inference(resolution,[status(thm)],[c_38,c_7771]) ).
tff(c_2,plain,
s0(d),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_324,plain,
! [E_232,D_231] :
( ~ q1(d,E_232,d)
| ~ s0(d)
| ~ q0(D_231,E_232)
| r1(D_231) ),
inference(cnfTransformation,[status(thm)],[f_1068]) ).
tff(c_7963,plain,
! [E_1730,D_1731] :
( ~ q1(d,E_1730,d)
| ~ q0(D_1731,E_1730)
| r1(D_1731) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_324]) ).
tff(c_7966,plain,
! [D_1731] :
( ~ q0(D_1731,d)
| r1(D_1731) ),
inference(resolution,[status(thm)],[c_7794,c_7963]) ).
tff(c_7972,plain,
! [D_1731] : r1(D_1731),
inference(demodulation,[status(thm),theory(equality)],[c_34,c_7966]) ).
tff(c_738,plain,
~ r1(d),
inference(cnfTransformation,[status(thm)],[f_2764]) ).
tff(c_7981,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_7972,c_738]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN187-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.14/0.35 % Computer : n026.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 17:22:47 EDT 2023
% 0.14/0.35 % CPUTime :
% 12.47/4.48 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 12.47/4.49
% 12.47/4.49 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 12.47/4.52
% 12.47/4.52 Inference rules
% 12.47/4.52 ----------------------
% 12.47/4.52 #Ref : 0
% 12.47/4.52 #Sup : 1209
% 12.47/4.52 #Fact : 0
% 12.47/4.52 #Define : 0
% 12.47/4.52 #Split : 149
% 12.47/4.52 #Chain : 0
% 12.47/4.52 #Close : 0
% 12.47/4.52
% 12.47/4.52 Ordering : KBO
% 12.47/4.52
% 12.47/4.52 Simplification rules
% 12.47/4.52 ----------------------
% 12.47/4.52 #Subsume : 165
% 12.47/4.52 #Demod : 1660
% 12.47/4.52 #Tautology : 1427
% 12.47/4.52 #SimpNegUnit : 81
% 12.47/4.52 #BackRed : 127
% 12.47/4.52
% 12.47/4.52 #Partial instantiations: 0
% 12.47/4.52 #Strategies tried : 1
% 12.47/4.52
% 12.47/4.52 Timing (in seconds)
% 12.47/4.52 ----------------------
% 12.47/4.52 Preprocessing : 1.09
% 12.47/4.52 Parsing : 0.64
% 12.47/4.52 CNF conversion : 0.09
% 12.47/4.52 Main loop : 2.33
% 12.47/4.52 Inferencing : 0.70
% 12.47/4.52 Reduction : 0.83
% 12.47/4.52 Demodulation : 0.54
% 12.47/4.52 BG Simplification : 0.11
% 12.47/4.52 Subsumption : 0.45
% 12.47/4.52 Abstraction : 0.04
% 12.47/4.52 MUC search : 0.00
% 12.47/4.52 Cooper : 0.00
% 12.47/4.52 Total : 3.46
% 12.47/4.52 Index Insertion : 0.00
% 12.47/4.52 Index Deletion : 0.00
% 12.47/4.52 Index Matching : 0.00
% 12.47/4.52 BG Taut test : 0.00
%------------------------------------------------------------------------------