TSTP Solution File: SWC351+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC351+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n021.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:30 EDT 2022
% Result : Theorem 6.47s 6.65s
% Output : Refutation 6.47s
% 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('SWC351+1.p',unknown),
[] ).
cnf(3,axiom,
ssList(skc5),
file('SWC351+1.p',unknown),
[] ).
cnf(4,axiom,
strictorderedP(skc5),
file('SWC351+1.p',unknown),
[] ).
cnf(54,axiom,
~ frontsegP(skc6,skc5),
file('SWC351+1.p',unknown),
[] ).
cnf(62,axiom,
equal(app(skc5,skc7),skc6),
file('SWC351+1.p',unknown),
[] ).
cnf(64,axiom,
( ~ ssList(u)
| frontsegP(u,u) ),
file('SWC351+1.p',unknown),
[] ).
cnf(149,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ~ ssList(w)
| ~ frontsegP(w,v)
| frontsegP(app(w,u),v) ),
file('SWC351+1.p',unknown),
[] ).
cnf(281,plain,
frontsegP(skc5,skc5),
inference(res,[status(thm),theory(equality)],[3,64]),
[iquote('0:Res:3.0,64.0')] ).
cnf(3154,plain,
( ~ ssList(skc7)
| ~ ssList(u)
| ~ ssList(skc5)
| ~ frontsegP(skc5,u)
| frontsegP(skc6,u) ),
inference(spr,[status(thm),theory(equality)],[62,149]),
[iquote('0:SpR:62.0,149.4')] ).
cnf(9203,plain,
( ~ ssList(u)
| ~ frontsegP(skc5,u)
| frontsegP(skc6,u) ),
inference(ssi,[status(thm)],[3154,4,3,1]),
[iquote('0:SSi:3154.2,3154.0,4.0,3.0,1.0')] ).
cnf(10044,plain,
( ~ ssList(skc5)
| ~ frontsegP(skc5,skc5) ),
inference(res,[status(thm),theory(equality)],[9203,54]),
[iquote('0:Res:9203.2,54.0')] ).
cnf(10168,plain,
~ frontsegP(skc5,skc5),
inference(ssi,[status(thm)],[10044,4,3]),
[iquote('0:SSi:10044.0,4.0,3.0')] ).
cnf(10169,plain,
$false,
inference(mrr,[status(thm)],[10168,281]),
[iquote('0:MRR:10168.0,281.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.13 % Problem : SWC351+1 : TPTP v8.1.0. Released v2.4.0.
% 0.05/0.14 % Command : run_spass %d %s
% 0.14/0.36 % Computer : n021.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Sun Jun 12 20:07:56 EDT 2022
% 0.14/0.36 % CPUTime :
% 6.47/6.65
% 6.47/6.65 SPASS V 3.9
% 6.47/6.65 SPASS beiseite: Proof found.
% 6.47/6.65 % SZS status Theorem
% 6.47/6.65 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.47/6.65 SPASS derived 6326 clauses, backtracked 2109 clauses, performed 50 splits and kept 4193 clauses.
% 6.47/6.65 SPASS allocated 106761 KBytes.
% 6.47/6.65 SPASS spent 0:00:05.97 on the problem.
% 6.47/6.65 0:00:00.04 for the input.
% 6.47/6.65 0:00:00.07 for the FLOTTER CNF translation.
% 6.47/6.65 0:00:00.09 for inferences.
% 6.47/6.65 0:00:00.08 for the backtracking.
% 6.47/6.65 0:00:05.49 for the reduction.
% 6.47/6.65
% 6.47/6.65
% 6.47/6.65 Here is a proof with depth 2, length 13 :
% 6.47/6.65 % SZS output start Refutation
% See solution above
% 6.47/6.65 Formulae used in the proof : co1 ax42 ax43
% 6.47/6.65
%------------------------------------------------------------------------------