TSTP Solution File: KRS115+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : KRS115+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n026.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:36 EDT 2022
% Result : Unsatisfiable 0.18s 0.45s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 14
% Syntax : Number of clauses : 30 ( 7 unt; 0 nHn; 30 RR)
% Number of literals : 63 ( 0 equ; 37 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 11 ( 10 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(1,axiom,
cowlThing(u),
file('KRS115+1.p',unknown),
[] ).
cnf(2,axiom,
cUnsatisfiable(i2003_11_14_17_21_30578),
file('KRS115+1.p',unknown),
[] ).
cnf(5,axiom,
cp1(skf6(u)),
file('KRS115+1.p',unknown),
[] ).
cnf(6,axiom,
cp2(skf5(u)),
file('KRS115+1.p',unknown),
[] ).
cnf(8,axiom,
( ~ cp1(u)
| cp2xcomp(u) ),
file('KRS115+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ cUnsatisfiable(u)
| rf2(u,skf5(u)) ),
file('KRS115+1.p',unknown),
[] ).
cnf(13,axiom,
( ~ cUnsatisfiable(u)
| rf1(u,skf6(u)) ),
file('KRS115+1.p',unknown),
[] ).
cnf(14,axiom,
( ~ cUnsatisfiable(u)
| rr(u,skf7(u)) ),
file('KRS115+1.p',unknown),
[] ).
cnf(15,axiom,
( ~ cp2(u)
| ~ ra_Px1(u,v) ),
file('KRS115+1.p',unknown),
[] ).
cnf(16,axiom,
( ~ cp2xcomp(u)
| ra_Px1(u,skf9(u)) ),
file('KRS115+1.p',unknown),
[] ).
cnf(17,axiom,
( ~ rr(u,v)
| rf2(u,v) ),
file('KRS115+1.p',unknown),
[] ).
cnf(18,axiom,
( ~ rr(u,v)
| rf1(u,v) ),
file('KRS115+1.p',unknown),
[] ).
cnf(19,axiom,
( ~ cowlThing(u)
| ~ rf1(u,v)
| ~ rf1(u,w)
| equal(v,w) ),
file('KRS115+1.p',unknown),
[] ).
cnf(20,axiom,
( ~ cowlThing(u)
| ~ rf2(u,v)
| ~ rf2(u,w)
| equal(v,w) ),
file('KRS115+1.p',unknown),
[] ).
cnf(22,plain,
( ~ rf2(u,v)
| ~ rf2(u,w)
| equal(w,v) ),
inference(mrr,[status(thm)],[20,1]),
[iquote('0:MRR:20.0,1.0')] ).
cnf(23,plain,
( ~ rf1(u,v)
| ~ rf1(u,w)
| equal(w,v) ),
inference(mrr,[status(thm)],[19,1]),
[iquote('0:MRR:19.0,1.0')] ).
cnf(28,plain,
( ~ cp2xcomp(u)
| ~ cp2(u) ),
inference(res,[status(thm),theory(equality)],[16,15]),
[iquote('0:Res:16.1,15.1')] ).
cnf(29,plain,
~ cp1(skf5(u)),
inference(ems,[status(thm)],[28,8,6]),
[iquote('0:EmS:28.0,28.1,8.1,6.0')] ).
cnf(31,plain,
( ~ cUnsatisfiable(u)
| rf1(u,skf7(u)) ),
inference(res,[status(thm),theory(equality)],[14,18]),
[iquote('0:Res:14.1,18.0')] ).
cnf(32,plain,
( ~ cUnsatisfiable(u)
| rf2(u,skf7(u)) ),
inference(res,[status(thm),theory(equality)],[14,17]),
[iquote('0:Res:14.1,17.0')] ).
cnf(33,plain,
( ~ cUnsatisfiable(u)
| ~ rf2(u,v)
| equal(v,skf5(u)) ),
inference(res,[status(thm),theory(equality)],[12,22]),
[iquote('0:Res:12.1,22.0')] ).
cnf(36,plain,
( ~ cUnsatisfiable(u)
| ~ cUnsatisfiable(u)
| equal(skf7(u),skf5(u)) ),
inference(res,[status(thm),theory(equality)],[32,33]),
[iquote('0:Res:32.1,33.1')] ).
cnf(37,plain,
( ~ cUnsatisfiable(u)
| equal(skf7(u),skf5(u)) ),
inference(obv,[status(thm),theory(equality)],[36]),
[iquote('0:Obv:36.0')] ).
cnf(39,plain,
( ~ cUnsatisfiable(u)
| rf1(u,skf5(u)) ),
inference(rew,[status(thm),theory(equality)],[37,31]),
[iquote('0:Rew:37.1,31.1')] ).
cnf(45,plain,
( ~ cUnsatisfiable(u)
| ~ rf1(u,v)
| equal(v,skf6(u)) ),
inference(res,[status(thm),theory(equality)],[13,23]),
[iquote('0:Res:13.1,23.0')] ).
cnf(48,plain,
( ~ cUnsatisfiable(u)
| ~ cUnsatisfiable(u)
| equal(skf6(u),skf5(u)) ),
inference(res,[status(thm),theory(equality)],[39,45]),
[iquote('0:Res:39.1,45.1')] ).
cnf(49,plain,
( ~ cUnsatisfiable(u)
| equal(skf6(u),skf5(u)) ),
inference(obv,[status(thm),theory(equality)],[48]),
[iquote('0:Obv:48.0')] ).
cnf(53,plain,
( ~ cUnsatisfiable(u)
| cp1(skf5(u)) ),
inference(spr,[status(thm),theory(equality)],[49,5]),
[iquote('0:SpR:49.1,5.0')] ).
cnf(55,plain,
~ cUnsatisfiable(u),
inference(mrr,[status(thm)],[53,29]),
[iquote('0:MRR:53.1,29.0')] ).
cnf(56,plain,
$false,
inference(unc,[status(thm)],[55,2]),
[iquote('0:UnC:55.0,2.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : KRS115+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n026.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jun 7 15:54:31 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.45
% 0.18/0.45 SPASS V 3.9
% 0.18/0.45 SPASS beiseite: Proof found.
% 0.18/0.45 % SZS status Theorem
% 0.18/0.45 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.45 SPASS derived 28 clauses, backtracked 0 clauses, performed 0 splits and kept 34 clauses.
% 0.18/0.45 SPASS allocated 97873 KBytes.
% 0.18/0.45 SPASS spent 0:00:00.11 on the problem.
% 0.18/0.45 0:00:00.04 for the input.
% 0.18/0.45 0:00:00.05 for the FLOTTER CNF translation.
% 0.18/0.45 0:00:00.00 for inferences.
% 0.18/0.45 0:00:00.00 for the backtracking.
% 0.18/0.45 0:00:00.00 for the reduction.
% 0.18/0.45
% 0.18/0.45
% 0.18/0.45 Here is a proof with depth 3, length 30 :
% 0.18/0.45 % SZS output start Refutation
% See solution above
% 0.18/0.45 Formulae used in the proof : axiom_0 axiom_8 axiom_2 axiom_4 axiom_3 axiom_5 axiom_9 axiom_10 axiom_6 axiom_7
% 0.18/0.45
%------------------------------------------------------------------------------