TSTP Solution File: SYN568-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN568-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n010.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:22:56 EDT 2022
% Result : Unsatisfiable 0.20s 0.46s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 12 ( 7 unt; 2 nHn; 12 RR)
% Number of literals : 22 ( 0 equ; 12 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
~ p11(f9(c13),f9(c14)),
file('SYN568-1.p',unknown),
[] ).
cnf(4,axiom,
p11(f5(f6(c12)),f9(u)),
file('SYN568-1.p',unknown),
[] ).
cnf(5,axiom,
( p11(u,v)
| p10(v,u) ),
file('SYN568-1.p',unknown),
[] ).
cnf(6,axiom,
( ~ p11(u,v)
| ~ p10(v,u) ),
file('SYN568-1.p',unknown),
[] ).
cnf(7,axiom,
~ p3(f6(f7(f8(c12))),f6(c12)),
file('SYN568-1.p',unknown),
[] ).
cnf(18,axiom,
p11(f4(f9(c13),f6(f7(f8(c12)))),f4(f9(c14),f6(f7(f8(c12))))),
file('SYN568-1.p',unknown),
[] ).
cnf(20,axiom,
( ~ p10(u,v)
| ~ p11(f5(f6(c12)),u)
| p3(w,f6(c12))
| p10(f4(u,w),f4(v,w)) ),
file('SYN568-1.p',unknown),
[] ).
cnf(124,plain,
( ~ p10(u,v)
| ~ p11(f5(f6(c12)),u)
| ~ p11(f4(v,w),f4(u,w))
| p3(w,f6(c12)) ),
inference(res,[status(thm),theory(equality)],[20,6]),
[iquote('0:Res:20.3,6.1')] ).
cnf(240,plain,
( ~ p10(f9(c14),f9(c13))
| ~ p11(f5(f6(c12)),f9(c14))
| p3(f6(f7(f8(c12))),f6(c12)) ),
inference(res,[status(thm),theory(equality)],[18,124]),
[iquote('0:Res:18.0,124.2')] ).
cnf(242,plain,
~ p10(f9(c14),f9(c13)),
inference(mrr,[status(thm)],[240,4,7]),
[iquote('0:MRR:240.1,240.2,4.0,7.0')] ).
cnf(243,plain,
p11(f9(c13),f9(c14)),
inference(res,[status(thm),theory(equality)],[5,242]),
[iquote('0:Res:5.1,242.0')] ).
cnf(244,plain,
$false,
inference(mrr,[status(thm)],[243,3]),
[iquote('0:MRR:243.0,3.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SYN568-1 : TPTP v8.1.0. Released v2.5.0.
% 0.12/0.13 % Command : run_spass %d %s
% 0.13/0.35 % Computer : n010.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Tue Jul 12 03:33:45 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46
% 0.20/0.46 SPASS V 3.9
% 0.20/0.46 SPASS beiseite: Proof found.
% 0.20/0.46 % SZS status Theorem
% 0.20/0.46 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.46 SPASS derived 222 clauses, backtracked 0 clauses, performed 0 splits and kept 144 clauses.
% 0.20/0.46 SPASS allocated 63331 KBytes.
% 0.20/0.46 SPASS spent 0:00:00.09 on the problem.
% 0.20/0.46 0:00:00.04 for the input.
% 0.20/0.46 0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.46 0:00:00.00 for inferences.
% 0.20/0.46 0:00:00.00 for the backtracking.
% 0.20/0.46 0:00:00.02 for the reduction.
% 0.20/0.46
% 0.20/0.46
% 0.20/0.46 Here is a proof with depth 3, length 12 :
% 0.20/0.46 % SZS output start Refutation
% See solution above
% 0.20/0.46 Formulae used in the proof : not_p11_3 p11_4 p10_5 not_p10_6 not_p3_7 p11_18 p3_20
% 0.20/0.46
%------------------------------------------------------------------------------