TSTP Solution File: SWC205+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC205+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n010.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:02:28 EDT 2022
% Result : Theorem 0.72s 0.88s
% Output : Refutation 0.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 14
% Syntax : Number of clauses : 29 ( 20 unt; 5 nHn; 29 RR)
% Number of literals : 53 ( 0 equ; 20 neg)
% Maximal clause size : 7 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 11 ( 10 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(2,axiom,
ssList(skc4),
file('SWC205+1.p',unknown),
[] ).
cnf(5,axiom,
ssList(nil),
file('SWC205+1.p',unknown),
[] ).
cnf(6,axiom,
cyclefreeP(nil),
file('SWC205+1.p',unknown),
[] ).
cnf(7,axiom,
totalorderP(nil),
file('SWC205+1.p',unknown),
[] ).
cnf(8,axiom,
strictorderP(nil),
file('SWC205+1.p',unknown),
[] ).
cnf(9,axiom,
totalorderedP(nil),
file('SWC205+1.p',unknown),
[] ).
cnf(10,axiom,
strictorderedP(nil),
file('SWC205+1.p',unknown),
[] ).
cnf(11,axiom,
duplicatefreeP(nil),
file('SWC205+1.p',unknown),
[] ).
cnf(12,axiom,
equalelemsP(nil),
file('SWC205+1.p',unknown),
[] ).
cnf(13,axiom,
neq(skc5,nil),
file('SWC205+1.p',unknown),
[] ).
cnf(52,axiom,
~ neq(skc4,nil),
file('SWC205+1.p',unknown),
[] ).
cnf(68,axiom,
( ~ equal(nil,skc4)
| equal(nil,skc5) ),
file('SWC205+1.p',unknown),
[] ).
cnf(105,axiom,
( ~ ssList(u)
| ~ ssList(v)
| neq(v,u)
| equal(v,u) ),
file('SWC205+1.p',unknown),
[] ).
cnf(184,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('SWC205+1.p',unknown),
[] ).
cnf(248,plain,
( ~ ssList(u)
| neq(skc4,u)
| equal(skc4,u) ),
inference(res,[status(thm),theory(equality)],[2,105]),
[iquote('0:Res:2.0,105.0')] ).
cnf(281,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,184]),
[iquote('0:Res:2.0,184.1')] ).
cnf(562,plain,
equal(nil,skc4),
inference(spt,[spt(split,[position(s1)])],[281]),
[iquote('1:Spt:281.5')] ).
cnf(588,plain,
( ~ equal(nil,skc4)
| equal(skc5,skc4) ),
inference(rew,[status(thm),theory(equality)],[562,68]),
[iquote('1:Rew:562.0,68.1')] ).
cnf(650,plain,
neq(skc5,skc4),
inference(rew,[status(thm),theory(equality)],[562,13]),
[iquote('1:Rew:562.0,13.0')] ).
cnf(651,plain,
~ neq(skc4,skc4),
inference(rew,[status(thm),theory(equality)],[562,52]),
[iquote('1:Rew:562.0,52.0')] ).
cnf(690,plain,
( ~ equal(skc4,skc4)
| equal(skc5,skc4) ),
inference(rew,[status(thm),theory(equality)],[562,588]),
[iquote('1:Rew:562.0,588.0')] ).
cnf(691,plain,
equal(skc5,skc4),
inference(obv,[status(thm),theory(equality)],[690]),
[iquote('1:Obv:690.0')] ).
cnf(825,plain,
neq(skc4,skc4),
inference(rew,[status(thm),theory(equality)],[691,650]),
[iquote('1:Rew:691.0,650.0')] ).
cnf(828,plain,
$false,
inference(mrr,[status(thm)],[825,651]),
[iquote('1:MRR:825.0,651.0')] ).
cnf(983,plain,
~ equal(nil,skc4),
inference(spt,[spt(split,[position(sa)])],[828,562]),
[iquote('1:Spt:828.0,281.5,562.0')] ).
cnf(984,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)])],[281]),
[iquote('1:Spt:828.0,281.0,281.1,281.2,281.3,281.4')] ).
cnf(1087,plain,
( ~ ssList(nil)
| equal(nil,skc4) ),
inference(res,[status(thm),theory(equality)],[248,52]),
[iquote('0:Res:248.1,52.0')] ).
cnf(1088,plain,
equal(nil,skc4),
inference(ssi,[status(thm)],[1087,5,6,7,8,9,10,11,12]),
[iquote('0:SSi:1087.0,5.0,6.0,7.0,8.0,9.0,10.0,11.0,12.0')] ).
cnf(1089,plain,
$false,
inference(mrr,[status(thm)],[1088,983]),
[iquote('1:MRR:1088.0,983.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWC205+1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/0.13 % Command : run_spass %d %s
% 0.14/0.33 % Computer : n010.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 600
% 0.14/0.33 % DateTime : Sun Jun 12 21:01:10 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.72/0.88
% 0.72/0.88 SPASS V 3.9
% 0.72/0.88 SPASS beiseite: Proof found.
% 0.72/0.88 % SZS status Theorem
% 0.72/0.88 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.72/0.88 SPASS derived 717 clauses, backtracked 331 clauses, performed 17 splits and kept 962 clauses.
% 0.72/0.88 SPASS allocated 98824 KBytes.
% 0.72/0.88 SPASS spent 0:00:00.53 on the problem.
% 0.72/0.88 0:00:00.04 for the input.
% 0.72/0.88 0:00:00.07 for the FLOTTER CNF translation.
% 0.72/0.88 0:00:00.00 for inferences.
% 0.72/0.88 0:00:00.00 for the backtracking.
% 0.72/0.88 0:00:00.21 for the reduction.
% 0.72/0.88
% 0.72/0.88
% 0.72/0.88 Here is a proof with depth 2, length 29 :
% 0.72/0.88 % SZS output start Refutation
% See solution above
% 0.72/0.88 Formulae used in the proof : co1 ax17 ax60 ax62 ax64 ax66 ax69 ax72 ax74 ax15 ax77
% 0.72/0.88
%------------------------------------------------------------------------------