TSTP Solution File: SYN591-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN591-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n004.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 : 600s
% DateTime : Thu Jul 21 12:23:04 EDT 2022
% Result : Unsatisfiable 89.24s 89.42s
% Output : Refutation 89.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of clauses : 33 ( 11 unt; 4 nHn; 33 RR)
% Number of literals : 84 ( 0 equ; 51 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 10 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
p7(u,u),
file('SYN591-1.p',unknown),
[] ).
cnf(4,axiom,
p2(u,u),
file('SYN591-1.p',unknown),
[] ).
cnf(5,axiom,
p3(u,u),
file('SYN591-1.p',unknown),
[] ).
cnf(11,axiom,
p12(c14,f4(c18,c17)),
file('SYN591-1.p',unknown),
[] ).
cnf(12,axiom,
~ p11(c13,f4(c17,f6(c18))),
file('SYN591-1.p',unknown),
[] ).
cnf(13,axiom,
~ p11(c13,f4(f6(c18),c17)),
file('SYN591-1.p',unknown),
[] ).
cnf(20,axiom,
( ~ p2(u,v)
| ~ p2(u,w)
| p2(w,v) ),
file('SYN591-1.p',unknown),
[] ).
cnf(21,axiom,
( ~ p3(u,v)
| ~ p3(u,w)
| p3(w,v) ),
file('SYN591-1.p',unknown),
[] ).
cnf(22,axiom,
( ~ p12(c14,f4(u,c17))
| p2(f6(u),f5(u)) ),
file('SYN591-1.p',unknown),
[] ).
cnf(25,axiom,
( ~ p11(u,v)
| ~ p7(u,w)
| ~ p3(v,x)
| p11(w,x) ),
file('SYN591-1.p',unknown),
[] ).
cnf(26,axiom,
( ~ p2(u,v)
| ~ p2(w,x)
| p3(f4(w,u),f4(x,v)) ),
file('SYN591-1.p',unknown),
[] ).
cnf(27,axiom,
( ~ p12(c14,f4(u,c17))
| p11(c13,f4(c17,f5(u)))
| p11(c13,f4(f5(u),c17)) ),
file('SYN591-1.p',unknown),
[] ).
cnf(34,plain,
p2(f6(c18),f5(c18)),
inference(res,[status(thm),theory(equality)],[11,22]),
[iquote('0:Res:11.0,22.0')] ).
cnf(35,plain,
( ~ p3(u,v)
| p3(v,u) ),
inference(res,[status(thm),theory(equality)],[5,21]),
[iquote('0:Res:5.0,21.0')] ).
cnf(39,plain,
( ~ p2(u,v)
| p2(v,u) ),
inference(res,[status(thm),theory(equality)],[4,20]),
[iquote('0:Res:4.0,20.0')] ).
cnf(46,plain,
p2(f5(c18),f6(c18)),
inference(res,[status(thm),theory(equality)],[34,39]),
[iquote('0:Res:34.0,39.0')] ).
cnf(56,plain,
( ~ p2(u,v)
| ~ p2(w,x)
| ~ p3(f4(w,u),y)
| p3(y,f4(x,v)) ),
inference(res,[status(thm),theory(equality)],[26,21]),
[iquote('0:Res:26.2,21.0')] ).
cnf(115,plain,
( ~ p12(c14,f4(u,c17))
| ~ p7(c13,v)
| ~ p3(f4(f5(u),c17),w)
| p11(c13,f4(c17,f5(u)))
| p11(v,w) ),
inference(res,[status(thm),theory(equality)],[27,25]),
[iquote('0:Res:27.2,25.0')] ).
cnf(256,plain,
( ~ p2(u,v)
| ~ p2(w,x)
| ~ p2(u,y)
| ~ p2(w,z)
| p3(f4(x,v),f4(z,y)) ),
inference(res,[status(thm),theory(equality)],[26,56]),
[iquote('0:Res:26.2,56.2')] ).
cnf(290,plain,
( ~ p2(c17,u)
| ~ p2(f5(v),w)
| ~ p12(c14,f4(v,c17))
| ~ p7(c13,x)
| p11(c13,f4(c17,f5(v)))
| p11(x,f4(w,u)) ),
inference(res,[status(thm),theory(equality)],[26,115]),
[iquote('0:Res:26.2,115.2')] ).
cnf(867,plain,
( ~ p2(u,v)
| ~ p2(f5(c18),w)
| ~ p2(u,x)
| p3(f4(v,f6(c18)),f4(x,w)) ),
inference(res,[status(thm),theory(equality)],[46,256]),
[iquote('0:Res:46.0,256.0')] ).
cnf(977,plain,
( ~ p2(c17,u)
| ~ p2(f5(c18),v)
| ~ p7(c13,w)
| p11(c13,f4(c17,f5(c18)))
| p11(w,f4(v,u)) ),
inference(res,[status(thm),theory(equality)],[11,290]),
[iquote('0:Res:11.0,290.2')] ).
cnf(4385,plain,
( ~ p2(u,v)
| ~ p2(u,w)
| p3(f4(v,f6(c18)),f4(w,f5(c18))) ),
inference(res,[status(thm),theory(equality)],[4,867]),
[iquote('0:Res:4.0,867.1')] ).
cnf(5200,plain,
( ~ p2(c17,u)
| ~ p2(f5(c18),v)
| ~ p7(c13,w)
| p11(w,f4(v,u)) ),
inference(spt,[spt(split,[position(s1)])],[977]),
[iquote('1:Spt:977.0,977.1,977.2,977.4')] ).
cnf(5201,plain,
( ~ p2(c17,c17)
| ~ p2(f5(c18),f6(c18))
| ~ p7(c13,c13) ),
inference(res,[status(thm),theory(equality)],[5200,13]),
[iquote('1:Res:5200.3,13.0')] ).
cnf(5204,plain,
$false,
inference(mrr,[status(thm)],[5201,4,46,3]),
[iquote('1:MRR:5201.0,5201.1,5201.2,4.0,46.0,3.0')] ).
cnf(5206,plain,
p11(c13,f4(c17,f5(c18))),
inference(spt,[spt(split,[position(s2)])],[977]),
[iquote('1:Spt:5204.0,977.3')] ).
cnf(5207,plain,
( ~ p7(c13,u)
| ~ p3(f4(c17,f5(c18)),v)
| p11(u,v) ),
inference(res,[status(thm),theory(equality)],[5206,25]),
[iquote('1:Res:5206.0,25.0')] ).
cnf(35071,plain,
( ~ p2(u,v)
| p3(f4(u,f6(c18)),f4(v,f5(c18))) ),
inference(res,[status(thm),theory(equality)],[4,4385]),
[iquote('0:Res:4.0,4385.0')] ).
cnf(35658,plain,
( ~ p2(u,v)
| p3(f4(v,f5(c18)),f4(u,f6(c18))) ),
inference(res,[status(thm),theory(equality)],[35071,35]),
[iquote('0:Res:35071.1,35.0')] ).
cnf(39538,plain,
( ~ p2(u,c17)
| ~ p7(c13,v)
| p11(v,f4(u,f6(c18))) ),
inference(res,[status(thm),theory(equality)],[35658,5207]),
[iquote('1:Res:35658.1,5207.1')] ).
cnf(39543,plain,
( ~ p2(c17,c17)
| ~ p7(c13,c13) ),
inference(res,[status(thm),theory(equality)],[39538,12]),
[iquote('1:Res:39538.2,12.0')] ).
cnf(39545,plain,
$false,
inference(mrr,[status(thm)],[39543,4,3]),
[iquote('1:MRR:39543.0,39543.1,4.0,3.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.12 % Problem : SYN591-1 : TPTP v8.1.0. Released v2.5.0.
% 0.05/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n004.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jul 12 01:03:37 EDT 2022
% 0.12/0.33 % CPUTime :
% 89.24/89.42
% 89.24/89.42 SPASS V 3.9
% 89.24/89.42 SPASS beiseite: Proof found.
% 89.24/89.42 % SZS status Theorem
% 89.24/89.42 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 89.24/89.42 SPASS derived 38584 clauses, backtracked 1 clauses, performed 2 splits and kept 21606 clauses.
% 89.24/89.42 SPASS allocated 98831 KBytes.
% 89.24/89.42 SPASS spent 0:1:27.65 on the problem.
% 89.24/89.42 0:00:00.03 for the input.
% 89.24/89.42 0:00:00.00 for the FLOTTER CNF translation.
% 89.24/89.42 0:00:00.36 for inferences.
% 89.24/89.42 0:00:00.01 for the backtracking.
% 89.24/89.42 0:1:26.98 for the reduction.
% 89.24/89.42
% 89.24/89.42
% 89.24/89.42 Here is a proof with depth 8, length 33 :
% 89.24/89.42 % SZS output start Refutation
% See solution above
% 89.24/89.42 Formulae used in the proof : p7_3 p2_4 p3_5 p12_11 not_p11_12 not_p11_13 p2_20 p3_21 p2_22 p11_25 p3_26 p11_27
% 89.24/89.42
%------------------------------------------------------------------------------