TSTP Solution File: SWC189+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC189+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n005.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:02:21 EDT 2022
% Result : Theorem 5.53s 5.82s
% Output : Refutation 5.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 11 ( 8 unt; 0 nHn; 11 RR)
% Number of literals : 25 ( 0 equ; 15 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 10 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
ssList(skc13),
file('SWC189+1.p',unknown),
[] ).
cnf(2,axiom,
ssList(skc12),
file('SWC189+1.p',unknown),
[] ).
cnf(3,axiom,
ssItem(skc11),
file('SWC189+1.p',unknown),
[] ).
cnf(4,axiom,
ssItem(skc10),
file('SWC189+1.p',unknown),
[] ).
cnf(55,axiom,
~ equal(skc11,skc10),
file('SWC189+1.p',unknown),
[] ).
cnf(111,axiom,
equal(app(app(app(skc12,cons(skc10,nil)),cons(skc11,nil)),skc13),skc8),
file('SWC189+1.p',unknown),
[] ).
cnf(188,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ~ ssItem(w)
| ~ ssItem(x)
| ~ equal(app(app(app(v,cons(x,nil)),cons(w,nil)),u),skc8)
| equal(x,w) ),
file('SWC189+1.p',unknown),
[] ).
cnf(12075,plain,
( ~ ssList(skc13)
| ~ ssList(skc12)
| ~ ssItem(skc11)
| ~ ssItem(skc10)
| ~ equal(skc8,skc8)
| equal(skc11,skc10) ),
inference(spl,[status(thm),theory(equality)],[111,188]),
[iquote('0:SpL:111.0,188.4')] ).
cnf(12076,plain,
( ~ ssList(skc13)
| ~ ssList(skc12)
| ~ ssItem(skc11)
| ~ ssItem(skc10)
| equal(skc11,skc10) ),
inference(obv,[status(thm),theory(equality)],[12075]),
[iquote('0:Obv:12075.4')] ).
cnf(12077,plain,
equal(skc11,skc10),
inference(ssi,[status(thm)],[12076,4,3,2,1]),
[iquote('0:SSi:12076.3,12076.2,12076.1,12076.0,4.0,3.0,2.0,1.0')] ).
cnf(12078,plain,
$false,
inference(mrr,[status(thm)],[12077,55]),
[iquote('0:MRR:12077.0,55.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SWC189+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.15 % Command : run_spass %d %s
% 0.07/0.34 % Computer : n005.cluster.edu
% 0.07/0.34 % Model : x86_64 x86_64
% 0.07/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.34 % Memory : 8042.1875MB
% 0.07/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.34 % CPULimit : 300
% 0.07/0.34 % WCLimit : 600
% 0.07/0.34 % DateTime : Sun Jun 12 14:26:09 EDT 2022
% 0.12/0.35 % CPUTime :
% 5.53/5.82
% 5.53/5.82 SPASS V 3.9
% 5.53/5.82 SPASS beiseite: Proof found.
% 5.53/5.82 % SZS status Theorem
% 5.53/5.82 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.53/5.82 SPASS derived 8563 clauses, backtracked 1989 clauses, performed 50 splits and kept 5932 clauses.
% 5.53/5.82 SPASS allocated 107143 KBytes.
% 5.53/5.82 SPASS spent 0:00:05.04 on the problem.
% 5.53/5.82 0:00:00.02 for the input.
% 5.53/5.82 0:00:00.04 for the FLOTTER CNF translation.
% 5.53/5.82 0:00:00.11 for inferences.
% 5.53/5.82 0:00:00.10 for the backtracking.
% 5.53/5.82 0:00:04.56 for the reduction.
% 5.53/5.82
% 5.53/5.82
% 5.53/5.82 Here is a proof with depth 1, length 11 :
% 5.53/5.82 % SZS output start Refutation
% See solution above
% 5.53/5.82 Formulae used in the proof : co1
% 5.53/5.82
%------------------------------------------------------------------------------