TSTP Solution File: KRS124+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : KRS124+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.20s 0.45s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 14 ( 4 unt; 0 nHn; 14 RR)
% Number of literals : 25 ( 0 equ; 17 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
cUnsatisfiable(i2003_11_14_17_22_10903),
file('KRS124+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ cc(u)
| cdxcomp(u) ),
file('KRS124+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ ca_Ax3(u)
| cd(u) ),
file('KRS124+1.p',unknown),
[] ).
cnf(13,axiom,
( ~ ca_Ax3(u)
| cc(u) ),
file('KRS124+1.p',unknown),
[] ).
cnf(19,axiom,
( ~ cUnsatisfiable(u)
| rr(u,skf6(u)) ),
file('KRS124+1.p',unknown),
[] ).
cnf(20,axiom,
( ~ cd(u)
| ~ ra_Px1(u,v) ),
file('KRS124+1.p',unknown),
[] ).
cnf(21,axiom,
( ~ cdxcomp(u)
| ra_Px1(u,skf9(u)) ),
file('KRS124+1.p',unknown),
[] ).
cnf(25,axiom,
( ~ cUnsatisfiable(u)
| ~ rr(u,v)
| ca_Ax3(v) ),
file('KRS124+1.p',unknown),
[] ).
cnf(56,plain,
( ~ cdxcomp(u)
| ~ cd(u) ),
inference(res,[status(thm),theory(equality)],[21,20]),
[iquote('0:Res:21.1,20.1')] ).
cnf(59,plain,
( ~ cc(u)
| ~ ca_Ax3(u) ),
inference(ems,[status(thm)],[56,7,12]),
[iquote('0:EmS:56.0,56.1,7.1,12.1')] ).
cnf(61,plain,
~ ca_Ax3(u),
inference(ssi,[status(thm)],[59,13]),
[iquote('0:SSi:59.0,13.1')] ).
cnf(63,plain,
( ~ cUnsatisfiable(u)
| ~ rr(u,v) ),
inference(mrr,[status(thm)],[25,61]),
[iquote('0:MRR:25.2,61.0')] ).
cnf(64,plain,
~ cUnsatisfiable(u),
inference(mrr,[status(thm)],[19,63]),
[iquote('0:MRR:19.1,63.1')] ).
cnf(66,plain,
$false,
inference(unc,[status(thm)],[64,2]),
[iquote('0:UnC:64.0,2.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : KRS124+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.13 % Command : run_spass %d %s
% 0.13/0.35 % Computer : n024.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Tue Jun 7 09:28:35 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.45
% 0.20/0.45 SPASS V 3.9
% 0.20/0.45 SPASS beiseite: Proof found.
% 0.20/0.45 % SZS status Theorem
% 0.20/0.45 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.45 SPASS derived 18 clauses, backtracked 0 clauses, performed 0 splits and kept 34 clauses.
% 0.20/0.45 SPASS allocated 97726 KBytes.
% 0.20/0.45 SPASS spent 0:00:00.09 on the problem.
% 0.20/0.45 0:00:00.04 for the input.
% 0.20/0.45 0:00:00.03 for the FLOTTER CNF translation.
% 0.20/0.45 0:00:00.00 for inferences.
% 0.20/0.45 0:00:00.00 for the backtracking.
% 0.20/0.45 0:00:00.00 for the reduction.
% 0.20/0.45
% 0.20/0.45
% 0.20/0.45 Here is a proof with depth 2, length 14 :
% 0.20/0.45 % SZS output start Refutation
% See solution above
% 0.20/0.45 Formulae used in the proof : axiom_13 axiom_3 axiom_12 axiom_2 axiom_0 axiom_7 axiom_6
% 0.20/0.45
%------------------------------------------------------------------------------