TSTP Solution File: SWC358-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC358-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n028.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:32 EDT 2022
% Result : Unsatisfiable 0.20s 0.48s
% Output : Refutation 0.20s
% 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('SWC358-1.p',unknown),
[] ).
cnf(5,axiom,
equal(sk4,sk2),
file('SWC358-1.p',unknown),
[] ).
cnf(6,axiom,
equal(sk3,sk1),
file('SWC358-1.p',unknown),
[] ).
cnf(8,axiom,
~ segmentP(sk2,sk1),
file('SWC358-1.p',unknown),
[] ).
cnf(10,axiom,
( equal(nil,sk4)
| segmentP(sk4,sk3) ),
file('SWC358-1.p',unknown),
[] ).
cnf(12,axiom,
( equal(nil,sk3)
| segmentP(sk4,sk3) ),
file('SWC358-1.p',unknown),
[] ).
cnf(68,axiom,
( ~ ssList(u)
| segmentP(u,nil) ),
file('SWC358-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),
inference(mrr,[status(thm)],[200,8]),
[iquote('0:MRR:200.1,8.0')] ).
cnf(214,plain,
( ~ ssList(u)
| segmentP(u,sk1) ),
inference(rew,[status(thm),theory(equality)],[201,68]),
[iquote('0:Rew:201.0,68.1')] ).
cnf(216,plain,
( equal(sk2,sk1)
| segmentP(sk2,sk1) ),
inference(rew,[status(thm),theory(equality)],[5,10,6,201]),
[iquote('0:Rew:5.0,10.1,6.0,10.1,201.0,10.0,5.0,10.0')] ).
cnf(217,plain,
equal(sk2,sk1),
inference(mrr,[status(thm)],[216,8]),
[iquote('0:MRR:216.1,8.0')] ).
cnf(220,plain,
~ segmentP(sk1,sk1),
inference(rew,[status(thm),theory(equality)],[217,8]),
[iquote('0:Rew:217.0,8.0')] ).
cnf(349,plain,
segmentP(sk1,sk1),
inference(res,[status(thm),theory(equality)],[1,214]),
[iquote('0:Res:1.0,214.0')] ).
cnf(464,plain,
$false,
inference(mrr,[status(thm)],[349,220]),
[iquote('0:MRR:349.0,220.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWC358-1 : TPTP v8.1.0. Released v2.4.0.
% 0.04/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n028.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jun 12 01:12:50 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.48
% 0.20/0.48 SPASS V 3.9
% 0.20/0.48 SPASS beiseite: Proof found.
% 0.20/0.48 % SZS status Theorem
% 0.20/0.48 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.48 SPASS derived 216 clauses, backtracked 0 clauses, performed 0 splits and kept 208 clauses.
% 0.20/0.48 SPASS allocated 76176 KBytes.
% 0.20/0.48 SPASS spent 0:00:00.12 on the problem.
% 0.20/0.48 0:00:00.04 for the input.
% 0.20/0.48 0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.48 0:00:00.00 for inferences.
% 0.20/0.48 0:00:00.00 for the backtracking.
% 0.20/0.48 0:00:00.03 for the reduction.
% 0.20/0.48
% 0.20/0.48
% 0.20/0.48 Here is a proof with depth 1, length 15 :
% 0.20/0.48 % SZS output start Refutation
% See solution above
% 0.20/0.48 Formulae used in the proof : co1_1 co1_5 co1_6 co1_8 co1_10 co1_12 clause56
% 0.20/0.48
%------------------------------------------------------------------------------