TSTP Solution File: SWC102-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC102-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n012.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:44 EDT 2022
% Result : Unsatisfiable 0.18s 0.46s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 14 ( 11 unt; 0 nHn; 14 RR)
% Number of literals : 17 ( 0 equ; 6 neg)
% Maximal clause size : 2 ( 1 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('SWC102-1.p',unknown),
[] ).
cnf(5,axiom,
equal(sk4,sk2),
file('SWC102-1.p',unknown),
[] ).
cnf(6,axiom,
equal(sk3,sk1),
file('SWC102-1.p',unknown),
[] ).
cnf(7,axiom,
equal(sk4,sk3),
file('SWC102-1.p',unknown),
[] ).
cnf(8,axiom,
neq(sk2,nil),
file('SWC102-1.p',unknown),
[] ).
cnf(9,axiom,
( ~ neq(sk1,nil)
| ~ frontsegP(sk2,sk1) ),
file('SWC102-1.p',unknown),
[] ).
cnf(70,axiom,
( ~ ssList(u)
| frontsegP(u,u) ),
file('SWC102-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(200,plain,
neq(sk1,nil),
inference(rew,[status(thm),theory(equality)],[198,8]),
[iquote('0:Rew:198.0,8.0')] ).
cnf(202,plain,
( ~ neq(sk1,nil)
| ~ frontsegP(sk1,sk1) ),
inference(rew,[status(thm),theory(equality)],[198,9]),
[iquote('0:Rew:198.0,9.1')] ).
cnf(203,plain,
~ frontsegP(sk1,sk1),
inference(mrr,[status(thm)],[202,200]),
[iquote('0:MRR:202.0,200.0')] ).
cnf(295,plain,
frontsegP(sk1,sk1),
inference(res,[status(thm),theory(equality)],[1,70]),
[iquote('0:Res:1.0,70.0')] ).
cnf(399,plain,
$false,
inference(mrr,[status(thm)],[295,203]),
[iquote('0:MRR:295.0,203.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SWC102-1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n012.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 : Sat Jun 11 20:34:56 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/sandbox2/benchmark/theBenchmark.p
% 0.18/0.46 SPASS derived 197 clauses, backtracked 0 clauses, performed 0 splits and kept 200 clauses.
% 0.18/0.46 SPASS allocated 76120 KBytes.
% 0.18/0.46 SPASS spent 0:00:00.11 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 14 :
% 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_8 co1_9 clause61
% 0.18/0.46
%------------------------------------------------------------------------------