TSTP Solution File: SWC047-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC047-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n025.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:21 EDT 2022
% Result : Unsatisfiable 0.18s 0.47s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of clauses : 24 ( 12 unt; 2 nHn; 24 RR)
% Number of literals : 51 ( 0 equ; 32 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
ssList(sk1),
file('SWC047-1.p',unknown),
[] ).
cnf(5,axiom,
equal(sk2,sk4),
file('SWC047-1.p',unknown),
[] ).
cnf(6,axiom,
equal(sk3,sk1),
file('SWC047-1.p',unknown),
[] ).
cnf(7,axiom,
equal(sk4,sk3),
file('SWC047-1.p',unknown),
[] ).
cnf(8,axiom,
( equal(nil,sk2)
| neq(sk2,nil) ),
file('SWC047-1.p',unknown),
[] ).
cnf(9,axiom,
( ~ ssList(u)
| ~ neq(u,nil)
| ~ rearsegP(sk2,u)
| ~ rearsegP(sk1,u)
| equal(nil,sk2) ),
file('SWC047-1.p',unknown),
[] ).
cnf(10,axiom,
( ~ equal(nil,sk1)
| neq(sk2,nil) ),
file('SWC047-1.p',unknown),
[] ).
cnf(11,axiom,
( ~ ssList(u)
| ~ equal(nil,sk1)
| ~ neq(u,nil)
| ~ rearsegP(sk2,u)
| ~ rearsegP(sk1,u) ),
file('SWC047-1.p',unknown),
[] ).
cnf(70,axiom,
( ~ ssList(u)
| rearsegP(u,u) ),
file('SWC047-1.p',unknown),
[] ).
cnf(199,plain,
equal(sk4,sk1),
inference(rew,[status(thm),theory(equality)],[6,7]),
[iquote('0:Rew:6.0,7.0')] ).
cnf(201,plain,
equal(sk2,sk1),
inference(rew,[status(thm),theory(equality)],[199,5]),
[iquote('0:Rew:199.0,5.0')] ).
cnf(203,plain,
( equal(nil,sk1)
| neq(sk1,nil) ),
inference(rew,[status(thm),theory(equality)],[201,8]),
[iquote('0:Rew:201.0,8.1,201.0,8.0')] ).
cnf(204,plain,
( ~ equal(nil,sk1)
| neq(sk1,nil) ),
inference(rew,[status(thm),theory(equality)],[201,10]),
[iquote('0:Rew:201.0,10.1')] ).
cnf(205,plain,
( ~ ssList(u)
| ~ neq(u,nil)
| ~ rearsegP(sk1,u)
| ~ rearsegP(sk1,u)
| equal(nil,sk1) ),
inference(rew,[status(thm),theory(equality)],[201,9]),
[iquote('0:Rew:201.0,9.4,201.0,9.2')] ).
cnf(206,plain,
( ~ ssList(u)
| ~ neq(u,nil)
| ~ rearsegP(sk1,u)
| equal(nil,sk1) ),
inference(obv,[status(thm),theory(equality)],[205]),
[iquote('0:Obv:205.2')] ).
cnf(207,plain,
( ~ ssList(u)
| ~ equal(sk1,sk1)
| ~ neq(u,nil)
| ~ rearsegP(sk1,u)
| ~ rearsegP(sk1,u) ),
inference(rew,[status(thm),theory(equality)],[201,11,206]),
[iquote('0:Rew:201.0,11.3,206.3,11.1')] ).
cnf(208,plain,
( ~ ssList(u)
| ~ neq(u,nil)
| ~ rearsegP(sk1,u) ),
inference(obv,[status(thm),theory(equality)],[207]),
[iquote('0:Obv:207.3')] ).
cnf(244,plain,
( ~ neq(sk1,nil)
| ~ rearsegP(sk1,sk1) ),
inference(res,[status(thm),theory(equality)],[1,208]),
[iquote('0:Res:1.0,208.0')] ).
cnf(299,plain,
rearsegP(sk1,sk1),
inference(res,[status(thm),theory(equality)],[1,70]),
[iquote('0:Res:1.0,70.0')] ).
cnf(405,plain,
~ neq(sk1,nil),
inference(mrr,[status(thm)],[244,299]),
[iquote('0:MRR:244.1,299.0')] ).
cnf(406,plain,
equal(nil,sk1),
inference(mrr,[status(thm)],[203,405]),
[iquote('0:MRR:203.1,405.0')] ).
cnf(407,plain,
~ equal(nil,sk1),
inference(mrr,[status(thm)],[204,405]),
[iquote('0:MRR:204.1,405.0')] ).
cnf(466,plain,
~ equal(sk1,sk1),
inference(rew,[status(thm),theory(equality)],[406,407]),
[iquote('0:Rew:406.0,407.0')] ).
cnf(467,plain,
$false,
inference(obv,[status(thm),theory(equality)],[466]),
[iquote('0:Obv:466.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SWC047-1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n025.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 04:49:23 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.47
% 0.18/0.47 SPASS V 3.9
% 0.18/0.47 SPASS beiseite: Proof found.
% 0.18/0.47 % SZS status Theorem
% 0.18/0.47 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.47 SPASS derived 258 clauses, backtracked 0 clauses, performed 0 splits and kept 229 clauses.
% 0.18/0.47 SPASS allocated 76180 KBytes.
% 0.18/0.47 SPASS spent 0:00:00.12 on the problem.
% 0.18/0.47 0:00:00.04 for the input.
% 0.18/0.47 0:00:00.00 for the FLOTTER CNF translation.
% 0.18/0.47 0:00:00.00 for inferences.
% 0.18/0.47 0:00:00.00 for the backtracking.
% 0.18/0.47 0:00:00.03 for the reduction.
% 0.18/0.47
% 0.18/0.47
% 0.18/0.47 Here is a proof with depth 1, length 24 :
% 0.18/0.47 % SZS output start Refutation
% See solution above
% 0.18/0.47 Formulae used in the proof : co1_1 co1_5 co1_6 co1_7 co1_8 co1_9 co1_10 co1_11 clause59
% 0.18/0.47
%------------------------------------------------------------------------------