TSTP Solution File: SWC082+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC082+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n022.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:01:35 EDT 2022
% Result : Theorem 0.69s 0.90s
% Output : Refutation 0.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 12 ( 6 unt; 0 nHn; 12 RR)
% Number of literals : 21 ( 0 equ; 12 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
ssList(skc7),
file('SWC082+1.p',unknown),
[] ).
cnf(14,axiom,
neq(skc6,nil),
file('SWC082+1.p',unknown),
[] ).
cnf(69,axiom,
( ~ neq(skc6,nil)
| neq(skc7,nil) ),
file('SWC082+1.p',unknown),
[] ).
cnf(70,axiom,
( ~ neq(skc6,nil)
| segmentP(skc6,skc7) ),
file('SWC082+1.p',unknown),
[] ).
cnf(71,axiom,
( ~ neq(skc6,nil)
| segmentP(skc5,skc7) ),
file('SWC082+1.p',unknown),
[] ).
cnf(127,axiom,
( ~ ssList(u)
| ~ neq(u,nil)
| ~ segmentP(skc5,u)
| ~ segmentP(skc6,u) ),
file('SWC082+1.p',unknown),
[] ).
cnf(196,plain,
segmentP(skc5,skc7),
inference(mrr,[status(thm)],[71,14]),
[iquote('0:MRR:71.0,14.0')] ).
cnf(197,plain,
segmentP(skc6,skc7),
inference(mrr,[status(thm)],[70,14]),
[iquote('0:MRR:70.0,14.0')] ).
cnf(198,plain,
neq(skc7,nil),
inference(mrr,[status(thm)],[69,14]),
[iquote('0:MRR:69.0,14.0')] ).
cnf(1900,plain,
( ~ ssList(skc7)
| ~ neq(skc7,nil)
| ~ segmentP(skc5,skc7) ),
inference(res,[status(thm),theory(equality)],[197,127]),
[iquote('0:Res:197.0,127.3')] ).
cnf(1902,plain,
( ~ neq(skc7,nil)
| ~ segmentP(skc5,skc7) ),
inference(ssi,[status(thm)],[1900,1]),
[iquote('0:SSi:1900.0,1.0')] ).
cnf(1903,plain,
$false,
inference(mrr,[status(thm)],[1902,198,196]),
[iquote('0:MRR:1902.0,1902.1,198.0,196.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWC082+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n022.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.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jun 12 04:40:03 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.69/0.90
% 0.69/0.90 SPASS V 3.9
% 0.69/0.90 SPASS beiseite: Proof found.
% 0.69/0.90 % SZS status Theorem
% 0.69/0.90 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.69/0.90 SPASS derived 1385 clauses, backtracked 233 clauses, performed 22 splits and kept 1178 clauses.
% 0.69/0.90 SPASS allocated 99413 KBytes.
% 0.69/0.90 SPASS spent 0:00:00.55 on the problem.
% 0.69/0.90 0:00:00.04 for the input.
% 0.69/0.90 0:00:00.07 for the FLOTTER CNF translation.
% 0.69/0.90 0:00:00.01 for inferences.
% 0.69/0.90 0:00:00.01 for the backtracking.
% 0.69/0.90 0:00:00.26 for the reduction.
% 0.69/0.90
% 0.69/0.90
% 0.69/0.90 Here is a proof with depth 1, length 12 :
% 0.69/0.90 % SZS output start Refutation
% See solution above
% 0.69/0.90 Formulae used in the proof : co1 ax17
% 0.69/0.90
%------------------------------------------------------------------------------