TSTP Solution File: SYN264-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN264-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n018.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:19:50 EDT 2022
% Result : Unsatisfiable 0.18s 0.48s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 10
% Syntax : Number of clauses : 17 ( 11 unt; 0 nHn; 17 RR)
% Number of literals : 27 ( 0 equ; 14 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 9 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ p1(e,c,e),
file('SYN264-1.p',unknown),
[] ).
cnf(4,axiom,
n0(d,e),
file('SYN264-1.p',unknown),
[] ).
cnf(6,axiom,
s0(b),
file('SYN264-1.p',unknown),
[] ).
cnf(14,axiom,
r0(e),
file('SYN264-1.p',unknown),
[] ).
cnf(21,axiom,
l0(a),
file('SYN264-1.p',unknown),
[] ).
cnf(27,axiom,
n0(d,c),
file('SYN264-1.p',unknown),
[] ).
cnf(29,axiom,
k0(e),
file('SYN264-1.p',unknown),
[] ).
cnf(40,axiom,
( ~ n0(u,v)
| k1(v) ),
file('SYN264-1.p',unknown),
[] ).
cnf(102,axiom,
( ~ k0(u)
| ~ n0(d,v)
| p1(v,v,u) ),
file('SYN264-1.p',unknown),
[] ).
cnf(110,axiom,
( ~ l0(u)
| ~ p1(v,w,x)
| ~ s0(b)
| p1(x,v,x) ),
file('SYN264-1.p',unknown),
[] ).
cnf(407,plain,
( ~ l0(u)
| ~ p1(v,w,x)
| p1(x,v,x) ),
inference(mrr,[status(thm)],[110,6]),
[iquote('0:MRR:110.2,6.0')] ).
cnf(420,plain,
( ~ l0(u)
| ~ p1(c,v,e) ),
inference(res,[status(thm),theory(equality)],[407,1]),
[iquote('0:Res:407.2,1.0')] ).
cnf(460,plain,
k1(e),
inference(res,[status(thm),theory(equality)],[4,40]),
[iquote('0:Res:4.0,40.0')] ).
cnf(493,plain,
~ p1(c,u,e),
inference(ems,[status(thm)],[420,21]),
[iquote('0:EmS:420.0,21.0')] ).
cnf(694,plain,
( ~ k0(u)
| p1(c,c,u) ),
inference(res,[status(thm),theory(equality)],[27,102]),
[iquote('0:Res:27.0,102.1')] ).
cnf(697,plain,
~ k0(e),
inference(res,[status(thm),theory(equality)],[694,493]),
[iquote('0:Res:694.1,493.0')] ).
cnf(699,plain,
$false,
inference(ssi,[status(thm)],[697,29,14,460]),
[iquote('0:SSi:697.0,29.0,14.0,460.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN264-1 : TPTP v8.1.0. Released v1.1.0.
% 0.07/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n018.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 : Mon Jul 11 20:06:59 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.48
% 0.18/0.48 SPASS V 3.9
% 0.18/0.48 SPASS beiseite: Proof found.
% 0.18/0.48 % SZS status Theorem
% 0.18/0.48 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.48 SPASS derived 243 clauses, backtracked 0 clauses, performed 0 splits and kept 472 clauses.
% 0.18/0.48 SPASS allocated 76199 KBytes.
% 0.18/0.48 SPASS spent 0:00:00.13 on the problem.
% 0.18/0.48 0:00:00.04 for the input.
% 0.18/0.48 0:00:00.00 for the FLOTTER CNF translation.
% 0.18/0.48 0:00:00.00 for inferences.
% 0.18/0.48 0:00:00.00 for the backtracking.
% 0.18/0.48 0:00:00.04 for the reduction.
% 0.18/0.48
% 0.18/0.48
% 0.18/0.48 Here is a proof with depth 3, length 17 :
% 0.18/0.48 % SZS output start Refutation
% See solution above
% 0.18/0.48 Formulae used in the proof : prove_this axiom_3 axiom_5 axiom_13 axiom_20 axiom_26 axiom_28 rule_001 rule_063 rule_071
% 0.18/0.48
%------------------------------------------------------------------------------