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 : n025.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:16 EDT 2022
% Result : Unsatisfiable 0.20s 0.49s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 7
% Syntax : Number of clauses : 13 ( 8 unt; 2 nHn; 13 RR)
% Number of literals : 20 ( 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('SWC038-1.p',unknown),
[] ).
cnf(5,axiom,
equal(nil,sk2),
file('SWC038-1.p',unknown),
[] ).
cnf(6,axiom,
equal(sk4,sk2),
file('SWC038-1.p',unknown),
[] ).
cnf(7,axiom,
equal(sk3,sk1),
file('SWC038-1.p',unknown),
[] ).
cnf(8,axiom,
~ equal(nil,sk1),
file('SWC038-1.p',unknown),
[] ).
cnf(12,axiom,
( equal(nil,sk3)
| frontsegP(sk4,sk3) ),
file('SWC038-1.p',unknown),
[] ).
cnf(96,axiom,
( ~ ssList(u)
| ~ frontsegP(nil,u)
| equal(nil,u) ),
file('SWC038-1.p',unknown),
[] ).
cnf(209,plain,
~ equal(sk2,sk1),
inference(rew,[status(thm),theory(equality)],[5,8]),
[iquote('0:Rew:5.0,8.0')] ).
cnf(213,plain,
( equal(sk2,sk1)
| frontsegP(sk2,sk1) ),
inference(rew,[status(thm),theory(equality)],[6,12,7,5]),
[iquote('0:Rew:6.0,12.1,7.0,12.1,5.0,12.0,7.0,12.0')] ).
cnf(214,plain,
frontsegP(sk2,sk1),
inference(mrr,[status(thm)],[213,209]),
[iquote('0:MRR:213.0,209.0')] ).
cnf(233,plain,
( ~ ssList(u)
| ~ frontsegP(sk2,u)
| equal(sk2,u) ),
inference(rew,[status(thm),theory(equality)],[5,96]),
[iquote('0:Rew:5.0,96.2,5.0,96.1')] ).
cnf(507,plain,
( ~ frontsegP(sk2,sk1)
| equal(sk2,sk1) ),
inference(res,[status(thm),theory(equality)],[1,233]),
[iquote('0:Res:1.0,233.0')] ).
cnf(614,plain,
$false,
inference(mrr,[status(thm)],[507,214,209]),
[iquote('0:MRR:507.0,507.1,214.0,209.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC038-1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n025.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 22:16:08 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.49
% 0.20/0.49 SPASS V 3.9
% 0.20/0.49 SPASS beiseite: Proof found.
% 0.20/0.49 % SZS status Theorem
% 0.20/0.49 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.49 SPASS derived 353 clauses, backtracked 0 clauses, performed 0 splits and kept 219 clauses.
% 0.20/0.49 SPASS allocated 76396 KBytes.
% 0.20/0.49 SPASS spent 0:00:00.13 on the problem.
% 0.20/0.49 0:00:00.04 for the input.
% 0.20/0.49 0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.49 0:00:00.00 for inferences.
% 0.20/0.49 0:00:00.00 for the backtracking.
% 0.20/0.49 0:00:00.03 for the reduction.
% 0.20/0.49
% 0.20/0.49
% 0.20/0.49 Here is a proof with depth 1, length 13 :
% 0.20/0.49 % SZS output start Refutation
% See solution above
% 0.20/0.49 Formulae used in the proof : co1_1 co1_5 co1_6 co1_7 co1_8 co1_12 clause84
% 0.20/0.49
%------------------------------------------------------------------------------