TSTP Solution File: KRS074+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : KRS074+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n019.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 : Sun Jul 17 03:30:28 EDT 2022
% Result : Unsatisfiable 0.21s 0.45s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 8 ( 4 unt; 0 nHn; 8 RR)
% Number of literals : 14 ( 0 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
cUnsatisfiable(i2003_11_14_17_18_59896),
file('KRS074+1.p',unknown),
[] ).
cnf(6,axiom,
cp(skf3(u)),
file('KRS074+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ cUnsatisfiable(u)
| rs(u,skf3(u)) ),
file('KRS074+1.p',unknown),
[] ).
cnf(19,axiom,
( ~ cUnsatisfiable(u)
| ~ cp(v)
| ~ rs(u,v) ),
file('KRS074+1.p',unknown),
[] ).
cnf(29,plain,
( ~ cUnsatisfiable(u)
| ~ cUnsatisfiable(u)
| ~ cp(skf3(u)) ),
inference(res,[status(thm),theory(equality)],[9,19]),
[iquote('0:Res:9.1,19.2')] ).
cnf(31,plain,
( ~ cUnsatisfiable(u)
| ~ cp(skf3(u)) ),
inference(obv,[status(thm),theory(equality)],[29]),
[iquote('0:Obv:29.0')] ).
cnf(32,plain,
~ cUnsatisfiable(u),
inference(ssi,[status(thm)],[31,6]),
[iquote('0:SSi:31.1,6.0')] ).
cnf(33,plain,
$false,
inference(unc,[status(thm)],[32,2]),
[iquote('0:UnC:32.0,2.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : KRS074+1 : TPTP v8.1.0. Released v3.1.0.
% 0.12/0.13 % Command : run_spass %d %s
% 0.14/0.35 % Computer : n019.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Tue Jun 7 18:22:40 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.45
% 0.21/0.45 SPASS V 3.9
% 0.21/0.45 SPASS beiseite: Proof found.
% 0.21/0.45 % SZS status Theorem
% 0.21/0.45 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.45 SPASS derived 6 clauses, backtracked 0 clauses, performed 0 splits and kept 26 clauses.
% 0.21/0.45 SPASS allocated 97899 KBytes.
% 0.21/0.45 SPASS spent 0:00:00.09 on the problem.
% 0.21/0.45 0:00:00.03 for the input.
% 0.21/0.45 0:00:00.04 for the FLOTTER CNF translation.
% 0.21/0.45 0:00:00.00 for inferences.
% 0.21/0.45 0:00:00.00 for the backtracking.
% 0.21/0.45 0:00:00.00 for the reduction.
% 0.21/0.45
% 0.21/0.45
% 0.21/0.45 Here is a proof with depth 1, length 8 :
% 0.21/0.45 % SZS output start Refutation
% See solution above
% 0.21/0.45 Formulae used in the proof : axiom_9 axiom_2
% 0.21/0.45
%------------------------------------------------------------------------------