TSTP Solution File: SWC274+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC274+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n018.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:59 EDT 2022
% Result : Theorem 13.65s 13.87s
% Output : Refutation 13.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of clauses : 21 ( 9 unt; 3 nHn; 21 RR)
% Number of literals : 67 ( 0 equ; 45 neg)
% Maximal clause size : 11 ( 3 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 7 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(4,axiom,
ssList(skc6),
file('SWC274+1.p',unknown),
[] ).
cnf(5,axiom,
strictorderedP(skc6),
file('SWC274+1.p',unknown),
[] ).
cnf(16,axiom,
~ totalorderedP(skc6),
file('SWC274+1.p',unknown),
[] ).
cnf(33,axiom,
ssList(skf69(u)),
file('SWC274+1.p',unknown),
[] ).
cnf(34,axiom,
ssList(skf68(u)),
file('SWC274+1.p',unknown),
[] ).
cnf(35,axiom,
ssList(skf67(u)),
file('SWC274+1.p',unknown),
[] ).
cnf(36,axiom,
ssItem(skf66(u)),
file('SWC274+1.p',unknown),
[] ).
cnf(37,axiom,
ssItem(skf65(u)),
file('SWC274+1.p',unknown),
[] ).
cnf(102,axiom,
( ~ ssList(u)
| ~ leq(skf65(u),skf66(u))
| totalorderedP(u) ),
file('SWC274+1.p',unknown),
[] ).
cnf(118,axiom,
( ~ ssItem(u)
| ~ ssItem(v)
| ~ lt(v,u)
| leq(v,u) ),
file('SWC274+1.p',unknown),
[] ).
cnf(173,axiom,
( ~ ssList(u)
| totalorderedP(u)
| equal(app(app(skf67(u),cons(skf65(u),skf68(u))),cons(skf66(u),skf69(u))),u) ),
file('SWC274+1.p',unknown),
[] ).
cnf(191,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ~ ssList(w)
| ~ ssList(x)
| ~ ssItem(y)
| ~ ssItem(z)
| ~ strictorderedP(u)
| ~ equal(app(app(x,cons(z,w)),cons(y,v)),u)
| lt(z,y) ),
file('SWC274+1.p',unknown),
[] ).
cnf(2309,plain,
( ~ ssItem(skf66(u))
| ~ ssItem(skf65(u))
| ~ ssList(u)
| ~ lt(skf65(u),skf66(u))
| totalorderedP(u) ),
inference(res,[status(thm),theory(equality)],[118,102]),
[iquote('0:Res:118.3,102.1')] ).
cnf(2314,plain,
( ~ ssList(u)
| ~ lt(skf65(u),skf66(u))
| totalorderedP(u) ),
inference(ssi,[status(thm)],[2309,37,36]),
[iquote('0:SSi:2309.1,2309.0,37.0,36.0')] ).
cnf(7209,plain,
( ~ ssList(u)
| ~ ssList(v)
| ~ ssList(skf69(u))
| ~ ssList(skf68(u))
| ~ ssList(skf67(u))
| ~ ssItem(skf66(u))
| ~ ssItem(skf65(u))
| ~ strictorderedP(v)
| ~ equal(u,v)
| totalorderedP(u)
| lt(skf65(u),skf66(u)) ),
inference(spl,[status(thm),theory(equality)],[173,191]),
[iquote('0:SpL:173.2,191.7')] ).
cnf(7221,plain,
( ~ ssList(u)
| ~ ssList(v)
| ~ strictorderedP(v)
| ~ equal(u,v)
| totalorderedP(u)
| lt(skf65(u),skf66(u)) ),
inference(ssi,[status(thm)],[7209,37,36,35,34,33]),
[iquote('0:SSi:7209.6,7209.5,7209.4,7209.3,7209.2,37.0,36.0,35.0,34.0,33.0')] ).
cnf(7222,plain,
( ~ ssList(u)
| ~ ssList(v)
| ~ strictorderedP(v)
| ~ equal(u,v)
| totalorderedP(u) ),
inference(mrr,[status(thm)],[7221,2314]),
[iquote('0:MRR:7221.5,2314.1')] ).
cnf(16800,plain,
( ~ ssList(u)
| ~ ssList(u)
| ~ strictorderedP(u)
| totalorderedP(u) ),
inference(eqr,[status(thm),theory(equality)],[7222]),
[iquote('0:EqR:7222.3')] ).
cnf(16801,plain,
( ~ ssList(u)
| ~ strictorderedP(u)
| totalorderedP(u) ),
inference(obv,[status(thm),theory(equality)],[16800]),
[iquote('0:Obv:16800.0')] ).
cnf(16810,plain,
( ~ ssList(skc6)
| ~ strictorderedP(skc6) ),
inference(res,[status(thm),theory(equality)],[16801,16]),
[iquote('0:Res:16801.2,16.0')] ).
cnf(17718,plain,
$false,
inference(ssi,[status(thm)],[16810,4,5]),
[iquote('0:SSi:16810.1,16810.0,4.0,5.0,4.0,5.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC274+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n018.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 : Sun Jun 12 14:02:26 EDT 2022
% 0.13/0.35 % CPUTime :
% 13.65/13.87
% 13.65/13.87 SPASS V 3.9
% 13.65/13.87 SPASS beiseite: Proof found.
% 13.65/13.87 % SZS status Theorem
% 13.65/13.87 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 13.65/13.87 SPASS derived 10994 clauses, backtracked 3330 clauses, performed 26 splits and kept 6631 clauses.
% 13.65/13.87 SPASS allocated 113951 KBytes.
% 13.65/13.87 SPASS spent 0:0:12.46 on the problem.
% 13.65/13.87 0:00:00.04 for the input.
% 13.65/13.87 0:00:00.07 for the FLOTTER CNF translation.
% 13.65/13.87 0:00:00.16 for inferences.
% 13.65/13.87 0:00:00.34 for the backtracking.
% 13.65/13.87 0:0:11.61 for the reduction.
% 13.65/13.87
% 13.65/13.87
% 13.65/13.87 Here is a proof with depth 3, length 21 :
% 13.65/13.87 % SZS output start Refutation
% See solution above
% 13.65/13.87 Formulae used in the proof : co1 ax11 ax2 ax17 ax93 ax12
% 13.65/13.87
%------------------------------------------------------------------------------