TSTP Solution File: SYN115-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN115-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 : n013.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 20.54s 9.30s
% Output : CNFRefutation 20.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 67
% Syntax : Number of formulae : 98 ( 24 unt; 53 typ; 0 def)
% Number of atoms : 79 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 77 ( 43 ~; 34 |; 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 : 38 (; 38 !; 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_46,axiom,
n0(d,e),
file(unknown,unknown) ).
tff(f_91,axiom,
! [I,J] :
( k1(I)
| ~ n0(J,I) ),
file(unknown,unknown) ).
tff(f_1355,axiom,
! [A] :
( p2(A,A,A)
| ~ k1(A) ),
file(unknown,unknown) ).
tff(f_2007,axiom,
! [D,E,F] :
( n3(D)
| ~ p2(E,F,D) ),
file(unknown,unknown) ).
tff(f_77,axiom,
n0(e,e),
file(unknown,unknown) ).
tff(f_1567,axiom,
! [G,H] :
( q2(G,G,H)
| ~ l1(H,G) ),
file(unknown,unknown) ).
tff(f_2129,axiom,
! [G,H,I] :
( q3(G,H)
| ~ q2(I,G,H)
| ~ n0(I,G) ),
file(unknown,unknown) ).
tff(f_81,axiom,
n0(c,d),
file(unknown,unknown) ).
tff(f_2764,axiom,
~ k4(c),
file(unknown,unknown) ).
tff(f_2307,axiom,
( k4(c)
| ~ n0(c,d)
| ~ q3(e,b)
| ~ n3(e) ),
file(unknown,unknown) ).
tff(f_64,axiom,
p0(c,b),
file(unknown,unknown) ).
tff(f_74,axiom,
m0(e,b,c),
file(unknown,unknown) ).
tff(f_107,axiom,
! [C,D,E,F] :
( l1(C,D)
| ~ p0(E,C)
| ~ r0(F)
| ~ m0(D,C,E) ),
file(unknown,unknown) ).
tff(f_52,axiom,
r0(b),
file(unknown,unknown) ).
tff(c_6,plain,
n0(d,e),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_33146,plain,
! [J_5004,I_5005] :
( ~ n0(J_5004,I_5005)
| k1(I_5005) ),
inference(cnfTransformation,[status(thm)],[f_91]) ).
tff(c_33181,plain,
k1(e),
inference(resolution,[status(thm)],[c_6,c_33146]) ).
tff(c_394,plain,
! [A_292] :
( ~ k1(A_292)
| p2(A_292,A_292,A_292) ),
inference(cnfTransformation,[status(thm)],[f_1355]) ).
tff(c_33243,plain,
! [E_5026,F_5027,D_5028] :
( ~ p2(E_5026,F_5027,D_5028)
| n3(D_5028) ),
inference(cnfTransformation,[status(thm)],[f_2007]) ).
tff(c_33248,plain,
! [A_5029] :
( n3(A_5029)
| ~ k1(A_5029) ),
inference(resolution,[status(thm)],[c_394,c_33243]) ).
tff(c_60,plain,
n0(e,e),
inference(cnfTransformation,[status(thm)],[f_77]) ).
tff(c_448,plain,
! [H_339,G_338] :
( ~ l1(H_339,G_338)
| q2(G_338,G_338,H_339) ),
inference(cnfTransformation,[status(thm)],[f_1567]) ).
tff(c_31433,plain,
! [I_4845,G_4846,H_4847] :
( ~ n0(I_4845,G_4846)
| ~ q2(I_4845,G_4846,H_4847)
| q3(G_4846,H_4847) ),
inference(cnfTransformation,[status(thm)],[f_2129]) ).
tff(c_31522,plain,
! [G_4857,H_4858] :
( ~ n0(G_4857,G_4857)
| q3(G_4857,H_4858)
| ~ l1(H_4858,G_4857) ),
inference(resolution,[status(thm)],[c_448,c_31433]) ).
tff(c_31526,plain,
! [H_4859] :
( q3(e,H_4859)
| ~ l1(H_4859,e) ),
inference(resolution,[status(thm)],[c_60,c_31522]) ).
tff(c_68,plain,
n0(c,d),
inference(cnfTransformation,[status(thm)],[f_81]) ).
tff(c_738,plain,
~ k4(c),
inference(cnfTransformation,[status(thm)],[f_2764]) ).
tff(c_624,plain,
( ~ n3(e)
| ~ q3(e,b)
| ~ n0(c,d)
| k4(c) ),
inference(cnfTransformation,[status(thm)],[f_2307]) ).
tff(c_739,plain,
( ~ n3(e)
| ~ q3(e,b)
| ~ n0(c,d) ),
inference(negUnitSimplification,[status(thm)],[c_738,c_624]) ).
tff(c_741,plain,
( ~ n3(e)
| ~ q3(e,b) ),
inference(demodulation,[status(thm),theory(equality)],[c_68,c_739]) ).
tff(c_1137,plain,
~ q3(e,b),
inference(splitLeft,[status(thm)],[c_741]) ).
tff(c_31530,plain,
~ l1(b,e),
inference(resolution,[status(thm)],[c_31526,c_1137]) ).
tff(c_36,plain,
p0(c,b),
inference(cnfTransformation,[status(thm)],[f_64]) ).
tff(c_54,plain,
m0(e,b,c),
inference(cnfTransformation,[status(thm)],[f_74]) ).
tff(c_82,plain,
! [D_11,C_10,E_12,F_13] :
( ~ m0(D_11,C_10,E_12)
| ~ r0(F_13)
| ~ p0(E_12,C_10)
| l1(C_10,D_11) ),
inference(cnfTransformation,[status(thm)],[f_107]) ).
tff(c_33094,plain,
! [F_13] : ~ r0(F_13),
inference(splitLeft,[status(thm)],[c_82]) ).
tff(c_18,plain,
r0(b),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_33097,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_33094,c_18]) ).
tff(c_33099,plain,
! [D_4999,C_5000,E_5001] :
( ~ m0(D_4999,C_5000,E_5001)
| ~ p0(E_5001,C_5000)
| l1(C_5000,D_4999) ),
inference(splitRight,[status(thm)],[c_82]) ).
tff(c_33114,plain,
( ~ p0(c,b)
| l1(b,e) ),
inference(resolution,[status(thm)],[c_54,c_33099]) ).
tff(c_33132,plain,
l1(b,e),
inference(demodulation,[status(thm),theory(equality)],[c_36,c_33114]) ).
tff(c_33134,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_31530,c_33132]) ).
tff(c_33135,plain,
~ n3(e),
inference(splitRight,[status(thm)],[c_741]) ).
tff(c_33251,plain,
~ k1(e),
inference(resolution,[status(thm)],[c_33248,c_33135]) ).
tff(c_33255,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_33181,c_33251]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SYN115-1 : TPTP v8.1.2. Released v1.1.0.
% 0.08/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.36 % Computer : n013.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:07:18 EDT 2023
% 0.14/0.36 % CPUTime :
% 20.54/9.30 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 20.54/9.31
% 20.54/9.31 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 20.54/9.34
% 20.54/9.34 Inference rules
% 20.54/9.34 ----------------------
% 20.54/9.34 #Ref : 0
% 20.54/9.34 #Sup : 5681
% 20.54/9.34 #Fact : 0
% 20.54/9.34 #Define : 0
% 20.54/9.34 #Split : 611
% 20.54/9.34 #Chain : 0
% 20.54/9.34 #Close : 0
% 20.54/9.34
% 20.54/9.34 Ordering : KBO
% 20.54/9.34
% 20.54/9.34 Simplification rules
% 20.54/9.34 ----------------------
% 20.54/9.34 #Subsume : 1415
% 20.54/9.34 #Demod : 6279
% 20.54/9.34 #Tautology : 4323
% 20.54/9.34 #SimpNegUnit : 473
% 20.54/9.34 #BackRed : 546
% 20.54/9.34
% 20.54/9.34 #Partial instantiations: 0
% 20.54/9.34 #Strategies tried : 1
% 20.54/9.34
% 20.54/9.34 Timing (in seconds)
% 20.54/9.34 ----------------------
% 20.54/9.34 Preprocessing : 0.98
% 20.54/9.34 Parsing : 0.56
% 20.54/9.34 CNF conversion : 0.08
% 20.54/9.34 Main loop : 7.29
% 20.54/9.34 Inferencing : 2.36
% 20.54/9.34 Reduction : 2.66
% 20.54/9.34 Demodulation : 1.73
% 20.54/9.34 BG Simplification : 0.12
% 20.54/9.34 Subsumption : 1.47
% 20.54/9.34 Abstraction : 0.08
% 20.54/9.34 MUC search : 0.00
% 20.54/9.34 Cooper : 0.00
% 20.54/9.34 Total : 8.32
% 20.54/9.34 Index Insertion : 0.00
% 20.54/9.34 Index Deletion : 0.00
% 20.54/9.34 Index Matching : 0.00
% 20.54/9.34 BG Taut test : 0.00
%------------------------------------------------------------------------------