TSTP Solution File: SYN117-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN117-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n025.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:18:49 EDT 2022
% Result : Unsatisfiable 0.20s 0.44s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 13
% Syntax : Number of clauses : 26 ( 14 unt; 0 nHn; 26 RR)
% Number of literals : 41 ( 0 equ; 18 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 12 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 8 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ k5(e),
file('SYN117-1.p',unknown),
[] ).
cnf(4,axiom,
n0(d,e),
file('SYN117-1.p',unknown),
[] ).
cnf(15,axiom,
p0(b,u),
file('SYN117-1.p',unknown),
[] ).
cnf(27,axiom,
n0(d,c),
file('SYN117-1.p',unknown),
[] ).
cnf(40,axiom,
( ~ n0(u,v)
| k1(v) ),
file('SYN117-1.p',unknown),
[] ).
cnf(41,axiom,
( ~ n0(u,v)
| l1(v,v) ),
file('SYN117-1.p',unknown),
[] ).
cnf(124,axiom,
( ~ p0(u,v)
| p1(v,v,v) ),
file('SYN117-1.p',unknown),
[] ).
cnf(176,axiom,
( ~ p1(u,v,w)
| n2(w) ),
file('SYN117-1.p',unknown),
[] ).
cnf(213,axiom,
( ~ n2(u)
| ~ k1(e)
| p2(u,u,u) ),
file('SYN117-1.p',unknown),
[] ).
cnf(283,axiom,
( ~ n2(u)
| p3(u,u,u) ),
file('SYN117-1.p',unknown),
[] ).
cnf(306,axiom,
( ~ p2(u,v,w)
| r3(u,w,u) ),
file('SYN117-1.p',unknown),
[] ).
cnf(338,axiom,
( ~ l1(u,v)
| ~ p3(w,v,x)
| s4(u) ),
file('SYN117-1.p',unknown),
[] ).
cnf(339,axiom,
( ~ s4(u)
| ~ r3(v,w,w)
| k5(w) ),
file('SYN117-1.p',unknown),
[] ).
cnf(419,plain,
( ~ s4(u)
| ~ r3(v,e,e) ),
inference(res,[status(thm),theory(equality)],[339,1]),
[iquote('0:Res:339.2,1.0')] ).
cnf(459,plain,
k1(e),
inference(res,[status(thm),theory(equality)],[4,40]),
[iquote('0:Res:4.0,40.0')] ).
cnf(467,plain,
( ~ n2(u)
| p2(u,u,u) ),
inference(mrr,[status(thm)],[213,459]),
[iquote('0:MRR:213.1,459.0')] ).
cnf(473,plain,
l1(c,c),
inference(res,[status(thm),theory(equality)],[27,41]),
[iquote('0:Res:27.0,41.0')] ).
cnf(541,plain,
p1(u,u,u),
inference(res,[status(thm),theory(equality)],[15,124]),
[iquote('0:Res:15.0,124.0')] ).
cnf(545,plain,
n2(u),
inference(res,[status(thm),theory(equality)],[541,176]),
[iquote('0:Res:541.0,176.0')] ).
cnf(547,plain,
p3(u,u,u),
inference(mrr,[status(thm)],[283,545]),
[iquote('0:MRR:283.0,545.0')] ).
cnf(551,plain,
p2(u,u,u),
inference(mrr,[status(thm)],[467,545]),
[iquote('0:MRR:467.0,545.0')] ).
cnf(641,plain,
r3(u,u,u),
inference(res,[status(thm),theory(equality)],[551,306]),
[iquote('0:Res:551.0,306.0')] ).
cnf(733,plain,
( ~ l1(u,v)
| s4(u) ),
inference(res,[status(thm),theory(equality)],[547,338]),
[iquote('0:Res:547.0,338.1')] ).
cnf(734,plain,
s4(c),
inference(res,[status(thm),theory(equality)],[473,733]),
[iquote('0:Res:473.0,733.0')] ).
cnf(742,plain,
~ r3(u,e,e),
inference(ems,[status(thm)],[419,734]),
[iquote('0:EmS:419.0,734.0')] ).
cnf(743,plain,
$false,
inference(unc,[status(thm)],[742,641]),
[iquote('0:UnC:742.0,641.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN117-1 : TPTP v8.1.0. Released v1.1.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n025.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jul 12 04:55:33 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.44
% 0.20/0.44 SPASS V 3.9
% 0.20/0.44 SPASS beiseite: Proof found.
% 0.20/0.44 % SZS status Theorem
% 0.20/0.44 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.44 SPASS derived 281 clauses, backtracked 0 clauses, performed 0 splits and kept 498 clauses.
% 0.20/0.44 SPASS allocated 76223 KBytes.
% 0.20/0.44 SPASS spent 0:00:00.09 on the problem.
% 0.20/0.44 0:00:00.03 for the input.
% 0.20/0.44 0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.44 0:00:00.00 for inferences.
% 0.20/0.44 0:00:00.00 for the backtracking.
% 0.20/0.44 0:00:00.03 for the reduction.
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44 Here is a proof with depth 3, length 26 :
% 0.20/0.44 % SZS output start Refutation
% See solution above
% 0.20/0.45 Formulae used in the proof : prove_this axiom_3 axiom_14 axiom_26 rule_001 rule_002 rule_085 rule_137 rule_174 rule_244 rule_267 rule_299 rule_300
% 0.20/0.45
%------------------------------------------------------------------------------