TSTP Solution File: KRS111+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : KRS111+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n029.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.19s 0.46s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of clauses : 25 ( 5 unt; 0 nHn; 25 RR)
% Number of literals : 51 ( 0 equ; 29 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
cUnsatisfiable(i2003_11_14_17_21_15425),
file('KRS111+1.p',unknown),
[] ).
cnf(4,axiom,
cp(skf7(u)),
file('KRS111+1.p',unknown),
[] ).
cnf(6,axiom,
cpxcomp(skf5(u)),
file('KRS111+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ cUnsatisfiable(u)
| rf1(u,skf5(u)) ),
file('KRS111+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ cUnsatisfiable(u)
| rs(u,skf6(u)) ),
file('KRS111+1.p',unknown),
[] ).
cnf(13,axiom,
( ~ cUnsatisfiable(u)
| rf(u,skf7(u)) ),
file('KRS111+1.p',unknown),
[] ).
cnf(14,axiom,
( ~ cp(u)
| ~ ra_Px1(u,v) ),
file('KRS111+1.p',unknown),
[] ).
cnf(15,axiom,
( ~ cpxcomp(u)
| ra_Px1(u,skf9(u)) ),
file('KRS111+1.p',unknown),
[] ).
cnf(22,axiom,
( ~ rs(u,v)
| rf(u,v) ),
file('KRS111+1.p',unknown),
[] ).
cnf(23,axiom,
( ~ rs(u,v)
| rf1(u,v) ),
file('KRS111+1.p',unknown),
[] ).
cnf(24,axiom,
( ~ rf(u,v)
| ~ rf(u,w)
| equal(w,v) ),
file('KRS111+1.p',unknown),
[] ).
cnf(25,axiom,
( ~ rf1(u,v)
| ~ rf1(u,w)
| equal(w,v) ),
file('KRS111+1.p',unknown),
[] ).
cnf(32,plain,
( ~ cpxcomp(u)
| ~ cp(u) ),
inference(res,[status(thm),theory(equality)],[15,14]),
[iquote('0:Res:15.1,14.1')] ).
cnf(37,plain,
( ~ cUnsatisfiable(u)
| rf1(u,skf6(u)) ),
inference(res,[status(thm),theory(equality)],[12,23]),
[iquote('0:Res:12.1,23.0')] ).
cnf(38,plain,
( ~ cUnsatisfiable(u)
| rf(u,skf6(u)) ),
inference(res,[status(thm),theory(equality)],[12,22]),
[iquote('0:Res:12.1,22.0')] ).
cnf(44,plain,
( ~ cUnsatisfiable(u)
| ~ rf1(u,v)
| equal(v,skf5(u)) ),
inference(res,[status(thm),theory(equality)],[11,25]),
[iquote('0:Res:11.1,25.0')] ).
cnf(47,plain,
( ~ cUnsatisfiable(u)
| ~ cUnsatisfiable(u)
| equal(skf6(u),skf5(u)) ),
inference(res,[status(thm),theory(equality)],[37,44]),
[iquote('0:Res:37.1,44.1')] ).
cnf(48,plain,
( ~ cUnsatisfiable(u)
| equal(skf6(u),skf5(u)) ),
inference(obv,[status(thm),theory(equality)],[47]),
[iquote('0:Obv:47.0')] ).
cnf(52,plain,
( ~ cUnsatisfiable(u)
| rf(u,skf5(u)) ),
inference(rew,[status(thm),theory(equality)],[48,38]),
[iquote('0:Rew:48.1,38.1')] ).
cnf(59,plain,
( ~ cUnsatisfiable(u)
| ~ rf(u,v)
| equal(v,skf7(u)) ),
inference(res,[status(thm),theory(equality)],[13,24]),
[iquote('0:Res:13.1,24.0')] ).
cnf(63,plain,
( ~ cUnsatisfiable(u)
| ~ cUnsatisfiable(u)
| equal(skf7(u),skf5(u)) ),
inference(res,[status(thm),theory(equality)],[52,59]),
[iquote('0:Res:52.1,59.1')] ).
cnf(64,plain,
( ~ cUnsatisfiable(u)
| equal(skf7(u),skf5(u)) ),
inference(obv,[status(thm),theory(equality)],[63]),
[iquote('0:Obv:63.0')] ).
cnf(67,plain,
( ~ cUnsatisfiable(u)
| cp(skf5(u)) ),
inference(spr,[status(thm),theory(equality)],[64,4]),
[iquote('0:SpR:64.1,4.0')] ).
cnf(69,plain,
~ cUnsatisfiable(u),
inference(ems,[status(thm)],[32,6,67]),
[iquote('0:EmS:32.0,32.1,6.0,67.1')] ).
cnf(70,plain,
$false,
inference(unc,[status(thm)],[69,2]),
[iquote('0:UnC:69.0,2.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : KRS111+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n029.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 : Tue Jun 7 13:48:20 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.46
% 0.19/0.46 SPASS V 3.9
% 0.19/0.46 SPASS beiseite: Proof found.
% 0.19/0.46 % SZS status Theorem
% 0.19/0.46 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46 SPASS derived 39 clauses, backtracked 0 clauses, performed 0 splits and kept 44 clauses.
% 0.19/0.46 SPASS allocated 97968 KBytes.
% 0.19/0.46 SPASS spent 0:00:00.10 on the problem.
% 0.19/0.46 0:00:00.04 for the input.
% 0.19/0.46 0:00:00.04 for the FLOTTER CNF translation.
% 0.19/0.46 0:00:00.00 for inferences.
% 0.19/0.46 0:00:00.00 for the backtracking.
% 0.19/0.46 0:00:00.00 for the reduction.
% 0.19/0.46
% 0.19/0.46
% 0.19/0.46 Here is a proof with depth 4, length 25 :
% 0.19/0.46 % SZS output start Refutation
% See solution above
% 0.19/0.46 Formulae used in the proof : axiom_11 axiom_2 axiom_0 axiom_3 axiom_4 axiom_12 axiom_13 axiom_5 axiom_6
% 0.19/0.46
%------------------------------------------------------------------------------