TSTP Solution File: SWC038+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC038+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n021.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:17 EDT 2022
% Result : Theorem 0.39s 0.61s
% Output : Refutation 0.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of clauses : 14 ( 8 unt; 2 nHn; 14 RR)
% Number of literals : 22 ( 0 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
ssList(skc4),
file('SWC038+1.p',unknown),
[] ).
cnf(13,axiom,
equal(nil,skc5),
file('SWC038+1.p',unknown),
[] ).
cnf(52,axiom,
~ equal(nil,skc4),
file('SWC038+1.p',unknown),
[] ).
cnf(61,axiom,
( equal(nil,u)
| skP0(u,v) ),
file('SWC038+1.p',unknown),
[] ).
cnf(71,axiom,
( ~ skP0(skc4,skc5)
| frontsegP(skc5,skc4) ),
file('SWC038+1.p',unknown),
[] ).
cnf(92,axiom,
( ~ ssList(u)
| ~ frontsegP(nil,u)
| equal(nil,u) ),
file('SWC038+1.p',unknown),
[] ).
cnf(204,plain,
~ equal(skc5,skc4),
inference(rew,[status(thm),theory(equality)],[13,52]),
[iquote('0:Rew:13.0,52.0')] ).
cnf(208,plain,
( skP0(u,v)
| equal(skc5,u) ),
inference(rew,[status(thm),theory(equality)],[13,61]),
[iquote('0:Rew:13.0,61.0')] ).
cnf(230,plain,
( ~ ssList(u)
| ~ frontsegP(skc5,u)
| equal(skc5,u) ),
inference(rew,[status(thm),theory(equality)],[13,92]),
[iquote('0:Rew:13.0,92.2,13.0,92.1')] ).
cnf(323,plain,
( ~ frontsegP(skc5,skc4)
| equal(skc5,skc4) ),
inference(res,[status(thm),theory(equality)],[2,230]),
[iquote('0:Res:2.0,230.0')] ).
cnf(600,plain,
~ frontsegP(skc5,skc4),
inference(mrr,[status(thm)],[323,204]),
[iquote('0:MRR:323.1,204.0')] ).
cnf(601,plain,
~ skP0(skc4,skc5),
inference(mrr,[status(thm)],[71,600]),
[iquote('0:MRR:71.1,600.0')] ).
cnf(686,plain,
equal(skc5,skc4),
inference(res,[status(thm),theory(equality)],[208,601]),
[iquote('0:Res:208.0,601.0')] ).
cnf(687,plain,
$false,
inference(mrr,[status(thm)],[686,204]),
[iquote('0:MRR:686.0,204.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWC038+1 : TPTP v8.1.0. Released v2.4.0.
% 0.04/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n021.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 03:33:10 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.39/0.61
% 0.39/0.61 SPASS V 3.9
% 0.39/0.61 SPASS beiseite: Proof found.
% 0.39/0.61 % SZS status Theorem
% 0.39/0.61 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.39/0.61 SPASS derived 368 clauses, backtracked 0 clauses, performed 5 splits and kept 450 clauses.
% 0.39/0.61 SPASS allocated 98456 KBytes.
% 0.39/0.61 SPASS spent 0:00:00.26 on the problem.
% 0.39/0.61 0:00:00.04 for the input.
% 0.39/0.61 0:00:00.07 for the FLOTTER CNF translation.
% 0.39/0.61 0:00:00.00 for inferences.
% 0.39/0.61 0:00:00.00 for the backtracking.
% 0.39/0.61 0:00:00.03 for the reduction.
% 0.39/0.61
% 0.39/0.61
% 0.39/0.61 Here is a proof with depth 1, length 14 :
% 0.39/0.61 % SZS output start Refutation
% See solution above
% 0.39/0.61 Formulae used in the proof : co1 ax46
% 0.39/0.61
%------------------------------------------------------------------------------