TSTP Solution File: SWC037+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC037+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n011.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:16 EDT 2022
% Result : Theorem 0.38s 0.63s
% Output : Refutation 0.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 16
% Syntax : Number of clauses : 39 ( 25 unt; 7 nHn; 39 RR)
% Number of literals : 60 ( 0 equ; 20 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 13 ( 12 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
ssList(skc5),
file('SWC037+1.p',unknown),
[] ).
cnf(6,axiom,
cyclefreeP(nil),
file('SWC037+1.p',unknown),
[] ).
cnf(7,axiom,
totalorderP(nil),
file('SWC037+1.p',unknown),
[] ).
cnf(8,axiom,
strictorderP(nil),
file('SWC037+1.p',unknown),
[] ).
cnf(9,axiom,
totalorderedP(nil),
file('SWC037+1.p',unknown),
[] ).
cnf(10,axiom,
strictorderedP(nil),
file('SWC037+1.p',unknown),
[] ).
cnf(11,axiom,
duplicatefreeP(nil),
file('SWC037+1.p',unknown),
[] ).
cnf(12,axiom,
equalelemsP(nil),
file('SWC037+1.p',unknown),
[] ).
cnf(13,axiom,
equal(nil,skc5),
file('SWC037+1.p',unknown),
[] ).
cnf(52,axiom,
ssList(skf44(u,v)),
file('SWC037+1.p',unknown),
[] ).
cnf(53,axiom,
~ equal(nil,skc4),
file('SWC037+1.p',unknown),
[] ).
cnf(69,axiom,
( ~ skP0(skc4,skc5)
| equal(nil,skc4) ),
file('SWC037+1.p',unknown),
[] ).
cnf(79,axiom,
( neq(skf44(u,v),nil)
| skP0(u,v) ),
file('SWC037+1.p',unknown),
[] ).
cnf(80,axiom,
( skP0(u,v)
| segmentP(v,skf44(u,v)) ),
file('SWC037+1.p',unknown),
[] ).
cnf(97,axiom,
( ~ ssList(u)
| ~ segmentP(nil,u)
| equal(nil,u) ),
file('SWC037+1.p',unknown),
[] ).
cnf(122,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ~ equal(v,u)
| ~ neq(v,u) ),
file('SWC037+1.p',unknown),
[] ).
cnf(196,plain,
equalelemsP(skc5),
inference(rew,[status(thm),theory(equality)],[13,12]),
[iquote('0:Rew:13.0,12.0')] ).
cnf(197,plain,
duplicatefreeP(skc5),
inference(rew,[status(thm),theory(equality)],[13,11]),
[iquote('0:Rew:13.0,11.0')] ).
cnf(198,plain,
strictorderedP(skc5),
inference(rew,[status(thm),theory(equality)],[13,10]),
[iquote('0:Rew:13.0,10.0')] ).
cnf(199,plain,
totalorderedP(skc5),
inference(rew,[status(thm),theory(equality)],[13,9]),
[iquote('0:Rew:13.0,9.0')] ).
cnf(200,plain,
strictorderP(skc5),
inference(rew,[status(thm),theory(equality)],[13,8]),
[iquote('0:Rew:13.0,8.0')] ).
cnf(201,plain,
totalorderP(skc5),
inference(rew,[status(thm),theory(equality)],[13,7]),
[iquote('0:Rew:13.0,7.0')] ).
cnf(202,plain,
cyclefreeP(skc5),
inference(rew,[status(thm),theory(equality)],[13,6]),
[iquote('0:Rew:13.0,6.0')] ).
cnf(205,plain,
~ equal(skc5,skc4),
inference(rew,[status(thm),theory(equality)],[13,53]),
[iquote('0:Rew:13.0,53.0')] ).
cnf(217,plain,
( ~ skP0(skc4,skc5)
| equal(skc5,skc4) ),
inference(rew,[status(thm),theory(equality)],[13,69]),
[iquote('0:Rew:13.0,69.1')] ).
cnf(218,plain,
~ skP0(skc4,skc5),
inference(mrr,[status(thm)],[217,205]),
[iquote('0:MRR:217.1,205.0')] ).
cnf(221,plain,
( skP0(u,v)
| neq(skf44(u,v),skc5) ),
inference(rew,[status(thm),theory(equality)],[13,79]),
[iquote('0:Rew:13.0,79.0')] ).
cnf(227,plain,
( ~ ssList(u)
| ~ segmentP(skc5,u)
| equal(skc5,u) ),
inference(rew,[status(thm),theory(equality)],[13,97]),
[iquote('0:Rew:13.0,97.2,13.0,97.1')] ).
cnf(474,plain,
( ~ ssList(u)
| ~ equal(skc5,u)
| ~ neq(skc5,u) ),
inference(res,[status(thm),theory(equality)],[1,122]),
[iquote('0:Res:1.0,122.0')] ).
cnf(718,plain,
( ~ ssList(skf44(u,skc5))
| skP0(u,skc5)
| equal(skf44(u,skc5),skc5) ),
inference(res,[status(thm),theory(equality)],[80,227]),
[iquote('0:Res:80.1,227.1')] ).
cnf(721,plain,
( skP0(u,skc5)
| equal(skf44(u,skc5),skc5) ),
inference(ssi,[status(thm)],[718,52,196,197,200,201,202,198,199,1]),
[iquote('0:SSi:718.0,52.0,196.0,197.0,200.0,201.0,202.0,198.0,199.0,1.0')] ).
cnf(732,plain,
( skP0(u,skc5)
| skP0(u,skc5)
| neq(skc5,skc5) ),
inference(spr,[status(thm),theory(equality)],[721,221]),
[iquote('0:SpR:721.1,221.1')] ).
cnf(736,plain,
( skP0(u,skc5)
| neq(skc5,skc5) ),
inference(obv,[status(thm),theory(equality)],[732]),
[iquote('0:Obv:732.0')] ).
cnf(739,plain,
skP0(u,skc5),
inference(spt,[spt(split,[position(s1)])],[736]),
[iquote('1:Spt:736.0')] ).
cnf(740,plain,
$false,
inference(unc,[status(thm)],[739,218]),
[iquote('1:UnC:739.0,218.0')] ).
cnf(741,plain,
neq(skc5,skc5),
inference(spt,[spt(split,[position(s2)])],[736]),
[iquote('1:Spt:740.0,736.1')] ).
cnf(817,plain,
( ~ ssList(skc5)
| ~ equal(skc5,skc5) ),
inference(res,[status(thm),theory(equality)],[741,474]),
[iquote('1:Res:741.0,474.2')] ).
cnf(820,plain,
~ ssList(skc5),
inference(obv,[status(thm),theory(equality)],[817]),
[iquote('1:Obv:817.1')] ).
cnf(821,plain,
$false,
inference(ssi,[status(thm)],[820,196,197,200,201,202,198,199,1]),
[iquote('1:SSi:820.0,196.0,197.0,200.0,201.0,202.0,198.0,199.0,1.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC037+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n011.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat Jun 11 21:10:32 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.38/0.63
% 0.38/0.63 SPASS V 3.9
% 0.38/0.63 SPASS beiseite: Proof found.
% 0.38/0.63 % SZS status Theorem
% 0.38/0.63 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.38/0.63 SPASS derived 488 clauses, backtracked 1 clauses, performed 8 splits and kept 463 clauses.
% 0.38/0.63 SPASS allocated 98526 KBytes.
% 0.38/0.63 SPASS spent 0:00:00.27 on the problem.
% 0.38/0.63 0:00:00.04 for the input.
% 0.38/0.63 0:00:00.07 for the FLOTTER CNF translation.
% 0.38/0.63 0:00:00.00 for inferences.
% 0.38/0.63 0:00:00.00 for the backtracking.
% 0.38/0.63 0:00:00.03 for the reduction.
% 0.38/0.63
% 0.38/0.63
% 0.38/0.63 Here is a proof with depth 4, length 39 :
% 0.38/0.63 % SZS output start Refutation
% See solution above
% 0.38/0.63 Formulae used in the proof : co1 ax17 ax60 ax62 ax64 ax66 ax69 ax72 ax74 ax58 ax15
% 0.38/0.63
%------------------------------------------------------------------------------