TSTP Solution File: SYN215-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN215-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n022.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:30 EDT 2022
% Result : Unsatisfiable 0.19s 0.47s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 22
% Syntax : Number of clauses : 46 ( 21 unt; 0 nHn; 46 RR)
% Number of literals : 80 ( 0 equ; 44 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 17 ( 16 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,
~ s5(d),
file('SYN215-1.p',unknown),
[] ).
cnf(2,axiom,
s0(d),
file('SYN215-1.p',unknown),
[] ).
cnf(4,axiom,
n0(d,e),
file('SYN215-1.p',unknown),
[] ).
cnf(15,axiom,
p0(b,u),
file('SYN215-1.p',unknown),
[] ).
cnf(19,axiom,
p0(c,b),
file('SYN215-1.p',unknown),
[] ).
cnf(25,axiom,
l0(c),
file('SYN215-1.p',unknown),
[] ).
cnf(29,axiom,
k0(e),
file('SYN215-1.p',unknown),
[] ).
cnf(31,axiom,
n0(e,e),
file('SYN215-1.p',unknown),
[] ).
cnf(35,axiom,
n0(c,d),
file('SYN215-1.p',unknown),
[] ).
cnf(40,axiom,
( ~ n0(u,v)
| k1(v) ),
file('SYN215-1.p',unknown),
[] ).
cnf(118,axiom,
( ~ k1(u)
| ~ k0(e)
| ~ l0(c)
| p1(u,u,u) ),
file('SYN215-1.p',unknown),
[] ).
cnf(124,axiom,
( ~ p0(u,v)
| p1(v,v,v) ),
file('SYN215-1.p',unknown),
[] ).
cnf(176,axiom,
( ~ p1(u,v,w)
| n2(w) ),
file('SYN215-1.p',unknown),
[] ).
cnf(190,axiom,
( ~ k1(d)
| ~ s0(d)
| p2(d,d,d) ),
file('SYN215-1.p',unknown),
[] ).
cnf(213,axiom,
( ~ n2(u)
| ~ k1(e)
| p2(u,u,u) ),
file('SYN215-1.p',unknown),
[] ).
cnf(220,axiom,
( ~ p1(u,u,u)
| q2(u,u,u) ),
file('SYN215-1.p',unknown),
[] ).
cnf(279,axiom,
( ~ p2(u,v,w)
| n3(w) ),
file('SYN215-1.p',unknown),
[] ).
cnf(283,axiom,
( ~ n2(u)
| p3(u,u,u) ),
file('SYN215-1.p',unknown),
[] ).
cnf(294,axiom,
( ~ n0(u,v)
| ~ q2(u,v,w)
| q3(v,w) ),
file('SYN215-1.p',unknown),
[] ).
cnf(316,axiom,
( ~ p3(u,v,w)
| l4(w) ),
file('SYN215-1.p',unknown),
[] ).
cnf(337,axiom,
( ~ n3(u)
| ~ p0(v,u)
| ~ q3(w,x)
| r4(u) ),
file('SYN215-1.p',unknown),
[] ).
cnf(368,axiom,
( ~ r4(u)
| ~ l4(v)
| s5(v) ),
file('SYN215-1.p',unknown),
[] ).
cnf(378,plain,
( ~ k1(d)
| p2(d,d,d) ),
inference(mrr,[status(thm)],[190,2]),
[iquote('0:MRR:190.1,2.0')] ).
cnf(398,plain,
( ~ k1(u)
| p1(u,u,u) ),
inference(mrr,[status(thm)],[118,29,25]),
[iquote('0:MRR:118.1,118.2,29.0,25.0')] ).
cnf(420,plain,
( ~ r4(u)
| ~ l4(d) ),
inference(res,[status(thm),theory(equality)],[368,1]),
[iquote('0:Res:368.2,1.0')] ).
cnf(458,plain,
k1(d),
inference(res,[status(thm),theory(equality)],[35,40]),
[iquote('0:Res:35.0,40.0')] ).
cnf(460,plain,
k1(e),
inference(res,[status(thm),theory(equality)],[4,40]),
[iquote('0:Res:4.0,40.0')] ).
cnf(466,plain,
p2(d,d,d),
inference(mrr,[status(thm)],[378,458]),
[iquote('0:MRR:378.0,458.0')] ).
cnf(468,plain,
( ~ n2(u)
| p2(u,u,u) ),
inference(mrr,[status(thm)],[213,460]),
[iquote('0:MRR:213.1,460.0')] ).
cnf(482,plain,
n3(d),
inference(res,[status(thm),theory(equality)],[466,279]),
[iquote('0:Res:466.0,279.0')] ).
cnf(484,plain,
( ~ n2(u)
| l4(u) ),
inference(res,[status(thm),theory(equality)],[283,316]),
[iquote('0:Res:283.1,316.0')] ).
cnf(485,plain,
( ~ r4(u)
| ~ n2(d) ),
inference(sor,[status(thm)],[420,484]),
[iquote('0:SoR:420.1,484.1')] ).
cnf(489,plain,
( ~ k1(u)
| n2(u) ),
inference(res,[status(thm),theory(equality)],[398,176]),
[iquote('0:Res:398.1,176.0')] ).
cnf(493,plain,
( ~ n2(u)
| n3(u) ),
inference(res,[status(thm),theory(equality)],[468,279]),
[iquote('0:Res:468.1,279.0')] ).
cnf(494,plain,
( ~ r4(u)
| ~ k1(d) ),
inference(sor,[status(thm)],[485,489]),
[iquote('0:SoR:485.1,489.1')] ).
cnf(495,plain,
~ r4(u),
inference(ssi,[status(thm)],[494,2,458,482]),
[iquote('0:SSi:494.1,2.0,458.0,482.0')] ).
cnf(496,plain,
( ~ n3(u)
| ~ p0(v,u)
| ~ q3(w,x) ),
inference(mrr,[status(thm)],[337,495]),
[iquote('0:MRR:337.3,495.0')] ).
cnf(546,plain,
p1(u,u,u),
inference(res,[status(thm),theory(equality)],[15,124]),
[iquote('0:Res:15.0,124.0')] ).
cnf(547,plain,
q2(u,u,u),
inference(mrr,[status(thm)],[220,546]),
[iquote('0:MRR:220.0,546.0')] ).
cnf(550,plain,
n2(u),
inference(res,[status(thm),theory(equality)],[546,176]),
[iquote('0:Res:546.0,176.0')] ).
cnf(557,plain,
n3(u),
inference(mrr,[status(thm)],[493,550]),
[iquote('0:MRR:493.0,550.0')] ).
cnf(566,plain,
( ~ p0(u,v)
| ~ q3(w,x) ),
inference(mrr,[status(thm)],[496,557]),
[iquote('0:MRR:496.0,557.0')] ).
cnf(573,plain,
~ q3(u,v),
inference(res,[status(thm),theory(equality)],[19,566]),
[iquote('0:Res:19.0,566.0')] ).
cnf(575,plain,
( ~ n0(u,v)
| ~ q2(u,v,w) ),
inference(mrr,[status(thm)],[294,573]),
[iquote('0:MRR:294.2,573.0')] ).
cnf(636,plain,
~ n0(u,u),
inference(res,[status(thm),theory(equality)],[547,575]),
[iquote('0:Res:547.0,575.1')] ).
cnf(638,plain,
$false,
inference(unc,[status(thm)],[636,31]),
[iquote('0:UnC:636.0,31.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN215-1 : TPTP v8.1.0. Released v1.1.0.
% 0.12/0.13 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n022.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.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jul 11 12:49:40 EDT 2022
% 0.19/0.34 % CPUTime :
% 0.19/0.47
% 0.19/0.47 SPASS V 3.9
% 0.19/0.47 SPASS beiseite: Proof found.
% 0.19/0.47 % SZS status Theorem
% 0.19/0.47 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.47 SPASS derived 183 clauses, backtracked 0 clauses, performed 0 splits and kept 448 clauses.
% 0.19/0.47 SPASS allocated 76174 KBytes.
% 0.19/0.47 SPASS spent 0:00:00.12 on the problem.
% 0.19/0.47 0:00:00.04 for the input.
% 0.19/0.47 0:00:00.00 for the FLOTTER CNF translation.
% 0.19/0.47 0:00:00.00 for inferences.
% 0.19/0.47 0:00:00.00 for the backtracking.
% 0.19/0.47 0:00:00.04 for the reduction.
% 0.19/0.47
% 0.19/0.47
% 0.19/0.47 Here is a proof with depth 3, length 46 :
% 0.19/0.47 % SZS output start Refutation
% See solution above
% 0.19/0.47 Formulae used in the proof : prove_this axiom_1 axiom_3 axiom_14 axiom_18 axiom_24 axiom_28 axiom_30 axiom_34 rule_001 rule_079 rule_085 rule_137 rule_151 rule_174 rule_181 rule_240 rule_244 rule_255 rule_277 rule_298 rule_329
% 0.19/0.47
%------------------------------------------------------------------------------