TSTP Solution File: SWC404-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC404-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n006.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 : Tue Jul 19 22:03:51 EDT 2022
% Result : Unsatisfiable 7.24s 7.45s
% Output : Refutation 7.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 17
% Syntax : Number of clauses : 40 ( 17 unt; 1 nHn; 40 RR)
% Number of literals : 106 ( 0 equ; 74 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 12 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
ssList(sk1),
file('SWC404-1.p',unknown),
[] ).
cnf(5,axiom,
equal(sk4,sk2),
file('SWC404-1.p',unknown),
[] ).
cnf(6,axiom,
equal(sk3,sk1),
file('SWC404-1.p',unknown),
[] ).
cnf(7,axiom,
ssList(sk5),
file('SWC404-1.p',unknown),
[] ).
cnf(8,axiom,
ssList(sk6),
file('SWC404-1.p',unknown),
[] ).
cnf(9,axiom,
equal(app(app(sk5,sk3),sk6),sk4),
file('SWC404-1.p',unknown),
[] ).
cnf(10,axiom,
strictorderedP(sk3),
file('SWC404-1.p',unknown),
[] ).
cnf(14,axiom,
memberP(sk1,sk7),
file('SWC404-1.p',unknown),
[] ).
cnf(15,axiom,
~ memberP(sk2,sk7),
file('SWC404-1.p',unknown),
[] ).
cnf(63,axiom,
ssItem(skaf44(u)),
file('SWC404-1.p',unknown),
[] ).
cnf(88,axiom,
( ~ ssList(u)
| ssItem(v)
| duplicatefreeP(u) ),
file('SWC404-1.p',unknown),
[] ).
cnf(101,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ssList(app(u,v)) ),
file('SWC404-1.p',unknown),
[] ).
cnf(102,axiom,
( ~ ssList(u)
| ~ ssItem(v)
| ssList(cons(v,u)) ),
file('SWC404-1.p',unknown),
[] ).
cnf(156,axiom,
( ~ ssItem(u)
| ~ ssList(v)
| ~ ssList(w)
| ~ memberP(v,u)
| memberP(app(v,w),u) ),
file('SWC404-1.p',unknown),
[] ).
cnf(157,axiom,
( ~ ssItem(u)
| ~ ssList(v)
| ~ ssList(w)
| ~ memberP(w,u)
| memberP(app(v,w),u) ),
file('SWC404-1.p',unknown),
[] ).
cnf(173,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ~ ssItem(w)
| equal(app(cons(w,v),u),cons(w,app(v,u))) ),
file('SWC404-1.p',unknown),
[] ).
cnf(195,axiom,
( ~ ssList(u)
| ~ duplicatefreeP(u)
| ~ ssItem(v)
| ~ ssList(w)
| ~ ssList(x)
| ~ ssList(y)
| ~ equal(app(app(w,cons(v,x)),cons(v,y)),u) ),
file('SWC404-1.p',unknown),
[] ).
cnf(202,plain,
strictorderedP(sk1),
inference(rew,[status(thm),theory(equality)],[6,10]),
[iquote('0:Rew:6.0,10.0')] ).
cnf(206,plain,
equal(app(app(sk5,sk1),sk6),sk2),
inference(rew,[status(thm),theory(equality)],[6,9,5]),
[iquote('0:Rew:6.0,9.0,5.0,9.0')] ).
cnf(458,plain,
( ~ ssItem(u)
| ssList(cons(u,sk6)) ),
inference(res,[status(thm),theory(equality)],[8,102]),
[iquote('0:Res:8.0,102.1')] ).
cnf(496,plain,
ssItem(u),
inference(spt,[spt(split,[position(s1)])],[88]),
[iquote('1:Spt:88.1')] ).
cnf(593,plain,
( ~ ssList(u)
| ~ ssList(v)
| ~ memberP(v,w)
| memberP(app(u,v),w) ),
inference(mrr,[status(thm)],[157,496]),
[iquote('1:MRR:157.0,496.0')] ).
cnf(594,plain,
( ~ ssList(u)
| ~ ssList(v)
| ~ memberP(u,w)
| memberP(app(u,v),w) ),
inference(mrr,[status(thm)],[156,496]),
[iquote('1:MRR:156.0,496.0')] ).
cnf(2487,plain,
( ~ ssList(app(sk5,sk1))
| ~ ssList(sk6)
| ~ memberP(app(sk5,sk1),u)
| memberP(sk2,u) ),
inference(spr,[status(thm),theory(equality)],[206,594]),
[iquote('1:SpR:206.0,594.3')] ).
cnf(3319,plain,
( ~ memberP(app(sk5,sk1),u)
| memberP(sk2,u) ),
inference(ssi,[status(thm)],[2487,8,101,7,202,1]),
[iquote('1:SSi:2487.1,2487.0,8.0,101.0,7.0,202.2,1.0')] ).
cnf(3498,plain,
( ~ ssList(sk5)
| ~ ssList(sk1)
| ~ memberP(sk1,u)
| memberP(sk2,u) ),
inference(res,[status(thm),theory(equality)],[593,3319]),
[iquote('1:Res:593.3,3319.0')] ).
cnf(3500,plain,
( ~ memberP(sk1,u)
| memberP(sk2,u) ),
inference(ssi,[status(thm)],[3498,202,1,7]),
[iquote('1:SSi:3498.1,3498.0,202.0,1.0,7.0')] ).
cnf(3511,plain,
~ memberP(sk1,sk7),
inference(res,[status(thm),theory(equality)],[3500,15]),
[iquote('1:Res:3500.1,15.0')] ).
cnf(3512,plain,
$false,
inference(mrr,[status(thm)],[3511,14]),
[iquote('1:MRR:3511.0,14.0')] ).
cnf(3513,plain,
( ~ ssList(u)
| duplicatefreeP(u) ),
inference(spt,[spt(split,[position(s2)])],[88]),
[iquote('1:Spt:3512.0,88.0,88.2')] ).
cnf(3529,plain,
( ~ ssList(u)
| ~ ssItem(v)
| ~ ssList(w)
| ~ ssList(x)
| ~ ssList(y)
| ~ equal(app(app(w,cons(v,x)),cons(v,y)),u) ),
inference(mrr,[status(thm)],[195,3513]),
[iquote('1:MRR:195.1,3513.1')] ).
cnf(17189,plain,
( ~ ssList(u)
| ~ ssList(v)
| ~ ssItem(w)
| ~ ssList(cons(w,v))
| ~ ssList(u)
| ssList(cons(w,app(v,u))) ),
inference(spr,[status(thm),theory(equality)],[173,101]),
[iquote('0:SpR:173.3,101.2')] ).
cnf(17216,plain,
( ~ ssList(u)
| ~ ssItem(v)
| ~ ssList(cons(v,u))
| ~ ssList(w)
| ssList(cons(v,app(u,w))) ),
inference(obv,[status(thm),theory(equality)],[17189]),
[iquote('0:Obv:17189.0')] ).
cnf(17217,plain,
( ~ ssList(u)
| ~ ssItem(v)
| ~ ssList(w)
| ssList(cons(v,app(u,w))) ),
inference(ssi,[status(thm)],[17216,102]),
[iquote('0:SSi:17216.2,102.2')] ).
cnf(18246,plain,
( ~ ssList(app(app(u,cons(v,w)),cons(v,x)))
| ~ ssItem(v)
| ~ ssList(u)
| ~ ssList(w)
| ~ ssList(x) ),
inference(eqr,[status(thm),theory(equality)],[3529]),
[iquote('1:EqR:3529.5')] ).
cnf(18272,plain,
( ~ ssItem(u)
| ~ ssList(v)
| ~ ssList(w)
| ~ ssList(x) ),
inference(ssi,[status(thm)],[18246,101,102]),
[iquote('1:SSi:18246.0,101.2,101.2,102.2,102.2')] ).
cnf(18273,plain,
( ~ ssList(u)
| ~ ssItem(v)
| ~ ssList(w) ),
inference(mrr,[status(thm)],[17217,18272]),
[iquote('1:MRR:17217.3,18272.1')] ).
cnf(18276,plain,
( ~ ssList(u)
| ~ ssItem(v) ),
inference(con,[status(thm)],[18273]),
[iquote('1:Con:18273.2')] ).
cnf(18277,plain,
~ ssItem(u),
inference(mrr,[status(thm)],[458,18276]),
[iquote('1:MRR:458.1,18276.0')] ).
cnf(18278,plain,
$false,
inference(unc,[status(thm)],[18277,63]),
[iquote('1:UnC:18277.0,63.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC404-1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.12 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n006.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jun 12 04:08:12 EDT 2022
% 0.13/0.33 % CPUTime :
% 7.24/7.45
% 7.24/7.45 SPASS V 3.9
% 7.24/7.45 SPASS beiseite: Proof found.
% 7.24/7.45 % SZS status Theorem
% 7.24/7.45 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.24/7.45 SPASS derived 12276 clauses, backtracked 5311 clauses, performed 68 splits and kept 10508 clauses.
% 7.24/7.45 SPASS allocated 89172 KBytes.
% 7.24/7.45 SPASS spent 0:00:05.93 on the problem.
% 7.24/7.45 0:00:00.04 for the input.
% 7.24/7.45 0:00:00.00 for the FLOTTER CNF translation.
% 7.24/7.45 0:00:00.11 for inferences.
% 7.24/7.45 0:00:00.16 for the backtracking.
% 7.24/7.45 0:00:05.41 for the reduction.
% 7.24/7.45
% 7.24/7.45
% 7.24/7.45 Here is a proof with depth 3, length 40 :
% 7.24/7.45 % SZS output start Refutation
% See solution above
% 7.24/7.45 Formulae used in the proof : co1_1 co1_5 co1_6 co1_7 co1_8 co1_9 co1_10 co1_14 co1_15 clause47 clause72 clause85 clause86 clause140 clause141 clause157 clause179
% 7.24/7.45
%------------------------------------------------------------------------------