TSTP Solution File: SWC367-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC367-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:03:36 EDT 2022
% Result : Unsatisfiable 0.18s 0.46s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 15 ( 9 unt; 4 nHn; 15 RR)
% Number of literals : 21 ( 0 equ; 4 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 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('SWC367-1.p',unknown),
[] ).
cnf(5,axiom,
equal(sk4,sk2),
file('SWC367-1.p',unknown),
[] ).
cnf(6,axiom,
equal(sk3,sk1),
file('SWC367-1.p',unknown),
[] ).
cnf(7,axiom,
~ rearsegP(sk2,sk1),
file('SWC367-1.p',unknown),
[] ).
cnf(9,axiom,
( equal(nil,sk4)
| rearsegP(sk4,sk3) ),
file('SWC367-1.p',unknown),
[] ).
cnf(11,axiom,
( equal(nil,sk3)
| rearsegP(sk4,sk3) ),
file('SWC367-1.p',unknown),
[] ).
cnf(69,axiom,
( ~ ssList(u)
| rearsegP(u,nil) ),
file('SWC367-1.p',unknown),
[] ).
cnf(199,plain,
( equal(nil,sk1)
| rearsegP(sk2,sk1) ),
inference(rew,[status(thm),theory(equality)],[5,11,6]),
[iquote('0:Rew:5.0,11.1,6.0,11.1,6.0,11.0')] ).
cnf(200,plain,
equal(nil,sk1),
inference(mrr,[status(thm)],[199,7]),
[iquote('0:MRR:199.1,7.0')] ).
cnf(211,plain,
( ~ ssList(u)
| rearsegP(u,sk1) ),
inference(rew,[status(thm),theory(equality)],[200,69]),
[iquote('0:Rew:200.0,69.1')] ).
cnf(214,plain,
( equal(sk2,sk1)
| rearsegP(sk2,sk1) ),
inference(rew,[status(thm),theory(equality)],[5,9,6,200]),
[iquote('0:Rew:5.0,9.1,6.0,9.1,200.0,9.0,5.0,9.0')] ).
cnf(215,plain,
equal(sk2,sk1),
inference(mrr,[status(thm)],[214,7]),
[iquote('0:MRR:214.1,7.0')] ).
cnf(218,plain,
~ rearsegP(sk1,sk1),
inference(rew,[status(thm),theory(equality)],[215,7]),
[iquote('0:Rew:215.0,7.0')] ).
cnf(347,plain,
rearsegP(sk1,sk1),
inference(res,[status(thm),theory(equality)],[1,211]),
[iquote('0:Res:1.0,211.0')] ).
cnf(461,plain,
$false,
inference(mrr,[status(thm)],[347,218]),
[iquote('0:MRR:347.0,218.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWC367-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n013.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 09:02:58 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.46
% 0.18/0.46 SPASS V 3.9
% 0.18/0.46 SPASS beiseite: Proof found.
% 0.18/0.46 % SZS status Theorem
% 0.18/0.46 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.46 SPASS derived 214 clauses, backtracked 0 clauses, performed 0 splits and kept 206 clauses.
% 0.18/0.46 SPASS allocated 76174 KBytes.
% 0.18/0.46 SPASS spent 0:00:00.12 on the problem.
% 0.18/0.46 0:00:00.04 for the input.
% 0.18/0.46 0:00:00.00 for the FLOTTER CNF translation.
% 0.18/0.46 0:00:00.00 for inferences.
% 0.18/0.46 0:00:00.00 for the backtracking.
% 0.18/0.46 0:00:00.03 for the reduction.
% 0.18/0.46
% 0.18/0.46
% 0.18/0.46 Here is a proof with depth 1, length 15 :
% 0.18/0.46 % SZS output start Refutation
% See solution above
% 0.18/0.46 Formulae used in the proof : co1_1 co1_5 co1_6 co1_7 co1_9 co1_11 clause58
% 0.18/0.46
%------------------------------------------------------------------------------