TSTP Solution File: KRS125+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : KRS125+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n024.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:38 EDT 2022
% Result : Unsatisfiable 0.19s 0.44s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 13 ( 3 unt; 0 nHn; 13 RR)
% Number of literals : 23 ( 0 equ; 15 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 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_22_17947),
file('KRS125+1.p',unknown),
[] ).
cnf(5,axiom,
( ~ cUnsatisfiable(u)
| ce3(u) ),
file('KRS125+1.p',unknown),
[] ).
cnf(6,axiom,
( ~ cUnsatisfiable(u)
| cf(u) ),
file('KRS125+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ cc(u)
| cdxcomp(u) ),
file('KRS125+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ ce3(u)
| cc(u) ),
file('KRS125+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ cf(u)
| cd(u) ),
file('KRS125+1.p',unknown),
[] ).
cnf(17,axiom,
( ~ cd(u)
| ~ ra_Px1(u,v) ),
file('KRS125+1.p',unknown),
[] ).
cnf(18,axiom,
( ~ cdxcomp(u)
| ra_Px1(u,skf5(u)) ),
file('KRS125+1.p',unknown),
[] ).
cnf(48,plain,
( ~ cdxcomp(u)
| ~ cd(u) ),
inference(res,[status(thm),theory(equality)],[18,17]),
[iquote('0:Res:18.1,17.1')] ).
cnf(49,plain,
( ~ cc(u)
| ~ cf(u) ),
inference(ems,[status(thm)],[48,7,11]),
[iquote('0:EmS:48.0,48.1,7.1,11.1')] ).
cnf(51,plain,
( ~ ce3(u)
| ~ cUnsatisfiable(u) ),
inference(ems,[status(thm)],[49,10,6]),
[iquote('0:EmS:49.0,49.1,10.1,6.1')] ).
cnf(52,plain,
~ cUnsatisfiable(u),
inference(ssi,[status(thm)],[51,5]),
[iquote('0:SSi:51.0,5.1')] ).
cnf(53,plain,
$false,
inference(unc,[status(thm)],[52,2]),
[iquote('0:UnC:52.0,2.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : KRS125+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n024.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jun 7 17:20:34 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.44
% 0.19/0.44 SPASS V 3.9
% 0.19/0.44 SPASS beiseite: Proof found.
% 0.19/0.44 % SZS status Theorem
% 0.19/0.44 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.44 SPASS derived 13 clauses, backtracked 0 clauses, performed 0 splits and kept 27 clauses.
% 0.19/0.44 SPASS allocated 97598 KBytes.
% 0.19/0.44 SPASS spent 0:00:00.09 on the problem.
% 0.19/0.44 0:00:00.04 for the input.
% 0.19/0.44 0:00:00.03 for the FLOTTER CNF translation.
% 0.19/0.44 0:00:00.00 for inferences.
% 0.19/0.44 0:00:00.00 for the backtracking.
% 0.19/0.44 0:00:00.00 for the reduction.
% 0.19/0.44
% 0.19/0.44
% 0.19/0.44 Here is a proof with depth 3, length 13 :
% 0.19/0.44 % SZS output start Refutation
% See solution above
% 0.19/0.44 Formulae used in the proof : axiom_12 axiom_2 axiom_3 axiom_10 axiom_11 axiom_6 axiom_7
% 0.19/0.44
%------------------------------------------------------------------------------