TSTP Solution File: SWC398-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC398-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n026.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:49 EDT 2022
% Result : Unsatisfiable 4.09s 4.29s
% Output : Refutation 4.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 15
% Syntax : Number of clauses : 35 ( 16 unt; 1 nHn; 35 RR)
% Number of literals : 90 ( 0 equ; 63 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 : 14 ( 14 usr; 11 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
ssList(sk1),
file('SWC398-1.p',unknown),
[] ).
cnf(5,axiom,
equal(sk4,sk2),
file('SWC398-1.p',unknown),
[] ).
cnf(6,axiom,
equal(sk3,sk1),
file('SWC398-1.p',unknown),
[] ).
cnf(7,axiom,
ssList(sk5),
file('SWC398-1.p',unknown),
[] ).
cnf(8,axiom,
equal(app(sk3,sk5),sk4),
file('SWC398-1.p',unknown),
[] ).
cnf(9,axiom,
equalelemsP(sk3),
file('SWC398-1.p',unknown),
[] ).
cnf(12,axiom,
memberP(sk1,sk6),
file('SWC398-1.p',unknown),
[] ).
cnf(13,axiom,
~ memberP(sk2,sk6),
file('SWC398-1.p',unknown),
[] ).
cnf(26,axiom,
ssItem(skaf83(u)),
file('SWC398-1.p',unknown),
[] ).
cnf(86,axiom,
( ~ ssList(u)
| ssItem(v)
| duplicatefreeP(u) ),
file('SWC398-1.p',unknown),
[] ).
cnf(99,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ssList(app(u,v)) ),
file('SWC398-1.p',unknown),
[] ).
cnf(100,axiom,
( ~ ssList(u)
| ~ ssItem(v)
| ssList(cons(v,u)) ),
file('SWC398-1.p',unknown),
[] ).
cnf(154,axiom,
( ~ ssItem(u)
| ~ ssList(v)
| ~ ssList(w)
| ~ memberP(v,u)
| memberP(app(v,w),u) ),
file('SWC398-1.p',unknown),
[] ).
cnf(171,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ~ ssItem(w)
| equal(app(cons(w,v),u),cons(w,app(v,u))) ),
file('SWC398-1.p',unknown),
[] ).
cnf(193,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('SWC398-1.p',unknown),
[] ).
cnf(200,plain,
equalelemsP(sk1),
inference(rew,[status(thm),theory(equality)],[6,9]),
[iquote('0:Rew:6.0,9.0')] ).
cnf(203,plain,
equal(app(sk1,sk5),sk2),
inference(rew,[status(thm),theory(equality)],[6,8,5]),
[iquote('0:Rew:6.0,8.0,5.0,8.0')] ).
cnf(451,plain,
( ~ ssItem(u)
| ssList(cons(u,sk5)) ),
inference(res,[status(thm),theory(equality)],[7,100]),
[iquote('0:Res:7.0,100.1')] ).
cnf(488,plain,
ssItem(u),
inference(spt,[spt(split,[position(s1)])],[86]),
[iquote('1:Spt:86.1')] ).
cnf(586,plain,
( ~ ssList(u)
| ~ ssList(v)
| ~ memberP(u,w)
| memberP(app(u,v),w) ),
inference(mrr,[status(thm)],[154,488]),
[iquote('1:MRR:154.0,488.0')] ).
cnf(2330,plain,
( ~ ssList(sk1)
| ~ ssList(sk5)
| ~ memberP(sk1,u)
| memberP(sk2,u) ),
inference(spr,[status(thm),theory(equality)],[203,586]),
[iquote('1:SpR:203.0,586.3')] ).
cnf(3152,plain,
( ~ memberP(sk1,u)
| memberP(sk2,u) ),
inference(ssi,[status(thm)],[2330,7,200,1]),
[iquote('1:SSi:2330.1,2330.0,7.0,200.0,1.0')] ).
cnf(3317,plain,
~ memberP(sk1,sk6),
inference(res,[status(thm),theory(equality)],[3152,13]),
[iquote('1:Res:3152.1,13.0')] ).
cnf(3318,plain,
$false,
inference(mrr,[status(thm)],[3317,12]),
[iquote('1:MRR:3317.0,12.0')] ).
cnf(3319,plain,
( ~ ssList(u)
| duplicatefreeP(u) ),
inference(spt,[spt(split,[position(s2)])],[86]),
[iquote('1:Spt:3318.0,86.0,86.2')] ).
cnf(3334,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)],[193,3319]),
[iquote('1:MRR:193.1,3319.1')] ).
cnf(10425,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)],[171,99]),
[iquote('0:SpR:171.3,99.2')] ).
cnf(10455,plain,
( ~ ssList(u)
| ~ ssItem(v)
| ~ ssList(cons(v,u))
| ~ ssList(w)
| ssList(cons(v,app(u,w))) ),
inference(obv,[status(thm),theory(equality)],[10425]),
[iquote('0:Obv:10425.0')] ).
cnf(10456,plain,
( ~ ssList(u)
| ~ ssItem(v)
| ~ ssList(w)
| ssList(cons(v,app(u,w))) ),
inference(ssi,[status(thm)],[10455,100]),
[iquote('0:SSi:10455.2,100.2')] ).
cnf(11670,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)],[3334]),
[iquote('1:EqR:3334.5')] ).
cnf(11693,plain,
( ~ ssItem(u)
| ~ ssList(v)
| ~ ssList(w)
| ~ ssList(x) ),
inference(ssi,[status(thm)],[11670,99,100]),
[iquote('1:SSi:11670.0,99.2,99.2,100.2,100.2')] ).
cnf(11694,plain,
( ~ ssList(u)
| ~ ssItem(v)
| ~ ssList(w) ),
inference(mrr,[status(thm)],[10456,11693]),
[iquote('1:MRR:10456.3,11693.1')] ).
cnf(11697,plain,
( ~ ssList(u)
| ~ ssItem(v) ),
inference(con,[status(thm)],[11694]),
[iquote('1:Con:11694.2')] ).
cnf(11698,plain,
~ ssItem(u),
inference(mrr,[status(thm)],[451,11697]),
[iquote('1:MRR:451.1,11697.0')] ).
cnf(11699,plain,
$false,
inference(unc,[status(thm)],[11698,26]),
[iquote('1:UnC:11698.0,26.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC398-1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n026.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 : Sun Jun 12 17:32:20 EDT 2022
% 0.13/0.34 % CPUTime :
% 4.09/4.29
% 4.09/4.29 SPASS V 3.9
% 4.09/4.29 SPASS beiseite: Proof found.
% 4.09/4.29 % SZS status Theorem
% 4.09/4.29 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.09/4.29 SPASS derived 7318 clauses, backtracked 3795 clauses, performed 67 splits and kept 7545 clauses.
% 4.09/4.29 SPASS allocated 84668 KBytes.
% 4.09/4.29 SPASS spent 0:00:03.49 on the problem.
% 4.09/4.29 0:00:00.04 for the input.
% 4.09/4.29 0:00:00.00 for the FLOTTER CNF translation.
% 4.09/4.29 0:00:00.07 for inferences.
% 4.09/4.29 0:00:00.09 for the backtracking.
% 4.09/4.29 0:00:03.12 for the reduction.
% 4.09/4.29
% 4.09/4.29
% 4.09/4.29 Here is a proof with depth 2, length 35 :
% 4.09/4.29 % SZS output start Refutation
% See solution above
% 4.09/4.29 Formulae used in the proof : co1_1 co1_5 co1_6 co1_7 co1_8 co1_9 co1_12 co1_13 clause12 clause72 clause85 clause86 clause140 clause157 clause179
% 4.09/4.29
%------------------------------------------------------------------------------