TSTP Solution File: SWC261+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC261+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n012.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:54 EDT 2022
% Result : Theorem 199.41s 199.76s
% Output : Refutation 199.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 16
% Syntax : Number of clauses : 37 ( 15 unt; 12 nHn; 37 RR)
% Number of literals : 103 ( 0 equ; 59 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
ssItem(skc7),
file('SWC261+1.p',unknown),
[] ).
cnf(3,axiom,
ssList(skc5),
file('SWC261+1.p',unknown),
[] ).
cnf(14,axiom,
~ totalorderedP(skc5),
file('SWC261+1.p',unknown),
[] ).
cnf(31,axiom,
ssList(skf69(u)),
file('SWC261+1.p',unknown),
[] ).
cnf(32,axiom,
ssList(skf68(u)),
file('SWC261+1.p',unknown),
[] ).
cnf(33,axiom,
ssList(skf67(u)),
file('SWC261+1.p',unknown),
[] ).
cnf(34,axiom,
ssItem(skf66(u)),
file('SWC261+1.p',unknown),
[] ).
cnf(35,axiom,
ssItem(skf65(u)),
file('SWC261+1.p',unknown),
[] ).
cnf(60,axiom,
( ~ ssItem(u)
| leq(u,u) ),
file('SWC261+1.p',unknown),
[] ).
cnf(83,axiom,
( ~ ssItem(u)
| ~ memberP(skc5,u)
| equal(skc7,u) ),
file('SWC261+1.p',unknown),
[] ).
cnf(87,axiom,
( ~ ssItem(u)
| ~ ssList(v)
| ssList(cons(u,v)) ),
file('SWC261+1.p',unknown),
[] ).
cnf(88,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ssList(app(v,u)) ),
file('SWC261+1.p',unknown),
[] ).
cnf(99,axiom,
( ~ ssList(u)
| ~ leq(skf65(u),skf66(u))
| totalorderedP(u) ),
file('SWC261+1.p',unknown),
[] ).
cnf(142,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ~ ssItem(w)
| ~ memberP(v,w)
| memberP(app(v,u),w) ),
file('SWC261+1.p',unknown),
[] ).
cnf(170,axiom,
( ~ ssList(u)
| totalorderedP(u)
| equal(app(app(skf67(u),cons(skf65(u),skf68(u))),cons(skf66(u),skf69(u))),u) ),
file('SWC261+1.p',unknown),
[] ).
cnf(182,axiom,
( ~ ssItem(u)
| ~ ssList(v)
| ~ ssList(w)
| ~ ssList(x)
| ~ equal(app(x,cons(u,w)),v)
| memberP(v,u) ),
file('SWC261+1.p',unknown),
[] ).
cnf(256,plain,
( ~ leq(skf65(skc5),skf66(skc5))
| totalorderedP(skc5) ),
inference(res,[status(thm),theory(equality)],[3,99]),
[iquote('0:Res:3.0,99.0')] ).
cnf(539,plain,
~ leq(skf65(skc5),skf66(skc5)),
inference(mrr,[status(thm)],[256,14]),
[iquote('0:MRR:256.1,14.0')] ).
cnf(5042,plain,
( ~ ssList(u)
| ~ ssList(cons(skf66(u),skf69(u)))
| ~ ssList(app(skf67(u),cons(skf65(u),skf68(u))))
| ~ ssItem(v)
| ~ memberP(app(skf67(u),cons(skf65(u),skf68(u))),v)
| totalorderedP(u)
| memberP(u,v) ),
inference(spr,[status(thm),theory(equality)],[170,142]),
[iquote('0:SpR:170.2,142.4')] ).
cnf(5067,plain,
( ~ ssList(u)
| ~ ssItem(v)
| ~ memberP(app(skf67(u),cons(skf65(u),skf68(u))),v)
| totalorderedP(u)
| memberP(u,v) ),
inference(ssi,[status(thm)],[5042,88,33,87,35,32,34,31]),
[iquote('0:SSi:5042.2,5042.1,88.0,33.0,87.2,35.0,32.0,87.2,34.0,31.2')] ).
cnf(5771,plain,
( ~ ssItem(u)
| ~ ssList(app(v,cons(u,w)))
| ~ ssList(w)
| ~ ssList(v)
| memberP(app(v,cons(u,w)),u) ),
inference(eqr,[status(thm),theory(equality)],[182]),
[iquote('0:EqR:182.4')] ).
cnf(5797,plain,
( ~ ssItem(u)
| ~ ssList(v)
| ~ ssList(w)
| memberP(app(w,cons(u,v)),u) ),
inference(ssi,[status(thm)],[5771,88,87]),
[iquote('0:SSi:5771.1,88.2,87.2')] ).
cnf(16907,plain,
( ~ ssList(u)
| ~ ssItem(skf66(u))
| ~ ssList(skf69(u))
| ~ ssList(app(skf67(u),cons(skf65(u),skf68(u))))
| totalorderedP(u)
| memberP(u,skf66(u)) ),
inference(spr,[status(thm),theory(equality)],[170,5797]),
[iquote('0:SpR:170.2,5797.3')] ).
cnf(16941,plain,
( ~ ssList(u)
| totalorderedP(u)
| memberP(u,skf66(u)) ),
inference(ssi,[status(thm)],[16907,88,33,87,35,32,31,34]),
[iquote('0:SSi:16907.3,16907.2,16907.1,88.0,33.0,87.0,35.0,32.2,31.0,34.2')] ).
cnf(17389,plain,
( ~ ssList(skc5)
| ~ ssItem(skf66(skc5))
| totalorderedP(skc5)
| equal(skf66(skc5),skc7) ),
inference(res,[status(thm),theory(equality)],[16941,83]),
[iquote('0:Res:16941.2,83.1')] ).
cnf(50704,plain,
( ~ ssItem(skf65(u))
| ~ ssList(skf68(u))
| ~ ssList(skf67(u))
| ~ ssList(u)
| ~ ssItem(skf65(u))
| totalorderedP(u)
| memberP(u,skf65(u)) ),
inference(res,[status(thm),theory(equality)],[5797,5067]),
[iquote('0:Res:5797.3,5067.2')] ).
cnf(50730,plain,
( ~ ssList(skf68(u))
| ~ ssList(skf67(u))
| ~ ssList(u)
| ~ ssItem(skf65(u))
| totalorderedP(u)
| memberP(u,skf65(u)) ),
inference(obv,[status(thm),theory(equality)],[50704]),
[iquote('0:Obv:50704.0')] ).
cnf(50731,plain,
( ~ ssList(u)
| totalorderedP(u)
| memberP(u,skf65(u)) ),
inference(ssi,[status(thm)],[50730,35,33,32]),
[iquote('0:SSi:50730.3,50730.1,50730.0,35.0,33.0,32.0')] ).
cnf(50762,plain,
( ~ ssList(skc5)
| ~ ssItem(skf65(skc5))
| totalorderedP(skc5)
| equal(skf65(skc5),skc7) ),
inference(res,[status(thm),theory(equality)],[50731,83]),
[iquote('0:Res:50731.2,83.1')] ).
cnf(56838,plain,
( totalorderedP(skc5)
| equal(skf66(skc5),skc7) ),
inference(ssi,[status(thm)],[17389,34,3]),
[iquote('0:SSi:17389.1,17389.0,34.0,3.0,3.0')] ).
cnf(56839,plain,
equal(skf66(skc5),skc7),
inference(mrr,[status(thm)],[56838,14]),
[iquote('0:MRR:56838.0,14.0')] ).
cnf(56840,plain,
~ leq(skf65(skc5),skc7),
inference(rew,[status(thm),theory(equality)],[56839,539]),
[iquote('0:Rew:56839.0,539.0')] ).
cnf(56841,plain,
( totalorderedP(skc5)
| equal(skf65(skc5),skc7) ),
inference(ssi,[status(thm)],[50762,35,3]),
[iquote('0:SSi:50762.1,50762.0,35.0,3.0,3.0')] ).
cnf(56842,plain,
equal(skf65(skc5),skc7),
inference(mrr,[status(thm)],[56841,14]),
[iquote('0:MRR:56841.0,14.0')] ).
cnf(56843,plain,
~ leq(skc7,skc7),
inference(rew,[status(thm),theory(equality)],[56842,56840]),
[iquote('0:Rew:56842.0,56840.0')] ).
cnf(58070,plain,
~ ssItem(skc7),
inference(res,[status(thm),theory(equality)],[60,56843]),
[iquote('0:Res:60.1,56843.0')] ).
cnf(58071,plain,
$false,
inference(ssi,[status(thm)],[58070,1]),
[iquote('0:SSi:58070.0,1.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC261+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n012.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jun 12 18:05:41 EDT 2022
% 0.12/0.33 % CPUTime :
% 199.41/199.76
% 199.41/199.76 SPASS V 3.9
% 199.41/199.76 SPASS beiseite: Proof found.
% 199.41/199.76 % SZS status Theorem
% 199.41/199.76 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 199.41/199.76 SPASS derived 32524 clauses, backtracked 10360 clauses, performed 57 splits and kept 18679 clauses.
% 199.41/199.76 SPASS allocated 153912 KBytes.
% 199.41/199.76 SPASS spent 0:03:03.39 on the problem.
% 199.41/199.76 0:00:00.04 for the input.
% 199.41/199.76 0:00:00.06 for the FLOTTER CNF translation.
% 199.41/199.76 0:00:00.88 for inferences.
% 199.41/199.76 0:00:06.05 for the backtracking.
% 199.41/199.76 0:2:55.52 for the reduction.
% 199.41/199.76
% 199.41/199.76
% 199.41/199.76 Here is a proof with depth 3, length 37 :
% 199.41/199.76 % SZS output start Refutation
% See solution above
% 199.41/199.76 Formulae used in the proof : co1 ax11 ax2 ax17 ax31 ax16 ax26 ax36 ax3
% 199.41/199.76
%------------------------------------------------------------------------------