TSTP Solution File: SWC019-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC019-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n024.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:07 EDT 2022
% Result : Unsatisfiable 0.55s 0.72s
% Output : Refutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 16
% Syntax : Number of clauses : 29 ( 19 unt; 2 nHn; 29 RR)
% Number of literals : 47 ( 0 equ; 24 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 12 ( 11 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
ssList(sk1),
file('SWC019-1.p',unknown),
[] ).
cnf(5,axiom,
equal(sk4,sk2),
file('SWC019-1.p',unknown),
[] ).
cnf(6,axiom,
equal(sk3,sk1),
file('SWC019-1.p',unknown),
[] ).
cnf(7,axiom,
equal(sk4,sk3),
file('SWC019-1.p',unknown),
[] ).
cnf(8,axiom,
( ~ ssList(u)
| ~ neq(u,nil)
| ~ frontsegP(sk2,u)
| ~ frontsegP(sk1,u) ),
file('SWC019-1.p',unknown),
[] ).
cnf(9,axiom,
( ~ equal(nil,sk2)
| ~ equal(nil,sk1) ),
file('SWC019-1.p',unknown),
[] ).
cnf(10,axiom,
equalelemsP(nil),
file('SWC019-1.p',unknown),
[] ).
cnf(11,axiom,
duplicatefreeP(nil),
file('SWC019-1.p',unknown),
[] ).
cnf(12,axiom,
strictorderedP(nil),
file('SWC019-1.p',unknown),
[] ).
cnf(13,axiom,
totalorderedP(nil),
file('SWC019-1.p',unknown),
[] ).
cnf(14,axiom,
strictorderP(nil),
file('SWC019-1.p',unknown),
[] ).
cnf(15,axiom,
totalorderP(nil),
file('SWC019-1.p',unknown),
[] ).
cnf(16,axiom,
cyclefreeP(nil),
file('SWC019-1.p',unknown),
[] ).
cnf(17,axiom,
ssList(nil),
file('SWC019-1.p',unknown),
[] ).
cnf(70,axiom,
( ~ ssList(u)
| frontsegP(u,u) ),
file('SWC019-1.p',unknown),
[] ).
cnf(109,axiom,
( ~ ssList(u)
| ~ ssList(v)
| equal(u,v)
| neq(u,v) ),
file('SWC019-1.p',unknown),
[] ).
cnf(197,plain,
equal(sk4,sk1),
inference(rew,[status(thm),theory(equality)],[6,7]),
[iquote('0:Rew:6.0,7.0')] ).
cnf(198,plain,
equal(sk2,sk1),
inference(rew,[status(thm),theory(equality)],[5,197]),
[iquote('0:Rew:5.0,197.0')] ).
cnf(201,plain,
( ~ equal(nil,sk1)
| ~ equal(nil,sk1) ),
inference(rew,[status(thm),theory(equality)],[198,9]),
[iquote('0:Rew:198.0,9.0')] ).
cnf(202,plain,
~ equal(nil,sk1),
inference(obv,[status(thm),theory(equality)],[201]),
[iquote('0:Obv:201.0')] ).
cnf(203,plain,
( ~ ssList(u)
| ~ neq(u,nil)
| ~ frontsegP(sk1,u)
| ~ frontsegP(sk1,u) ),
inference(rew,[status(thm),theory(equality)],[198,8]),
[iquote('0:Rew:198.0,8.2')] ).
cnf(204,plain,
( ~ ssList(u)
| ~ neq(u,nil)
| ~ frontsegP(sk1,u) ),
inference(obv,[status(thm),theory(equality)],[203]),
[iquote('0:Obv:203.2')] ).
cnf(261,plain,
( ~ neq(sk1,nil)
| ~ frontsegP(sk1,sk1) ),
inference(res,[status(thm),theory(equality)],[1,204]),
[iquote('0:Res:1.0,204.0')] ).
cnf(297,plain,
frontsegP(sk1,sk1),
inference(res,[status(thm),theory(equality)],[1,70]),
[iquote('0:Res:1.0,70.0')] ).
cnf(345,plain,
( ~ ssList(u)
| equal(sk1,u)
| neq(sk1,u) ),
inference(res,[status(thm),theory(equality)],[1,109]),
[iquote('0:Res:1.0,109.1')] ).
cnf(406,plain,
~ neq(sk1,nil),
inference(mrr,[status(thm)],[261,297]),
[iquote('0:MRR:261.1,297.0')] ).
cnf(786,plain,
( ~ ssList(nil)
| equal(nil,sk1) ),
inference(res,[status(thm),theory(equality)],[345,406]),
[iquote('0:Res:345.2,406.0')] ).
cnf(787,plain,
equal(nil,sk1),
inference(ssi,[status(thm)],[786,10,11,16,15,14,13,12,17]),
[iquote('0:SSi:786.0,10.0,11.0,16.0,15.0,14.0,13.0,12.0,17.0')] ).
cnf(788,plain,
$false,
inference(mrr,[status(thm)],[787,202]),
[iquote('0:MRR:787.0,202.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWC019-1 : TPTP v8.1.0. Released v2.4.0.
% 0.08/0.14 % Command : run_spass %d %s
% 0.14/0.36 % Computer : n024.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Sat Jun 11 21:52:34 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.55/0.72
% 0.55/0.72 SPASS V 3.9
% 0.55/0.72 SPASS beiseite: Proof found.
% 0.55/0.72 % SZS status Theorem
% 0.55/0.72 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.55/0.72 SPASS derived 534 clauses, backtracked 351 clauses, performed 17 splits and kept 1008 clauses.
% 0.55/0.72 SPASS allocated 76520 KBytes.
% 0.55/0.72 SPASS spent 0:00:00.35 on the problem.
% 0.55/0.72 0:00:00.04 for the input.
% 0.55/0.72 0:00:00.00 for the FLOTTER CNF translation.
% 0.55/0.72 0:00:00.00 for inferences.
% 0.55/0.72 0:00:00.00 for the backtracking.
% 0.55/0.72 0:00:00.21 for the reduction.
% 0.55/0.72
% 0.55/0.72
% 0.55/0.72 Here is a proof with depth 2, length 29 :
% 0.55/0.72 % SZS output start Refutation
% See solution above
% 0.55/0.72 Formulae used in the proof : co1_1 co1_5 co1_6 co1_7 co1_8 co1_9 clause1 clause2 clause3 clause4 clause5 clause6 clause7 clause8 clause61 clause100
% 0.55/0.72
%------------------------------------------------------------------------------