TSTP Solution File: KRS110+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : KRS110+1 : TPTP v8.1.0. Released v3.1.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 : Sun Jul 17 03:30:35 EDT 2022
% Result : Unsatisfiable 0.12s 0.37s
% Output : Refutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 13 ( 4 unt; 0 nHn; 13 RR)
% Number of literals : 24 ( 0 equ; 15 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 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_21_12565),
file('KRS110+1.p',unknown),
[] ).
cnf(4,axiom,
ca_Ax2(skf5(u)),
file('KRS110+1.p',unknown),
[] ).
cnf(8,axiom,
( ~ ca_Ax2(u)
| cp(u) ),
file('KRS110+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ cUnsatisfiable(u)
| rs(u,skf5(u)) ),
file('KRS110+1.p',unknown),
[] ).
cnf(13,axiom,
( ~ cp(u)
| ~ ra_Px1(u,v) ),
file('KRS110+1.p',unknown),
[] ).
cnf(14,axiom,
( ~ cpxcomp(u)
| ra_Px1(u,skf8(u)) ),
file('KRS110+1.p',unknown),
[] ).
cnf(24,axiom,
( ~ cUnsatisfiable(u)
| ~ rs(u,v)
| cpxcomp(v) ),
file('KRS110+1.p',unknown),
[] ).
cnf(34,plain,
( ~ cpxcomp(u)
| ~ cp(u) ),
inference(res,[status(thm),theory(equality)],[14,13]),
[iquote('0:Res:14.1,13.1')] ).
cnf(42,plain,
( ~ cUnsatisfiable(u)
| ~ cUnsatisfiable(u)
| cpxcomp(skf5(u)) ),
inference(res,[status(thm),theory(equality)],[12,24]),
[iquote('0:Res:12.1,24.1')] ).
cnf(44,plain,
( ~ cUnsatisfiable(u)
| cpxcomp(skf5(u)) ),
inference(obv,[status(thm),theory(equality)],[42]),
[iquote('0:Obv:42.0')] ).
cnf(45,plain,
( ~ cUnsatisfiable(u)
| ~ ca_Ax2(skf5(u)) ),
inference(ems,[status(thm)],[34,44,8]),
[iquote('0:EmS:34.0,34.1,44.1,8.1')] ).
cnf(46,plain,
~ cUnsatisfiable(u),
inference(ssi,[status(thm)],[45,4,44]),
[iquote('0:SSi:45.1,4.1,44.0')] ).
cnf(47,plain,
$false,
inference(unc,[status(thm)],[46,2]),
[iquote('0:UnC:46.0,2.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : KRS110+1 : TPTP v8.1.0. Released v3.1.0.
% 0.00/0.09 % Command : run_spass %d %s
% 0.08/0.28 % Computer : n025.cluster.edu
% 0.08/0.28 % Model : x86_64 x86_64
% 0.08/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28 % Memory : 8042.1875MB
% 0.08/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28 % CPULimit : 300
% 0.08/0.28 % WCLimit : 600
% 0.08/0.28 % DateTime : Tue Jun 7 07:03:18 EDT 2022
% 0.12/0.28 % CPUTime :
% 0.12/0.37
% 0.12/0.37 SPASS V 3.9
% 0.12/0.37 SPASS beiseite: Proof found.
% 0.12/0.37 % SZS status Theorem
% 0.12/0.37 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 SPASS derived 15 clauses, backtracked 0 clauses, performed 0 splits and kept 36 clauses.
% 0.12/0.37 SPASS allocated 97788 KBytes.
% 0.12/0.37 SPASS spent 0:00:00.08 on the problem.
% 0.12/0.37 0:00:00.03 for the input.
% 0.12/0.37 0:00:00.03 for the FLOTTER CNF translation.
% 0.12/0.37 0:00:00.00 for inferences.
% 0.12/0.37 0:00:00.00 for the backtracking.
% 0.12/0.37 0:00:00.00 for the reduction.
% 0.12/0.37
% 0.12/0.37
% 0.12/0.37 Here is a proof with depth 2, length 13 :
% 0.12/0.37 % SZS output start Refutation
% See solution above
% 0.12/0.37 Formulae used in the proof : axiom_12 axiom_2 axiom_4 axiom_5 axiom_3
% 0.12/0.37
%------------------------------------------------------------------------------