TSTP Solution File: SWC044-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC044-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n007.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:19 EDT 2022
% Result : Unsatisfiable 0.19s 0.48s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 13 ( 10 unt; 0 nHn; 13 RR)
% Number of literals : 18 ( 0 equ; 7 neg)
% Maximal clause size : 3 ( 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('SWC044-1.p',unknown),
[] ).
cnf(5,axiom,
equal(nil,sk2),
file('SWC044-1.p',unknown),
[] ).
cnf(6,axiom,
equal(sk2,sk4),
file('SWC044-1.p',unknown),
[] ).
cnf(7,axiom,
equal(sk3,sk1),
file('SWC044-1.p',unknown),
[] ).
cnf(8,axiom,
rearsegP(sk4,sk3),
file('SWC044-1.p',unknown),
[] ).
cnf(9,axiom,
~ equal(nil,sk1),
file('SWC044-1.p',unknown),
[] ).
cnf(91,axiom,
( ~ ssList(u)
| ~ rearsegP(nil,u)
| equal(nil,u) ),
file('SWC044-1.p',unknown),
[] ).
cnf(196,plain,
rearsegP(sk4,sk1),
inference(rew,[status(thm),theory(equality)],[7,8]),
[iquote('0:Rew:7.0,8.0')] ).
cnf(198,plain,
equal(nil,sk4),
inference(rew,[status(thm),theory(equality)],[6,5]),
[iquote('0:Rew:6.0,5.0')] ).
cnf(208,plain,
~ equal(sk4,sk1),
inference(rew,[status(thm),theory(equality)],[198,9]),
[iquote('0:Rew:198.0,9.0')] ).
cnf(228,plain,
( ~ ssList(u)
| ~ rearsegP(sk4,u)
| equal(sk4,u) ),
inference(rew,[status(thm),theory(equality)],[198,91]),
[iquote('0:Rew:198.0,91.2,198.0,91.1')] ).
cnf(498,plain,
( ~ rearsegP(sk4,sk1)
| equal(sk4,sk1) ),
inference(res,[status(thm),theory(equality)],[1,228]),
[iquote('0:Res:1.0,228.0')] ).
cnf(606,plain,
$false,
inference(mrr,[status(thm)],[498,196,208]),
[iquote('0:MRR:498.0,498.1,196.0,208.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWC044-1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n007.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jun 12 19:00:23 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.48
% 0.19/0.48 SPASS V 3.9
% 0.19/0.48 SPASS beiseite: Proof found.
% 0.19/0.48 % SZS status Theorem
% 0.19/0.48 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.48 SPASS derived 354 clauses, backtracked 0 clauses, performed 0 splits and kept 218 clauses.
% 0.19/0.48 SPASS allocated 76391 KBytes.
% 0.19/0.48 SPASS spent 0:00:00.13 on the problem.
% 0.19/0.48 0:00:00.04 for the input.
% 0.19/0.48 0:00:00.00 for the FLOTTER CNF translation.
% 0.19/0.48 0:00:00.00 for inferences.
% 0.19/0.48 0:00:00.00 for the backtracking.
% 0.19/0.48 0:00:00.03 for the reduction.
% 0.19/0.48
% 0.19/0.48
% 0.19/0.48 Here is a proof with depth 1, length 13 :
% 0.19/0.48 % SZS output start Refutation
% See solution above
% 0.19/0.48 Formulae used in the proof : co1_1 co1_5 co1_6 co1_7 co1_8 co1_9 clause82
% 0.19/0.48
%------------------------------------------------------------------------------