TSTP Solution File: SWC339+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC339+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:25 EDT 2022
% Result : Theorem 33.37s 33.61s
% Output : Refutation 33.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 19 ( 10 unt; 0 nHn; 19 RR)
% Number of literals : 45 ( 0 equ; 30 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
ssList(skc9),
file('SWC339+1.p',unknown),
[] ).
cnf(2,axiom,
ssList(skc8),
file('SWC339+1.p',unknown),
[] ).
cnf(4,axiom,
ssList(skc6),
file('SWC339+1.p',unknown),
[] ).
cnf(5,axiom,
totalorderedP(skc6),
file('SWC339+1.p',unknown),
[] ).
cnf(66,axiom,
( ~ ssList(u)
| segmentP(u,u) ),
file('SWC339+1.p',unknown),
[] ).
cnf(69,axiom,
equal(app(app(skc8,skc6),skc9),skc7),
file('SWC339+1.p',unknown),
[] ).
cnf(71,axiom,
( ~ segmentP(skc7,skc6)
| ~ totalorderedP(skc6) ),
file('SWC339+1.p',unknown),
[] ).
cnf(158,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ~ ssList(w)
| equal(app(app(w,v),u),app(w,app(v,u))) ),
file('SWC339+1.p',unknown),
[] ).
cnf(179,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ~ ssList(w)
| ~ ssList(x)
| ~ segmentP(u,v)
| segmentP(app(app(w,u),x),v) ),
file('SWC339+1.p',unknown),
[] ).
cnf(197,plain,
~ segmentP(skc7,skc6),
inference(mrr,[status(thm)],[71,5]),
[iquote('0:MRR:71.1,5.0')] ).
cnf(201,plain,
( ~ ssList(u)
| ~ ssList(v)
| ~ ssList(w)
| ~ ssList(x)
| ~ segmentP(x,w)
| segmentP(app(v,app(x,u)),w) ),
inference(rew,[status(thm),theory(equality)],[158,179]),
[iquote('0:Rew:158.3,179.5')] ).
cnf(288,plain,
segmentP(skc6,skc6),
inference(res,[status(thm),theory(equality)],[4,66]),
[iquote('0:Res:4.0,66.0')] ).
cnf(4344,plain,
( ~ ssList(skc9)
| ~ ssList(skc6)
| ~ ssList(skc8)
| equal(app(skc8,app(skc6,skc9)),skc7) ),
inference(spr,[status(thm),theory(equality)],[158,69]),
[iquote('0:SpR:158.3,69.0')] ).
cnf(27624,plain,
equal(app(skc8,app(skc6,skc9)),skc7),
inference(ssi,[status(thm)],[4344,2,4,5,1]),
[iquote('0:SSi:4344.2,4344.1,4344.0,2.0,4.0,5.0,1.0')] ).
cnf(27984,plain,
( ~ ssList(skc9)
| ~ ssList(skc8)
| ~ ssList(u)
| ~ ssList(skc6)
| ~ segmentP(skc6,u)
| segmentP(skc7,u) ),
inference(spr,[status(thm),theory(equality)],[27624,201]),
[iquote('0:SpR:27624.0,201.5')] ).
cnf(35692,plain,
( ~ ssList(u)
| ~ segmentP(skc6,u)
| segmentP(skc7,u) ),
inference(ssi,[status(thm)],[27984,4,5,2,1]),
[iquote('0:SSi:27984.3,27984.1,27984.0,4.0,5.0,2.0,1.0')] ).
cnf(37940,plain,
( ~ ssList(skc6)
| ~ segmentP(skc6,skc6) ),
inference(res,[status(thm),theory(equality)],[35692,197]),
[iquote('0:Res:35692.2,197.0')] ).
cnf(37993,plain,
~ segmentP(skc6,skc6),
inference(ssi,[status(thm)],[37940,4,5]),
[iquote('0:SSi:37940.0,4.0,5.0')] ).
cnf(37994,plain,
$false,
inference(mrr,[status(thm)],[37993,288]),
[iquote('0:MRR:37993.0,288.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC339+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n014.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jun 12 05:00:23 EDT 2022
% 0.12/0.34 % CPUTime :
% 33.37/33.61
% 33.37/33.61 SPASS V 3.9
% 33.37/33.61 SPASS beiseite: Proof found.
% 33.37/33.61 % SZS status Theorem
% 33.37/33.61 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 33.37/33.61 SPASS derived 26437 clauses, backtracked 6941 clauses, performed 98 splits and kept 14034 clauses.
% 33.37/33.61 SPASS allocated 127572 KBytes.
% 33.37/33.61 SPASS spent 0:0:27.47 on the problem.
% 33.37/33.61 0:00:00.04 for the input.
% 33.37/33.61 0:00:00.07 for the FLOTTER CNF translation.
% 33.37/33.61 0:00:00.36 for inferences.
% 33.37/33.61 0:00:00.53 for the backtracking.
% 33.37/33.61 0:0:26.13 for the reduction.
% 33.37/33.61
% 33.37/33.61
% 33.37/33.61 Here is a proof with depth 3, length 19 :
% 33.37/33.61 % SZS output start Refutation
% See solution above
% 33.37/33.61 Formulae used in the proof : co1 ax55 ax82 ax56
% 33.37/33.61
%------------------------------------------------------------------------------