TSTP Solution File: SWC086-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC086-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n022.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:36 EDT 2022
% Result : Unsatisfiable 0.60s 0.79s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 14
% Syntax : Number of clauses : 46 ( 20 unt; 15 nHn; 46 RR)
% Number of literals : 89 ( 0 equ; 36 neg)
% Maximal clause size : 7 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
ssList(sk1),
file('SWC086-1.p',unknown),
[] ).
cnf(2,axiom,
ssList(sk2),
file('SWC086-1.p',unknown),
[] ).
cnf(5,axiom,
equal(sk4,sk2),
file('SWC086-1.p',unknown),
[] ).
cnf(6,axiom,
equal(sk3,sk1),
file('SWC086-1.p',unknown),
[] ).
cnf(7,axiom,
neq(sk2,nil),
file('SWC086-1.p',unknown),
[] ).
cnf(8,axiom,
( ~ ssList(u)
| ~ neq(u,nil)
| ~ segmentP(sk1,u)
| ~ segmentP(sk2,u) ),
file('SWC086-1.p',unknown),
[] ).
cnf(9,axiom,
( equal(nil,sk4)
| neq(sk3,nil) ),
file('SWC086-1.p',unknown),
[] ).
cnf(10,axiom,
( equal(nil,sk4)
| segmentP(sk4,sk3) ),
file('SWC086-1.p',unknown),
[] ).
cnf(11,axiom,
( equal(nil,sk3)
| neq(sk3,nil) ),
file('SWC086-1.p',unknown),
[] ).
cnf(12,axiom,
( equal(nil,sk3)
| segmentP(sk4,sk3) ),
file('SWC086-1.p',unknown),
[] ).
cnf(68,axiom,
( ~ ssList(u)
| segmentP(u,nil) ),
file('SWC086-1.p',unknown),
[] ).
cnf(69,axiom,
( ~ ssList(u)
| segmentP(u,u) ),
file('SWC086-1.p',unknown),
[] ).
cnf(91,axiom,
( ~ ssList(u)
| ~ equal(nil,u)
| segmentP(nil,u) ),
file('SWC086-1.p',unknown),
[] ).
cnf(189,axiom,
( ~ ssList(u)
| ~ ssList(v)
| ~ equal(hd(v),hd(u))
| ~ equal(tl(v),tl(u))
| equal(v,u)
| equal(nil,v)
| equal(nil,u) ),
file('SWC086-1.p',unknown),
[] ).
cnf(200,plain,
( equal(nil,sk1)
| segmentP(sk2,sk1) ),
inference(rew,[status(thm),theory(equality)],[5,12,6]),
[iquote('0:Rew:5.0,12.1,6.0,12.1,6.0,12.0')] ).
cnf(201,plain,
( equal(nil,sk1)
| neq(sk1,nil) ),
inference(rew,[status(thm),theory(equality)],[6,11]),
[iquote('0:Rew:6.0,11.1,6.0,11.0')] ).
cnf(202,plain,
( equal(nil,sk2)
| segmentP(sk2,sk1) ),
inference(rew,[status(thm),theory(equality)],[5,10,6]),
[iquote('0:Rew:5.0,10.1,6.0,10.1,5.0,10.0')] ).
cnf(203,plain,
( segmentP(sk2,sk1)
| equal(sk2,sk1) ),
inference(rew,[status(thm),theory(equality)],[202,200]),
[iquote('0:Rew:202.0,200.0')] ).
cnf(204,plain,
( equal(nil,sk2)
| neq(sk1,nil) ),
inference(rew,[status(thm),theory(equality)],[6,9,5]),
[iquote('0:Rew:6.0,9.1,5.0,9.0')] ).
cnf(205,plain,
( neq(sk1,nil)
| equal(sk2,sk1) ),
inference(rew,[status(thm),theory(equality)],[204,201]),
[iquote('0:Rew:204.0,201.0')] ).
cnf(206,plain,
( segmentP(sk2,sk1)
| equal(nil,sk1) ),
inference(rew,[status(thm),theory(equality)],[203,202]),
[iquote('0:Rew:203.0,202.0')] ).
cnf(264,plain,
( ~ neq(sk2,nil)
| ~ segmentP(sk2,sk2)
| ~ segmentP(sk1,sk2) ),
inference(res,[status(thm),theory(equality)],[2,8]),
[iquote('0:Res:2.0,8.0')] ).
cnf(281,plain,
( ~ equal(nil,sk2)
| segmentP(nil,sk2) ),
inference(res,[status(thm),theory(equality)],[2,91]),
[iquote('0:Res:2.0,91.0')] ).
cnf(295,plain,
segmentP(sk2,nil),
inference(res,[status(thm),theory(equality)],[2,68]),
[iquote('0:Res:2.0,68.0')] ).
cnf(296,plain,
segmentP(sk2,sk2),
inference(res,[status(thm),theory(equality)],[2,69]),
[iquote('0:Res:2.0,69.0')] ).
cnf(436,plain,
( ~ neq(sk1,nil)
| ~ segmentP(sk2,sk1)
| ~ segmentP(sk1,sk1) ),
inference(res,[status(thm),theory(equality)],[1,8]),
[iquote('0:Res:1.0,8.0')] ).
cnf(468,plain,
segmentP(sk1,sk1),
inference(res,[status(thm),theory(equality)],[1,69]),
[iquote('0:Res:1.0,69.0')] ).
cnf(481,plain,
( ~ ssList(u)
| ~ equal(hd(u),hd(sk1))
| ~ equal(tl(u),tl(sk1))
| equal(u,sk1)
| equal(nil,u)
| equal(nil,sk1) ),
inference(res,[status(thm),theory(equality)],[1,189]),
[iquote('0:Res:1.0,189.1')] ).
cnf(556,plain,
~ segmentP(sk1,sk2),
inference(mrr,[status(thm)],[264,7,296]),
[iquote('0:MRR:264.0,264.1,7.0,296.0')] ).
cnf(559,plain,
( ~ segmentP(sk2,sk1)
| ~ neq(sk1,nil) ),
inference(mrr,[status(thm)],[436,468]),
[iquote('0:MRR:436.2,468.0')] ).
cnf(766,plain,
equal(nil,sk1),
inference(spt,[spt(split,[position(s1)])],[481]),
[iquote('1:Spt:481.5')] ).
cnf(767,plain,
( ~ segmentP(sk2,sk1)
| ~ neq(sk1,sk1) ),
inference(rew,[status(thm),theory(equality)],[766,559]),
[iquote('1:Rew:766.0,559.1')] ).
cnf(768,plain,
( neq(sk1,sk1)
| equal(sk2,sk1) ),
inference(rew,[status(thm),theory(equality)],[766,205]),
[iquote('1:Rew:766.0,205.0')] ).
cnf(814,plain,
( ~ equal(sk2,sk1)
| segmentP(nil,sk2) ),
inference(rew,[status(thm),theory(equality)],[766,281]),
[iquote('1:Rew:766.0,281.0')] ).
cnf(838,plain,
segmentP(sk2,sk1),
inference(rew,[status(thm),theory(equality)],[766,295]),
[iquote('1:Rew:766.0,295.0')] ).
cnf(903,plain,
( ~ equal(sk2,sk1)
| segmentP(sk1,sk2) ),
inference(rew,[status(thm),theory(equality)],[766,814]),
[iquote('1:Rew:766.0,814.1')] ).
cnf(904,plain,
~ equal(sk2,sk1),
inference(mrr,[status(thm)],[903,556]),
[iquote('1:MRR:903.1,556.0')] ).
cnf(905,plain,
neq(sk1,sk1),
inference(mrr,[status(thm)],[768,904]),
[iquote('1:MRR:768.1,904.0')] ).
cnf(912,plain,
$false,
inference(mrr,[status(thm)],[767,838,905]),
[iquote('1:MRR:767.0,767.1,838.0,905.0')] ).
cnf(980,plain,
~ equal(nil,sk1),
inference(spt,[spt(split,[position(sa)])],[912,766]),
[iquote('1:Spt:912.0,481.5,766.0')] ).
cnf(981,plain,
( ~ ssList(u)
| ~ equal(hd(u),hd(sk1))
| ~ equal(tl(u),tl(sk1))
| equal(u,sk1)
| equal(nil,u) ),
inference(spt,[spt(split,[position(s2)])],[481]),
[iquote('1:Spt:912.0,481.0,481.1,481.2,481.3,481.4')] ).
cnf(983,plain,
segmentP(sk2,sk1),
inference(mrr,[status(thm)],[206,980]),
[iquote('1:MRR:206.1,980.0')] ).
cnf(987,plain,
~ neq(sk1,nil),
inference(mrr,[status(thm)],[559,983]),
[iquote('1:MRR:559.0,983.0')] ).
cnf(988,plain,
equal(sk2,sk1),
inference(mrr,[status(thm)],[205,987]),
[iquote('1:MRR:205.0,987.0')] ).
cnf(1068,plain,
~ segmentP(sk1,sk1),
inference(rew,[status(thm),theory(equality)],[988,556]),
[iquote('1:Rew:988.0,556.0')] ).
cnf(1135,plain,
$false,
inference(mrr,[status(thm)],[1068,468]),
[iquote('1:MRR:1068.0,468.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC086-1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.35 % Computer : n022.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 03:51:19 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.60/0.79
% 0.60/0.79 SPASS V 3.9
% 0.60/0.79 SPASS beiseite: Proof found.
% 0.60/0.79 % SZS status Theorem
% 0.60/0.79 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.60/0.79 SPASS derived 861 clauses, backtracked 199 clauses, performed 6 splits and kept 1027 clauses.
% 0.60/0.79 SPASS allocated 76972 KBytes.
% 0.60/0.79 SPASS spent 0:00:00.42 on the problem.
% 0.60/0.79 0:00:00.04 for the input.
% 0.60/0.79 0:00:00.00 for the FLOTTER CNF translation.
% 0.60/0.79 0:00:00.00 for inferences.
% 0.60/0.79 0:00:00.01 for the backtracking.
% 0.60/0.79 0:00:00.20 for the reduction.
% 0.60/0.79
% 0.60/0.79
% 0.60/0.79 Here is a proof with depth 2, length 46 :
% 0.60/0.79 % SZS output start Refutation
% See solution above
% 0.60/0.79 Formulae used in the proof : co1_1 co1_2 co1_5 co1_6 co1_7 co1_8 co1_9 co1_10 co1_11 co1_12 clause56 clause57 clause79 clause177
% 0.60/0.79
%------------------------------------------------------------------------------