TSTP Solution File: SYN111-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN111-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/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n007.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:39 EDT 2023
% Result : Unsatisfiable 46.35s 33.02s
% Output : CNFRefutation 46.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 67
% Syntax : Number of formulae : 100 ( 25 unt; 53 typ; 0 def)
% Number of atoms : 82 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 74 ( 39 ~; 35 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 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 : 47 (; 47 !; 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_242,axiom,
! [I,J] :
( m1(I,J,I)
| ~ l0(I)
| ~ k0(J) ),
file(unknown,unknown) ).
tff(f_46,axiom,
n0(d,e),
file(unknown,unknown) ).
tff(f_91,axiom,
! [I,J] :
( k1(I)
| ~ n0(J,I) ),
file(unknown,unknown) ).
tff(f_1164,axiom,
( m2(b)
| ~ k1(b) ),
file(unknown,unknown) ).
tff(f_60,axiom,
n0(a,b),
file(unknown,unknown) ).
tff(f_78,axiom,
m0(b,b,e),
file(unknown,unknown) ).
tff(f_123,axiom,
! [B,C] :
( m1(B,C,B)
| ~ m0(C,C,B) ),
file(unknown,unknown) ).
tff(f_66,axiom,
! [X,Y] : m0(X,d,Y),
file(unknown,unknown) ).
tff(f_942,axiom,
! [A] :
( q1(e,A,A)
| ~ m0(A,d,A)
| ~ m0(e,d,A) ),
file(unknown,unknown) ).
tff(f_1108,axiom,
! [J,A] :
( k2(J,J)
| ~ q1(A,J,J) ),
file(unknown,unknown) ).
tff(f_1092,axiom,
! [C,D,E,F] :
( k2(C,D)
| ~ m1(E,D,C)
| ~ k1(F)
| ~ k2(F,D) ),
file(unknown,unknown) ).
tff(f_2764,axiom,
~ k2(c,b),
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_118,plain,
! [J_50,I_49] :
( ~ k0(J_50)
| ~ l0(I_49)
| m1(I_49,J_50,I_49) ),
inference(cnfTransformation,[status(thm)],[f_242]) ).
tff(c_6,plain,
n0(d,e),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_1257,plain,
! [J_718,I_719] :
( ~ n0(J_718,I_719)
| k1(I_719) ),
inference(cnfTransformation,[status(thm)],[f_91]) ).
tff(c_1285,plain,
k1(e),
inference(resolution,[status(thm)],[c_6,c_1257]) ).
tff(c_348,plain,
( ~ k1(b)
| m2(b) ),
inference(cnfTransformation,[status(thm)],[f_1164]) ).
tff(c_1218,plain,
~ k1(b),
inference(splitLeft,[status(thm)],[c_348]) ).
tff(c_30,plain,
n0(a,b),
inference(cnfTransformation,[status(thm)],[f_60]) ).
tff(c_1222,plain,
! [J_712,I_713] :
( ~ n0(J_712,I_713)
| k1(I_713) ),
inference(cnfTransformation,[status(thm)],[f_91]) ).
tff(c_1228,plain,
k1(b),
inference(resolution,[status(thm)],[c_30,c_1222]) ).
tff(c_1251,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_1218,c_1228]) ).
tff(c_1253,plain,
k1(b),
inference(splitRight,[status(thm)],[c_348]) ).
tff(c_62,plain,
m0(b,b,e),
inference(cnfTransformation,[status(thm)],[f_78]) ).
tff(c_151672,plain,
! [C_18476,B_18477] :
( ~ m0(C_18476,C_18476,B_18477)
| m1(B_18477,C_18476,B_18477) ),
inference(cnfTransformation,[status(thm)],[f_123]) ).
tff(c_151684,plain,
m1(e,b,e),
inference(resolution,[status(thm)],[c_62,c_151672]) ).
tff(c_38,plain,
! [X_4,Y_5] : m0(X_4,d,Y_5),
inference(cnfTransformation,[status(thm)],[f_66]) ).
tff(c_290,plain,
! [A_205] :
( ~ m0(e,d,A_205)
| ~ m0(A_205,d,A_205)
| q1(e,A_205,A_205) ),
inference(cnfTransformation,[status(thm)],[f_942]) ).
tff(c_774,plain,
! [A_205] : q1(e,A_205,A_205),
inference(demodulation,[status(thm),theory(equality)],[c_38,c_38,c_290]) ).
tff(c_137896,plain,
! [A_16982,J_16983] :
( ~ q1(A_16982,J_16983,J_16983)
| k2(J_16983,J_16983) ),
inference(cnfTransformation,[status(thm)],[f_1108]) ).
tff(c_137936,plain,
! [A_205] : k2(A_205,A_205),
inference(resolution,[status(thm)],[c_774,c_137896]) ).
tff(c_159787,plain,
! [F_19396,D_19397,E_19398,C_19399] :
( ~ k2(F_19396,D_19397)
| ~ k1(F_19396)
| ~ m1(E_19398,D_19397,C_19399)
| k2(C_19399,D_19397) ),
inference(cnfTransformation,[status(thm)],[f_1092]) ).
tff(c_160466,plain,
! [A_19448,E_19449,C_19450] :
( ~ k1(A_19448)
| ~ m1(E_19449,A_19448,C_19450)
| k2(C_19450,A_19448) ),
inference(resolution,[status(thm)],[c_137936,c_159787]) ).
tff(c_160508,plain,
( ~ k1(b)
| k2(e,b) ),
inference(resolution,[status(thm)],[c_151684,c_160466]) ).
tff(c_160540,plain,
k2(e,b),
inference(demodulation,[status(thm),theory(equality)],[c_1253,c_160508]) ).
tff(c_330,plain,
! [F_240,D_238,E_239,C_237] :
( ~ k2(F_240,D_238)
| ~ k1(F_240)
| ~ m1(E_239,D_238,C_237)
| k2(C_237,D_238) ),
inference(cnfTransformation,[status(thm)],[f_1092]) ).
tff(c_160551,plain,
! [E_239,C_237] :
( ~ k1(e)
| ~ m1(E_239,b,C_237)
| k2(C_237,b) ),
inference(resolution,[status(thm)],[c_160540,c_330]) ).
tff(c_160775,plain,
! [E_19465,C_19466] :
( ~ m1(E_19465,b,C_19466)
| k2(C_19466,b) ),
inference(demodulation,[status(thm),theory(equality)],[c_1285,c_160551]) ).
tff(c_160807,plain,
! [I_49] :
( k2(I_49,b)
| ~ k0(b)
| ~ l0(I_49) ),
inference(resolution,[status(thm)],[c_118,c_160775]) ).
tff(c_160846,plain,
! [I_19468] :
( k2(I_19468,b)
| ~ l0(I_19468) ),
inference(demodulation,[status(thm),theory(equality)],[c_64,c_160807]) ).
tff(c_738,plain,
~ k2(c,b),
inference(cnfTransformation,[status(thm)],[f_2764]) ).
tff(c_160851,plain,
~ l0(c),
inference(resolution,[status(thm)],[c_160846,c_738]) ).
tff(c_160856,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_48,c_160851]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN111-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/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.14/0.36 % Computer : n007.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 17:05:23 EDT 2023
% 0.14/0.36 % CPUTime :
% 46.35/33.02 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 46.35/33.03
% 46.35/33.03 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 46.35/33.07
% 46.35/33.07 Inference rules
% 46.35/33.08 ----------------------
% 46.35/33.08 #Ref : 0
% 46.35/33.08 #Sup : 27744
% 46.35/33.08 #Fact : 0
% 46.35/33.08 #Define : 0
% 46.35/33.08 #Split : 2885
% 46.35/33.08 #Chain : 0
% 46.35/33.08 #Close : 0
% 46.35/33.08
% 46.35/33.08 Ordering : KBO
% 46.35/33.08
% 46.35/33.08 Simplification rules
% 46.35/33.08 ----------------------
% 46.35/33.08 #Subsume : 7943
% 46.35/33.08 #Demod : 31009
% 46.35/33.08 #Tautology : 20037
% 46.35/33.08 #SimpNegUnit : 2338
% 46.35/33.08 #BackRed : 2424
% 46.35/33.08
% 46.35/33.08 #Partial instantiations: 0
% 46.35/33.08 #Strategies tried : 1
% 46.35/33.08
% 46.35/33.08 Timing (in seconds)
% 46.35/33.08 ----------------------
% 46.35/33.08 Preprocessing : 1.02
% 46.35/33.08 Parsing : 0.58
% 46.35/33.08 CNF conversion : 0.08
% 46.35/33.08 Main loop : 30.94
% 46.35/33.08 Inferencing : 9.67
% 46.35/33.08 Reduction : 12.27
% 46.35/33.08 Demodulation : 8.36
% 46.35/33.08 BG Simplification : 0.19
% 46.35/33.08 Subsumption : 6.44
% 46.35/33.08 Abstraction : 0.27
% 46.35/33.08 MUC search : 0.00
% 46.35/33.08 Cooper : 0.00
% 46.35/33.08 Total : 32.02
% 46.35/33.08 Index Insertion : 0.00
% 46.35/33.08 Index Deletion : 0.00
% 46.35/33.08 Index Matching : 0.00
% 46.35/33.08 BG Taut test : 0.00
%------------------------------------------------------------------------------