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 : n013.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 : Theorem 7.18s 7.39s
% Output : Refutation 7.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 13 ( 9 unt; 0 nHn; 13 RR)
% Number of literals : 24 ( 0 equ; 14 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
ssItem(skc9),
file('SWC398+1.p',unknown),
[] ).
cnf(2,axiom,
ssList(skc8),
file('SWC398+1.p',unknown),
[] ).
cnf(4,axiom,
ssList(skc6),
file('SWC398+1.p',unknown),
[] ).
cnf(5,axiom,
equalelemsP(skc6),
file('SWC398+1.p',unknown),
[] ).
cnf(16,axiom,
memberP(skc6,skc9),
file('SWC398+1.p',unknown),
[] ).
cnf(55,axiom,
~ memberP(skc7,skc9),
file('SWC398+1.p',unknown),
[] ).
cnf(63,axiom,
equal(app(skc6,skc8),skc7),
file('SWC398+1.p',unknown),
[] ).
cnf(146,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ~ ssItem(w)
| ~ memberP(v,w)
| memberP(app(v,u),w) ),
file('SWC398+1.p',unknown),
[] ).
cnf(3392,plain,
( ~ ssList(skc8)
| ~ ssList(skc6)
| ~ ssItem(u)
| ~ memberP(skc6,u)
| memberP(skc7,u) ),
inference(spr,[status(thm),theory(equality)],[63,146]),
[iquote('0:SpR:63.0,146.4')] ).
cnf(11208,plain,
( ~ ssItem(u)
| ~ memberP(skc6,u)
| memberP(skc7,u) ),
inference(ssi,[status(thm)],[3392,4,5,2]),
[iquote('0:SSi:3392.1,3392.0,4.0,5.0,2.0')] ).
cnf(11977,plain,
( ~ ssItem(skc9)
| ~ memberP(skc6,skc9) ),
inference(res,[status(thm),theory(equality)],[11208,55]),
[iquote('0:Res:11208.2,55.0')] ).
cnf(11978,plain,
~ memberP(skc6,skc9),
inference(ssi,[status(thm)],[11977,1]),
[iquote('0:SSi:11977.0,1.0')] ).
cnf(11979,plain,
$false,
inference(mrr,[status(thm)],[11978,16]),
[iquote('0:MRR:11978.0,16.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : SWC398+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.11 % Command : run_spass %d %s
% 0.10/0.32 % Computer : n013.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 600
% 0.10/0.32 % DateTime : Sat Jun 11 22:34:14 EDT 2022
% 0.10/0.32 % CPUTime :
% 7.18/7.39
% 7.18/7.39 SPASS V 3.9
% 7.18/7.39 SPASS beiseite: Proof found.
% 7.18/7.39 % SZS status Theorem
% 7.18/7.39 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.18/7.39 SPASS derived 7831 clauses, backtracked 2589 clauses, performed 73 splits and kept 4921 clauses.
% 7.18/7.39 SPASS allocated 108023 KBytes.
% 7.18/7.39 SPASS spent 0:00:06.62 on the problem.
% 7.18/7.39 0:00:00.04 for the input.
% 7.18/7.39 0:00:00.07 for the FLOTTER CNF translation.
% 7.18/7.39 0:00:00.10 for inferences.
% 7.18/7.39 0:00:00.09 for the backtracking.
% 7.18/7.39 0:00:06.11 for the reduction.
% 7.18/7.39
% 7.18/7.39
% 7.18/7.39 Here is a proof with depth 2, length 13 :
% 7.18/7.39 % SZS output start Refutation
% See solution above
% 7.18/7.39 Formulae used in the proof : co1 ax36
% 7.18/7.39
%------------------------------------------------------------------------------