TSTP Solution File: SWC116+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC116+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n032.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:50 EDT 2022
% Result : Theorem 0.57s 0.76s
% Output : Refutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 18
% Syntax : Number of clauses : 51 ( 34 unt; 5 nHn; 51 RR)
% Number of literals : 83 ( 0 equ; 36 neg)
% Maximal clause size : 7 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 12 ( 11 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
ssList(skc5),
file('SWC116+1.p',unknown),
[] ).
cnf(2,axiom,
ssList(skc4),
file('SWC116+1.p',unknown),
[] ).
cnf(5,axiom,
ssList(nil),
file('SWC116+1.p',unknown),
[] ).
cnf(6,axiom,
cyclefreeP(nil),
file('SWC116+1.p',unknown),
[] ).
cnf(7,axiom,
totalorderP(nil),
file('SWC116+1.p',unknown),
[] ).
cnf(8,axiom,
strictorderP(nil),
file('SWC116+1.p',unknown),
[] ).
cnf(9,axiom,
totalorderedP(nil),
file('SWC116+1.p',unknown),
[] ).
cnf(10,axiom,
strictorderedP(nil),
file('SWC116+1.p',unknown),
[] ).
cnf(11,axiom,
duplicatefreeP(nil),
file('SWC116+1.p',unknown),
[] ).
cnf(12,axiom,
equalelemsP(nil),
file('SWC116+1.p',unknown),
[] ).
cnf(64,axiom,
( ~ ssList(u)
| segmentP(u,nil) ),
file('SWC116+1.p',unknown),
[] ).
cnf(66,axiom,
( ~ equal(skc5,nil)
| equal(nil,skc4) ),
file('SWC116+1.p',unknown),
[] ).
cnf(67,axiom,
( ~ neq(skc5,nil)
| neq(skc4,nil) ),
file('SWC116+1.p',unknown),
[] ).
cnf(68,axiom,
( ~ neq(skc5,nil)
| segmentP(skc5,skc4) ),
file('SWC116+1.p',unknown),
[] ).
cnf(78,axiom,
( ~ equal(skc5,nil)
| ~ equal(nil,skc4) ),
file('SWC116+1.p',unknown),
[] ).
cnf(79,axiom,
( ~ segmentP(skc5,skc4)
| ~ neq(skc4,nil) ),
file('SWC116+1.p',unknown),
[] ).
cnf(106,axiom,
( ~ ssList(u)
| ~ ssList(v)
| neq(v,u)
| equal(v,u) ),
file('SWC116+1.p',unknown),
[] ).
cnf(185,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ~ equal(tl(u),tl(v))
| ~ equal(hd(u),hd(v))
| equal(u,v)
| equal(nil,v)
| equal(nil,u) ),
file('SWC116+1.p',unknown),
[] ).
cnf(194,plain,
( ~ equal(skc5,nil)
| ~ equal(skc4,skc4) ),
inference(rew,[status(thm),theory(equality)],[66,78]),
[iquote('0:Rew:66.1,78.1')] ).
cnf(195,plain,
~ equal(skc5,nil),
inference(obv,[status(thm),theory(equality)],[194]),
[iquote('0:Obv:194.1')] ).
cnf(284,plain,
( ~ ssList(u)
| ~ equal(tl(skc4),tl(u))
| ~ equal(hd(skc4),hd(u))
| equal(nil,u)
| equal(skc4,u)
| equal(nil,skc4) ),
inference(res,[status(thm),theory(equality)],[2,185]),
[iquote('0:Res:2.0,185.1')] ).
cnf(422,plain,
( ~ ssList(u)
| neq(skc5,u)
| equal(skc5,u) ),
inference(res,[status(thm),theory(equality)],[1,106]),
[iquote('0:Res:1.0,106.0')] ).
cnf(454,plain,
segmentP(skc5,nil),
inference(res,[status(thm),theory(equality)],[1,64]),
[iquote('0:Res:1.0,64.0')] ).
cnf(565,plain,
equal(nil,skc4),
inference(spt,[spt(split,[position(s1)])],[284]),
[iquote('1:Spt:284.5')] ).
cnf(578,plain,
( ~ neq(skc5,skc4)
| neq(skc4,nil) ),
inference(rew,[status(thm),theory(equality)],[565,67]),
[iquote('1:Rew:565.0,67.0')] ).
cnf(580,plain,
( ~ segmentP(skc5,skc4)
| ~ neq(skc4,skc4) ),
inference(rew,[status(thm),theory(equality)],[565,79]),
[iquote('1:Rew:565.0,79.1')] ).
cnf(618,plain,
equalelemsP(skc4),
inference(rew,[status(thm),theory(equality)],[565,12]),
[iquote('1:Rew:565.0,12.0')] ).
cnf(619,plain,
duplicatefreeP(skc4),
inference(rew,[status(thm),theory(equality)],[565,11]),
[iquote('1:Rew:565.0,11.0')] ).
cnf(620,plain,
strictorderedP(skc4),
inference(rew,[status(thm),theory(equality)],[565,10]),
[iquote('1:Rew:565.0,10.0')] ).
cnf(621,plain,
totalorderedP(skc4),
inference(rew,[status(thm),theory(equality)],[565,9]),
[iquote('1:Rew:565.0,9.0')] ).
cnf(622,plain,
strictorderP(skc4),
inference(rew,[status(thm),theory(equality)],[565,8]),
[iquote('1:Rew:565.0,8.0')] ).
cnf(623,plain,
totalorderP(skc4),
inference(rew,[status(thm),theory(equality)],[565,7]),
[iquote('1:Rew:565.0,7.0')] ).
cnf(624,plain,
cyclefreeP(skc4),
inference(rew,[status(thm),theory(equality)],[565,6]),
[iquote('1:Rew:565.0,6.0')] ).
cnf(626,plain,
segmentP(skc5,skc4),
inference(rew,[status(thm),theory(equality)],[565,454]),
[iquote('1:Rew:565.0,454.0')] ).
cnf(636,plain,
~ equal(skc5,skc4),
inference(rew,[status(thm),theory(equality)],[565,195]),
[iquote('1:Rew:565.0,195.0')] ).
cnf(677,plain,
( ~ neq(skc5,skc4)
| neq(skc4,skc4) ),
inference(rew,[status(thm),theory(equality)],[565,578]),
[iquote('1:Rew:565.0,578.1')] ).
cnf(688,plain,
~ neq(skc4,skc4),
inference(mrr,[status(thm)],[580,626]),
[iquote('1:MRR:580.0,626.0')] ).
cnf(689,plain,
~ neq(skc5,skc4),
inference(mrr,[status(thm)],[677,688]),
[iquote('1:MRR:677.1,688.0')] ).
cnf(957,plain,
( ~ ssList(skc4)
| equal(skc5,skc4) ),
inference(res,[status(thm),theory(equality)],[422,689]),
[iquote('1:Res:422.1,689.0')] ).
cnf(958,plain,
equal(skc5,skc4),
inference(ssi,[status(thm)],[957,2,618,619,620,621,622,623,624]),
[iquote('1:SSi:957.0,2.0,618.0,619.0,620.0,621.0,622.0,623.0,624.0')] ).
cnf(959,plain,
$false,
inference(mrr,[status(thm)],[958,636]),
[iquote('1:MRR:958.0,636.0')] ).
cnf(960,plain,
~ equal(nil,skc4),
inference(spt,[spt(split,[position(sa)])],[959,565]),
[iquote('1:Spt:959.0,284.5,565.0')] ).
cnf(961,plain,
( ~ ssList(u)
| ~ equal(tl(skc4),tl(u))
| ~ equal(hd(skc4),hd(u))
| equal(nil,u)
| equal(skc4,u) ),
inference(spt,[spt(split,[position(s2)])],[284]),
[iquote('1:Spt:959.0,284.0,284.1,284.2,284.3,284.4')] ).
cnf(1019,plain,
~ neq(skc5,nil),
inference(spt,[spt(split,[position(s2s1)])],[68]),
[iquote('2:Spt:68.0')] ).
cnf(1020,plain,
( ~ ssList(nil)
| equal(skc5,nil) ),
inference(res,[status(thm),theory(equality)],[422,1019]),
[iquote('2:Res:422.1,1019.0')] ).
cnf(1021,plain,
equal(skc5,nil),
inference(ssi,[status(thm)],[1020,5,6,7,8,9,10,11,12]),
[iquote('2:SSi:1020.0,5.0,6.0,7.0,8.0,9.0,10.0,11.0,12.0')] ).
cnf(1022,plain,
$false,
inference(mrr,[status(thm)],[1021,195]),
[iquote('2:MRR:1021.0,195.0')] ).
cnf(1023,plain,
neq(skc5,nil),
inference(spt,[spt(split,[position(s2sa)])],[1022,1019]),
[iquote('2:Spt:1022.0,68.0,1019.0')] ).
cnf(1024,plain,
segmentP(skc5,skc4),
inference(spt,[spt(split,[position(s2s2)])],[68]),
[iquote('2:Spt:1022.0,68.1')] ).
cnf(1025,plain,
~ neq(skc4,nil),
inference(mrr,[status(thm)],[79,1024]),
[iquote('2:MRR:79.0,1024.0')] ).
cnf(1026,plain,
$false,
inference(mrr,[status(thm)],[67,1023,1025]),
[iquote('2:MRR:67.0,67.1,1023.0,1025.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : SWC116+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.10 % Command : run_spass %d %s
% 0.09/0.30 % Computer : n032.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 600
% 0.09/0.30 % DateTime : Sun Jun 12 07:45:40 EDT 2022
% 0.09/0.30 % CPUTime :
% 0.57/0.76
% 0.57/0.76 SPASS V 3.9
% 0.57/0.76 SPASS beiseite: Proof found.
% 0.57/0.76 % SZS status Theorem
% 0.57/0.76 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.57/0.76 SPASS derived 732 clauses, backtracked 234 clauses, performed 21 splits and kept 969 clauses.
% 0.57/0.76 SPASS allocated 98691 KBytes.
% 0.57/0.76 SPASS spent 0:00:00.45 on the problem.
% 0.57/0.76 0:00:00.03 for the input.
% 0.57/0.76 0:00:00.04 for the FLOTTER CNF translation.
% 0.57/0.76 0:00:00.00 for inferences.
% 0.57/0.76 0:00:00.00 for the backtracking.
% 0.57/0.76 0:00:00.20 for the reduction.
% 0.57/0.76
% 0.57/0.76
% 0.57/0.76 Here is a proof with depth 2, length 51 :
% 0.57/0.76 % SZS output start Refutation
% See solution above
% 0.57/0.76 Formulae used in the proof : co1 ax17 ax60 ax62 ax64 ax66 ax69 ax72 ax74 ax57 ax15 ax77
% 0.57/0.76
%------------------------------------------------------------------------------