TSTP Solution File: SWC272+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC272+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:02:58 EDT 2022
% Result : Theorem 13.26s 13.46s
% Output : Refutation 13.26s
% 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(3,axiom,
ssList(skc5),
file('SWC272+1.p',unknown),
[] ).
cnf(4,axiom,
strictorderedP(skc5),
file('SWC272+1.p',unknown),
[] ).
cnf(15,axiom,
~ totalorderedP(skc5),
file('SWC272+1.p',unknown),
[] ).
cnf(32,axiom,
ssList(skf69(u)),
file('SWC272+1.p',unknown),
[] ).
cnf(33,axiom,
ssList(skf68(u)),
file('SWC272+1.p',unknown),
[] ).
cnf(34,axiom,
ssList(skf67(u)),
file('SWC272+1.p',unknown),
[] ).
cnf(35,axiom,
ssItem(skf66(u)),
file('SWC272+1.p',unknown),
[] ).
cnf(36,axiom,
ssItem(skf65(u)),
file('SWC272+1.p',unknown),
[] ).
cnf(101,axiom,
( ~ ssList(u)
| ~ leq(skf65(u),skf66(u))
| totalorderedP(u) ),
file('SWC272+1.p',unknown),
[] ).
cnf(117,axiom,
( ~ ssItem(u)
| ~ ssItem(v)
| ~ lt(v,u)
| leq(v,u) ),
file('SWC272+1.p',unknown),
[] ).
cnf(172,axiom,
( ~ ssList(u)
| totalorderedP(u)
| equal(app(app(skf67(u),cons(skf65(u),skf68(u))),cons(skf66(u),skf69(u))),u) ),
file('SWC272+1.p',unknown),
[] ).
cnf(189,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('SWC272+1.p',unknown),
[] ).
cnf(1640,plain,
( ~ ssItem(skf66(u))
| ~ ssItem(skf65(u))
| ~ ssList(u)
| ~ lt(skf65(u),skf66(u))
| totalorderedP(u) ),
inference(res,[status(thm),theory(equality)],[117,101]),
[iquote('0:Res:117.3,101.1')] ).
cnf(1645,plain,
( ~ ssList(u)
| ~ lt(skf65(u),skf66(u))
| totalorderedP(u) ),
inference(ssi,[status(thm)],[1640,36,35]),
[iquote('0:SSi:1640.1,1640.0,36.0,35.0')] ).
cnf(6607,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)],[172,189]),
[iquote('0:SpL:172.2,189.7')] ).
cnf(6619,plain,
( ~ ssList(u)
| ~ ssList(v)
| ~ strictorderedP(v)
| ~ equal(u,v)
| totalorderedP(u)
| lt(skf65(u),skf66(u)) ),
inference(ssi,[status(thm)],[6607,36,35,34,33,32]),
[iquote('0:SSi:6607.6,6607.5,6607.4,6607.3,6607.2,36.0,35.0,34.0,33.0,32.0')] ).
cnf(6620,plain,
( ~ ssList(u)
| ~ ssList(v)
| ~ strictorderedP(v)
| ~ equal(u,v)
| totalorderedP(u) ),
inference(mrr,[status(thm)],[6619,1645]),
[iquote('0:MRR:6619.5,1645.1')] ).
cnf(15425,plain,
( ~ ssList(u)
| ~ ssList(u)
| ~ strictorderedP(u)
| totalorderedP(u) ),
inference(eqr,[status(thm),theory(equality)],[6620]),
[iquote('0:EqR:6620.3')] ).
cnf(15426,plain,
( ~ ssList(u)
| ~ strictorderedP(u)
| totalorderedP(u) ),
inference(obv,[status(thm),theory(equality)],[15425]),
[iquote('0:Obv:15425.0')] ).
cnf(15435,plain,
( ~ ssList(skc5)
| ~ strictorderedP(skc5) ),
inference(res,[status(thm),theory(equality)],[15426,15]),
[iquote('0:Res:15426.2,15.0')] ).
cnf(16549,plain,
$false,
inference(ssi,[status(thm)],[15435,3,4]),
[iquote('0:SSi:15435.1,15435.0,3.0,4.0,3.0,4.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC272+1 : TPTP v8.1.0. Released v2.4.0.
% 0.13/0.12 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n011.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jun 12 13:49:17 EDT 2022
% 0.13/0.33 % CPUTime :
% 13.26/13.46
% 13.26/13.46 SPASS V 3.9
% 13.26/13.46 SPASS beiseite: Proof found.
% 13.26/13.46 % SZS status Theorem
% 13.26/13.46 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 13.26/13.46 SPASS derived 10118 clauses, backtracked 3176 clauses, performed 23 splits and kept 5891 clauses.
% 13.26/13.46 SPASS allocated 113409 KBytes.
% 13.26/13.46 SPASS spent 0:0:12.14 on the problem.
% 13.26/13.46 0:00:00.04 for the input.
% 13.26/13.46 0:00:00.06 for the FLOTTER CNF translation.
% 13.26/13.46 0:00:00.15 for inferences.
% 13.26/13.46 0:00:00.35 for the backtracking.
% 13.26/13.46 0:0:11.29 for the reduction.
% 13.26/13.46
% 13.26/13.46
% 13.26/13.46 Here is a proof with depth 3, length 21 :
% 13.26/13.46 % SZS output start Refutation
% See solution above
% 13.26/13.46 Formulae used in the proof : co1 ax11 ax2 ax17 ax93 ax12
% 13.26/13.46
%------------------------------------------------------------------------------