TSTP Solution File: SWC353+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC353+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n014.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:31 EDT 2022
% Result : Theorem 6.14s 6.39s
% Output : Refutation 6.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 13 ( 8 unt; 0 nHn; 13 RR)
% Number of literals : 25 ( 0 equ; 15 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
ssList(skc7),
file('SWC353+1.p',unknown),
[] ).
cnf(3,axiom,
ssList(skc5),
file('SWC353+1.p',unknown),
[] ).
cnf(4,axiom,
totalorderedP(skc5),
file('SWC353+1.p',unknown),
[] ).
cnf(53,axiom,
~ frontsegP(skc6,skc5),
file('SWC353+1.p',unknown),
[] ).
cnf(61,axiom,
equal(app(skc5,skc7),skc6),
file('SWC353+1.p',unknown),
[] ).
cnf(63,axiom,
( ~ ssList(u)
| frontsegP(u,u) ),
file('SWC353+1.p',unknown),
[] ).
cnf(148,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ~ ssList(w)
| ~ frontsegP(w,v)
| frontsegP(app(w,u),v) ),
file('SWC353+1.p',unknown),
[] ).
cnf(280,plain,
frontsegP(skc5,skc5),
inference(res,[status(thm),theory(equality)],[3,63]),
[iquote('0:Res:3.0,63.0')] ).
cnf(3033,plain,
( ~ ssList(skc7)
| ~ ssList(u)
| ~ ssList(skc5)
| ~ frontsegP(skc5,u)
| frontsegP(skc6,u) ),
inference(spr,[status(thm),theory(equality)],[61,148]),
[iquote('0:SpR:61.0,148.4')] ).
cnf(9324,plain,
( ~ ssList(u)
| ~ frontsegP(skc5,u)
| frontsegP(skc6,u) ),
inference(ssi,[status(thm)],[3033,4,3,1]),
[iquote('0:SSi:3033.2,3033.0,4.0,3.0,1.0')] ).
cnf(10156,plain,
( ~ ssList(skc5)
| ~ frontsegP(skc5,skc5) ),
inference(res,[status(thm),theory(equality)],[9324,53]),
[iquote('0:Res:9324.2,53.0')] ).
cnf(10310,plain,
~ frontsegP(skc5,skc5),
inference(ssi,[status(thm)],[10156,4,3]),
[iquote('0:SSi:10156.0,4.0,3.0')] ).
cnf(10311,plain,
$false,
inference(mrr,[status(thm)],[10310,280]),
[iquote('0:MRR:10310.0,280.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC353+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.13 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n014.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 : Sat Jun 11 20:12:38 EDT 2022
% 0.13/0.34 % CPUTime :
% 6.14/6.39
% 6.14/6.39 SPASS V 3.9
% 6.14/6.39 SPASS beiseite: Proof found.
% 6.14/6.39 % SZS status Theorem
% 6.14/6.39 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.14/6.39 SPASS derived 6444 clauses, backtracked 2252 clauses, performed 51 splits and kept 4222 clauses.
% 6.14/6.39 SPASS allocated 106860 KBytes.
% 6.14/6.39 SPASS spent 0:00:05.74 on the problem.
% 6.14/6.39 0:00:00.04 for the input.
% 6.14/6.39 0:00:00.07 for the FLOTTER CNF translation.
% 6.14/6.39 0:00:00.08 for inferences.
% 6.14/6.39 0:00:00.07 for the backtracking.
% 6.14/6.39 0:00:05.28 for the reduction.
% 6.14/6.39
% 6.14/6.39
% 6.14/6.39 Here is a proof with depth 2, length 13 :
% 6.14/6.39 % SZS output start Refutation
% See solution above
% 6.14/6.39 Formulae used in the proof : co1 ax42 ax43
% 6.14/6.39
%------------------------------------------------------------------------------