TSTP Solution File: SWC118-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC118-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n013.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:01:50 EDT 2022
% Result : Unsatisfiable 67.12s 67.34s
% Output : Refutation 67.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 22
% Syntax : Number of clauses : 39 ( 23 unt; 1 nHn; 39 RR)
% Number of literals : 78 ( 0 equ; 43 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 12 ( 11 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 11 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
ssList(sk1),
file('SWC118-1.p',unknown),
[] ).
cnf(5,axiom,
equal(sk4,sk2),
file('SWC118-1.p',unknown),
[] ).
cnf(6,axiom,
equal(sk3,sk1),
file('SWC118-1.p',unknown),
[] ).
cnf(7,axiom,
ssList(sk5),
file('SWC118-1.p',unknown),
[] ).
cnf(8,axiom,
ssList(sk6),
file('SWC118-1.p',unknown),
[] ).
cnf(9,axiom,
equal(app(app(sk5,sk3),sk6),sk4),
file('SWC118-1.p',unknown),
[] ).
cnf(10,axiom,
totalorderedP(sk3),
file('SWC118-1.p',unknown),
[] ).
cnf(13,axiom,
( ~ equal(nil,sk3)
| equal(sk4,nil) ),
file('SWC118-1.p',unknown),
[] ).
cnf(14,axiom,
( ~ equal(nil,sk2)
| ~ equal(nil,sk1) ),
file('SWC118-1.p',unknown),
[] ).
cnf(15,axiom,
( ~ segmentP(sk2,sk1)
| ~ neq(sk1,nil) ),
file('SWC118-1.p',unknown),
[] ).
cnf(16,axiom,
equalelemsP(nil),
file('SWC118-1.p',unknown),
[] ).
cnf(17,axiom,
duplicatefreeP(nil),
file('SWC118-1.p',unknown),
[] ).
cnf(18,axiom,
strictorderedP(nil),
file('SWC118-1.p',unknown),
[] ).
cnf(19,axiom,
totalorderedP(nil),
file('SWC118-1.p',unknown),
[] ).
cnf(20,axiom,
strictorderP(nil),
file('SWC118-1.p',unknown),
[] ).
cnf(21,axiom,
totalorderP(nil),
file('SWC118-1.p',unknown),
[] ).
cnf(22,axiom,
cyclefreeP(nil),
file('SWC118-1.p',unknown),
[] ).
cnf(23,axiom,
ssList(nil),
file('SWC118-1.p',unknown),
[] ).
cnf(100,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ssList(app(u,v)) ),
file('SWC118-1.p',unknown),
[] ).
cnf(115,axiom,
( ~ ssList(u)
| ~ ssList(v)
| equal(u,v)
| neq(u,v) ),
file('SWC118-1.p',unknown),
[] ).
cnf(164,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ~ ssList(w)
| equal(app(app(u,v),w),app(u,app(v,w))) ),
file('SWC118-1.p',unknown),
[] ).
cnf(188,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ~ ssList(w)
| ~ ssList(x)
| ~ equal(app(app(v,w),u),x)
| segmentP(x,w) ),
file('SWC118-1.p',unknown),
[] ).
cnf(201,plain,
totalorderedP(sk1),
inference(rew,[status(thm),theory(equality)],[6,10]),
[iquote('0:Rew:6.0,10.0')] ).
cnf(204,plain,
( ~ equal(nil,sk1)
| equal(nil,sk2) ),
inference(rew,[status(thm),theory(equality)],[5,13,6]),
[iquote('0:Rew:5.0,13.1,6.0,13.0')] ).
cnf(205,plain,
equal(app(app(sk5,sk1),sk6),sk2),
inference(rew,[status(thm),theory(equality)],[6,9,5]),
[iquote('0:Rew:6.0,9.0,5.0,9.0')] ).
cnf(206,plain,
( ~ equal(sk2,sk2)
| ~ equal(nil,sk1) ),
inference(rew,[status(thm),theory(equality)],[204,14]),
[iquote('0:Rew:204.1,14.0')] ).
cnf(207,plain,
~ equal(nil,sk1),
inference(obv,[status(thm),theory(equality)],[206]),
[iquote('0:Obv:206.0')] ).
cnf(211,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)],[164,188]),
[iquote('0:Rew:164.3,188.4')] ).
cnf(244,plain,
( ~ ssList(u)
| ~ ssList(v)
| equal(app(app(u,v),sk6),app(u,app(v,sk6))) ),
inference(res,[status(thm),theory(equality)],[8,164]),
[iquote('0:Res:8.0,164.0')] ).
cnf(5478,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)],[211]),
[iquote('0:EqR:211.4')] ).
cnf(5517,plain,
( ~ ssList(u)
| ~ ssList(v)
| ~ ssList(w)
| segmentP(app(v,app(u,w)),u) ),
inference(ssi,[status(thm)],[5478,100]),
[iquote('0:SSi:5478.0,100.2,100.2')] ).
cnf(22457,plain,
( ~ ssList(sk5)
| ~ ssList(sk1)
| equal(app(sk5,app(sk1,sk6)),sk2) ),
inference(spr,[status(thm),theory(equality)],[244,205]),
[iquote('0:SpR:244.2,205.0')] ).
cnf(33275,plain,
equal(app(sk5,app(sk1,sk6)),sk2),
inference(ssi,[status(thm)],[22457,201,1,7]),
[iquote('0:SSi:22457.1,22457.0,201.0,1.0,7.0')] ).
cnf(33951,plain,
( ~ ssList(sk1)
| ~ ssList(sk5)
| ~ ssList(sk6)
| segmentP(sk2,sk1) ),
inference(spr,[status(thm),theory(equality)],[33275,5517]),
[iquote('0:SpR:33275.0,5517.3')] ).
cnf(35102,plain,
segmentP(sk2,sk1),
inference(ssi,[status(thm)],[33951,8,7,201,1]),
[iquote('0:SSi:33951.2,33951.1,33951.0,8.0,7.0,201.0,1.0')] ).
cnf(35103,plain,
~ neq(sk1,nil),
inference(mrr,[status(thm)],[15,35102]),
[iquote('0:MRR:15.0,35102.0')] ).
cnf(43849,plain,
( ~ ssList(sk1)
| ~ ssList(nil)
| equal(nil,sk1) ),
inference(res,[status(thm),theory(equality)],[115,35103]),
[iquote('0:Res:115.3,35103.0')] ).
cnf(43850,plain,
equal(nil,sk1),
inference(ssi,[status(thm)],[43849,23,22,21,20,19,18,17,16,201,1]),
[iquote('0:SSi:43849.1,43849.0,23.0,22.0,21.0,20.0,19.0,18.0,17.0,16.0,201.0,1.0')] ).
cnf(43851,plain,
$false,
inference(mrr,[status(thm)],[43850,207]),
[iquote('0:MRR:43850.0,207.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC118-1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.14 % Command : run_spass %d %s
% 0.13/0.35 % Computer : n013.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sun Jun 12 22:31:44 EDT 2022
% 0.13/0.36 % CPUTime :
% 67.12/67.34
% 67.12/67.34 SPASS V 3.9
% 67.12/67.34 SPASS beiseite: Proof found.
% 67.12/67.34 % SZS status Theorem
% 67.12/67.34 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 67.12/67.34 SPASS derived 25855 clauses, backtracked 16036 clauses, performed 194 splits and kept 24379 clauses.
% 67.12/67.34 SPASS allocated 108932 KBytes.
% 67.12/67.34 SPASS spent 0:0:59.08 on the problem.
% 67.12/67.34 0:00:00.04 for the input.
% 67.12/67.34 0:00:00.00 for the FLOTTER CNF translation.
% 67.12/67.34 0:00:00.43 for inferences.
% 67.12/67.34 0:00:02.87 for the backtracking.
% 67.12/67.34 0:0:55.22 for the reduction.
% 67.12/67.34
% 67.12/67.34
% 67.12/67.34 Here is a proof with depth 3, length 39 :
% 67.12/67.34 % SZS output start Refutation
% See solution above
% 67.12/67.34 Formulae used in the proof : co1_1 co1_5 co1_6 co1_7 co1_8 co1_9 co1_10 co1_13 co1_14 co1_15 clause1 clause2 clause3 clause4 clause5 clause6 clause7 clause8 clause85 clause100 clause149 clause173
% 67.12/67.34
%------------------------------------------------------------------------------