TSTP Solution File: SWC331-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC331-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n020.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:03:21 EDT 2022
% Result : Unsatisfiable 39.83s 40.22s
% Output : Refutation 39.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 20
% Syntax : Number of clauses : 32 ( 21 unt; 0 nHn; 32 RR)
% Number of literals : 61 ( 0 equ; 31 neg)
% Maximal clause size : 6 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 10 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 10 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
ssList(sk1),
file('SWC331-1.p',unknown),
[] ).
cnf(2,axiom,
ssList(sk2),
file('SWC331-1.p',unknown),
[] ).
cnf(5,axiom,
equal(sk4,sk2),
file('SWC331-1.p',unknown),
[] ).
cnf(6,axiom,
equal(sk3,sk1),
file('SWC331-1.p',unknown),
[] ).
cnf(7,axiom,
ssList(sk5),
file('SWC331-1.p',unknown),
[] ).
cnf(8,axiom,
equal(app(sk3,sk5),sk4),
file('SWC331-1.p',unknown),
[] ).
cnf(9,axiom,
equalelemsP(sk3),
file('SWC331-1.p',unknown),
[] ).
cnf(12,axiom,
( ~ segmentP(sk2,sk1)
| ~ equalelemsP(sk1) ),
file('SWC331-1.p',unknown),
[] ).
cnf(13,axiom,
equalelemsP(nil),
file('SWC331-1.p',unknown),
[] ).
cnf(14,axiom,
duplicatefreeP(nil),
file('SWC331-1.p',unknown),
[] ).
cnf(15,axiom,
strictorderedP(nil),
file('SWC331-1.p',unknown),
[] ).
cnf(16,axiom,
totalorderedP(nil),
file('SWC331-1.p',unknown),
[] ).
cnf(17,axiom,
strictorderP(nil),
file('SWC331-1.p',unknown),
[] ).
cnf(18,axiom,
totalorderP(nil),
file('SWC331-1.p',unknown),
[] ).
cnf(19,axiom,
cyclefreeP(nil),
file('SWC331-1.p',unknown),
[] ).
cnf(20,axiom,
ssList(nil),
file('SWC331-1.p',unknown),
[] ).
cnf(86,axiom,
( ~ ssList(u)
| equal(app(nil,u),u) ),
file('SWC331-1.p',unknown),
[] ).
cnf(97,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ssList(app(u,v)) ),
file('SWC331-1.p',unknown),
[] ).
cnf(161,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ~ ssList(w)
| equal(app(app(u,v),w),app(u,app(v,w))) ),
file('SWC331-1.p',unknown),
[] ).
cnf(185,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ~ ssList(w)
| ~ ssList(x)
| ~ equal(app(app(v,w),u),x)
| segmentP(x,w) ),
file('SWC331-1.p',unknown),
[] ).
cnf(198,plain,
equalelemsP(sk1),
inference(rew,[status(thm),theory(equality)],[6,9]),
[iquote('0:Rew:6.0,9.0')] ).
cnf(201,plain,
equal(app(sk1,sk5),sk2),
inference(rew,[status(thm),theory(equality)],[6,8,5]),
[iquote('0:Rew:6.0,8.0,5.0,8.0')] ).
cnf(202,plain,
~ segmentP(sk2,sk1),
inference(mrr,[status(thm)],[12,198]),
[iquote('0:MRR:12.1,198.0')] ).
cnf(207,plain,
( ~ ssList(u)
| ~ ssList(v)
| ~ ssList(w)
| ~ ssList(x)
| ~ equal(app(w,app(v,x)),u)
| segmentP(u,v) ),
inference(rew,[status(thm),theory(equality)],[161,185]),
[iquote('0:Rew:161.3,185.4')] ).
cnf(462,plain,
equal(app(nil,sk2),sk2),
inference(res,[status(thm),theory(equality)],[2,86]),
[iquote('0:Res:2.0,86.0')] ).
cnf(6463,plain,
( ~ ssList(app(u,app(v,w)))
| ~ ssList(v)
| ~ ssList(u)
| ~ ssList(w)
| segmentP(app(u,app(v,w)),v) ),
inference(eqr,[status(thm),theory(equality)],[207]),
[iquote('0:EqR:207.4')] ).
cnf(6497,plain,
( ~ ssList(u)
| ~ ssList(v)
| ~ ssList(w)
| segmentP(app(v,app(u,w)),u) ),
inference(ssi,[status(thm)],[6463,97]),
[iquote('0:SSi:6463.0,97.2,97.2')] ).
cnf(27974,plain,
( ~ ssList(sk1)
| ~ ssList(u)
| ~ ssList(sk5)
| segmentP(app(u,sk2),sk1) ),
inference(spr,[status(thm),theory(equality)],[201,6497]),
[iquote('0:SpR:201.0,6497.3')] ).
cnf(36836,plain,
( ~ ssList(u)
| segmentP(app(u,sk2),sk1) ),
inference(ssi,[status(thm)],[27974,7,198,1]),
[iquote('0:SSi:27974.2,27974.0,7.0,198.0,1.0')] ).
cnf(39816,plain,
( ~ ssList(nil)
| segmentP(sk2,sk1) ),
inference(spr,[status(thm),theory(equality)],[462,36836]),
[iquote('0:SpR:462.0,36836.1')] ).
cnf(39834,plain,
segmentP(sk2,sk1),
inference(ssi,[status(thm)],[39816,20,19,18,17,16,15,14,13]),
[iquote('0:SSi:39816.0,20.0,19.0,18.0,17.0,16.0,15.0,14.0,13.0')] ).
cnf(39835,plain,
$false,
inference(mrr,[status(thm)],[39834,202]),
[iquote('0:MRR:39834.0,202.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC331-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n020.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 21:07:05 EDT 2022
% 0.12/0.33 % CPUTime :
% 39.83/40.22
% 39.83/40.22 SPASS V 3.9
% 39.83/40.22 SPASS beiseite: Proof found.
% 39.83/40.22 % SZS status Theorem
% 39.83/40.22 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 39.83/40.22 SPASS derived 25009 clauses, backtracked 9720 clauses, performed 120 splits and kept 15407 clauses.
% 39.83/40.22 SPASS allocated 105698 KBytes.
% 39.83/40.22 SPASS spent 0:0:34.57 on the problem.
% 39.83/40.22 0:00:00.04 for the input.
% 39.83/40.22 0:00:00.00 for the FLOTTER CNF translation.
% 39.83/40.22 0:00:00.41 for inferences.
% 39.83/40.22 0:00:01.68 for the backtracking.
% 39.83/40.22 0:0:31.95 for the reduction.
% 39.83/40.22
% 39.83/40.22
% 39.83/40.22 Here is a proof with depth 3, length 32 :
% 39.83/40.22 % SZS output start Refutation
% See solution above
% 39.83/40.22 Formulae used in the proof : co1_1 co1_2 co1_5 co1_6 co1_7 co1_8 co1_9 co1_12 clause1 clause2 clause3 clause4 clause5 clause6 clause7 clause8 clause74 clause85 clause149 clause173
% 39.83/40.22
%------------------------------------------------------------------------------