TSTP Solution File: SYN266-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN266-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n007.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:51 EDT 2022
% Result : Unsatisfiable 0.19s 0.48s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 19
% Syntax : Number of clauses : 37 ( 20 unt; 0 nHn; 37 RR)
% Number of literals : 58 ( 0 equ; 24 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 18 ( 17 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ p3(b,e,e),
file('SYN266-1.p',unknown),
[] ).
cnf(6,axiom,
s0(b),
file('SYN266-1.p',unknown),
[] ).
cnf(10,axiom,
r0(b),
file('SYN266-1.p',unknown),
[] ).
cnf(15,axiom,
p0(b,u),
file('SYN266-1.p',unknown),
[] ).
cnf(16,axiom,
n0(a,b),
file('SYN266-1.p',unknown),
[] ).
cnf(33,axiom,
k0(b),
file('SYN266-1.p',unknown),
[] ).
cnf(40,axiom,
( ~ n0(u,v)
| k1(v) ),
file('SYN266-1.p',unknown),
[] ).
cnf(41,axiom,
( ~ n0(u,v)
| l1(v,v) ),
file('SYN266-1.p',unknown),
[] ).
cnf(68,axiom,
( ~ s0(u)
| ~ p0(u,v)
| m1(u,v,u) ),
file('SYN266-1.p',unknown),
[] ).
cnf(124,axiom,
( ~ p0(u,v)
| p1(v,v,v) ),
file('SYN266-1.p',unknown),
[] ).
cnf(164,axiom,
( ~ p0(u,u)
| s1(u) ),
file('SYN266-1.p',unknown),
[] ).
cnf(175,axiom,
( ~ k1(b)
| m2(b) ),
file('SYN266-1.p',unknown),
[] ).
cnf(176,axiom,
( ~ p1(u,v,w)
| n2(w) ),
file('SYN266-1.p',unknown),
[] ).
cnf(194,axiom,
( ~ k1(u)
| ~ p2(e,v,w)
| p2(v,w,w) ),
file('SYN266-1.p',unknown),
[] ).
cnf(215,axiom,
( ~ m1(u,v,u)
| p2(v,u,v) ),
file('SYN266-1.p',unknown),
[] ).
cnf(225,axiom,
( ~ l1(u,v)
| q2(v,v,u) ),
file('SYN266-1.p',unknown),
[] ).
cnf(228,axiom,
( ~ s1(b)
| ~ q2(b,u,b)
| s2(u) ),
file('SYN266-1.p',unknown),
[] ).
cnf(275,axiom,
( ~ n2(u)
| m3(u,u,u) ),
file('SYN266-1.p',unknown),
[] ).
cnf(290,axiom,
( ~ p2(u,v,w)
| ~ m3(v,x,w)
| p3(u,v,v) ),
file('SYN266-1.p',unknown),
[] ).
cnf(421,plain,
( ~ m3(e,u,v)
| ~ p2(b,e,v) ),
inference(res,[status(thm),theory(equality)],[290,1]),
[iquote('0:Res:290.2,1.0')] ).
cnf(456,plain,
s1(b),
inference(res,[status(thm),theory(equality)],[15,164]),
[iquote('0:Res:15.0,164.0')] ).
cnf(457,plain,
( ~ q2(b,u,b)
| s2(u) ),
inference(mrr,[status(thm)],[228,456]),
[iquote('0:MRR:228.0,456.0')] ).
cnf(462,plain,
k1(b),
inference(res,[status(thm),theory(equality)],[16,40]),
[iquote('0:Res:16.0,40.0')] ).
cnf(470,plain,
m2(b),
inference(mrr,[status(thm)],[175,462]),
[iquote('0:MRR:175.0,462.0')] ).
cnf(477,plain,
l1(b,b),
inference(res,[status(thm),theory(equality)],[16,41]),
[iquote('0:Res:16.0,41.0')] ).
cnf(505,plain,
q2(b,b,b),
inference(res,[status(thm),theory(equality)],[477,225]),
[iquote('0:Res:477.0,225.0')] ).
cnf(507,plain,
s2(b),
inference(res,[status(thm),theory(equality)],[505,457]),
[iquote('0:Res:505.0,457.0')] ).
cnf(545,plain,
p1(u,u,u),
inference(res,[status(thm),theory(equality)],[15,124]),
[iquote('0:Res:15.0,124.0')] ).
cnf(549,plain,
n2(u),
inference(res,[status(thm),theory(equality)],[545,176]),
[iquote('0:Res:545.0,176.0')] ).
cnf(552,plain,
m3(u,u,u),
inference(mrr,[status(thm)],[275,549]),
[iquote('0:MRR:275.0,549.0')] ).
cnf(669,plain,
~ p2(b,e,e),
inference(res,[status(thm),theory(equality)],[552,421]),
[iquote('0:Res:552.0,421.0')] ).
cnf(714,plain,
( ~ s0(b)
| m1(b,u,b) ),
inference(res,[status(thm),theory(equality)],[15,68]),
[iquote('0:Res:15.0,68.1')] ).
cnf(715,plain,
m1(b,u,b),
inference(ssi,[status(thm)],[714,6,33,10,470,462,507]),
[iquote('0:SSi:714.0,6.0,33.0,10.0,470.0,462.0,507.0')] ).
cnf(716,plain,
p2(u,b,u),
inference(res,[status(thm),theory(equality)],[715,215]),
[iquote('0:Res:715.0,215.0')] ).
cnf(790,plain,
( ~ p2(e,u,v)
| p2(u,v,v) ),
inference(ems,[status(thm)],[194,462]),
[iquote('0:EmS:194.0,462.0')] ).
cnf(796,plain,
p2(b,e,e),
inference(res,[status(thm),theory(equality)],[716,790]),
[iquote('0:Res:716.0,790.0')] ).
cnf(802,plain,
$false,
inference(mrr,[status(thm)],[796,669]),
[iquote('0:MRR:796.0,669.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN266-1 : TPTP v8.1.0. Released v1.1.0.
% 0.03/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n007.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:18:03 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.48
% 0.19/0.48 SPASS V 3.9
% 0.19/0.48 SPASS beiseite: Proof found.
% 0.19/0.48 % SZS status Theorem
% 0.19/0.48 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.48 SPASS derived 334 clauses, backtracked 0 clauses, performed 0 splits and kept 521 clauses.
% 0.19/0.48 SPASS allocated 76259 KBytes.
% 0.19/0.48 SPASS spent 0:00:00.13 on the problem.
% 0.19/0.48 0:00:00.04 for the input.
% 0.19/0.48 0:00:00.00 for the FLOTTER CNF translation.
% 0.19/0.48 0:00:00.00 for inferences.
% 0.19/0.48 0:00:00.00 for the backtracking.
% 0.19/0.48 0:00:00.04 for the reduction.
% 0.19/0.48
% 0.19/0.48
% 0.19/0.48 Here is a proof with depth 3, length 37 :
% 0.19/0.48 % SZS output start Refutation
% See solution above
% 0.19/0.48 Formulae used in the proof : prove_this axiom_5 axiom_9 axiom_14 axiom_15 axiom_32 rule_001 rule_002 rule_029 rule_085 rule_125 rule_136 rule_137 rule_155 rule_176 rule_186 rule_189 rule_236 rule_251
% 0.19/0.48
%------------------------------------------------------------------------------