TSTP Solution File: KRS098+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : KRS098+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:33 EDT 2022
% Result : Unsatisfiable 0.18s 0.49s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 16
% Syntax : Number of clauses : 31 ( 7 unt; 3 nHn; 31 RR)
% Number of literals : 73 ( 0 equ; 42 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 13 ( 12 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_20_25524),
file('KRS098+1.p',unknown),
[] ).
cnf(4,axiom,
cd(skf27(u)),
file('KRS098+1.p',unknown),
[] ).
cnf(6,axiom,
cc(skf17(u)),
file('KRS098+1.p',unknown),
[] ).
cnf(8,axiom,
rt2(skf26(u),skf27(u)),
file('KRS098+1.p',unknown),
[] ).
cnf(10,axiom,
rt1(skf16(u),skf17(u)),
file('KRS098+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ cUnsatisfiable(u)
| skP1(u) ),
file('KRS098+1.p',unknown),
[] ).
cnf(16,axiom,
( ~ cUnsatisfiable(u)
| ~ skP2(u) ),
file('KRS098+1.p',unknown),
[] ).
cnf(17,axiom,
( ~ cd(u)
| ~ cc(u) ),
file('KRS098+1.p',unknown),
[] ).
cnf(20,axiom,
( ~ cUnsatisfiable(u)
| rr1(u,skf16(u)) ),
file('KRS098+1.p',unknown),
[] ).
cnf(22,axiom,
( ~ skP1(u)
| rr2(u,skf26(u)) ),
file('KRS098+1.p',unknown),
[] ).
cnf(26,axiom,
( ~ rr1(u,v)
| rr(u,v) ),
file('KRS098+1.p',unknown),
[] ).
cnf(27,axiom,
( ~ rr2(u,v)
| rr(u,v) ),
file('KRS098+1.p',unknown),
[] ).
cnf(28,axiom,
( ~ rt1(u,v)
| rtt(u,v) ),
file('KRS098+1.p',unknown),
[] ).
cnf(29,axiom,
( ~ rt2(u,v)
| rtt(u,v) ),
file('KRS098+1.p',unknown),
[] ).
cnf(33,axiom,
( ~ rr(u,v)
| ~ rr(u,w)
| skP2(u)
| equal(w,v) ),
file('KRS098+1.p',unknown),
[] ).
cnf(36,axiom,
( ~ skP1(u)
| ~ rtt(skf26(u),v)
| ~ rtt(skf26(u),w)
| equal(v,w) ),
file('KRS098+1.p',unknown),
[] ).
cnf(54,plain,
( ~ rr1(u,v)
| ~ rr(u,w)
| skP2(u)
| equal(w,v) ),
inference(res,[status(thm),theory(equality)],[26,33]),
[iquote('0:Res:26.1,33.0')] ).
cnf(57,plain,
( ~ cUnsatisfiable(u)
| ~ rr(u,v)
| skP2(u)
| equal(v,skf16(u)) ),
inference(res,[status(thm),theory(equality)],[20,54]),
[iquote('0:Res:20.1,54.0')] ).
cnf(58,plain,
( ~ cUnsatisfiable(u)
| ~ rr(u,v)
| equal(v,skf16(u)) ),
inference(mrr,[status(thm)],[57,16]),
[iquote('0:MRR:57.2,16.1')] ).
cnf(62,plain,
( ~ cUnsatisfiable(u)
| ~ rr2(u,v)
| equal(v,skf16(u)) ),
inference(res,[status(thm),theory(equality)],[27,58]),
[iquote('0:Res:27.1,58.1')] ).
cnf(65,plain,
( ~ skP1(u)
| ~ cUnsatisfiable(u)
| equal(skf26(u),skf16(u)) ),
inference(res,[status(thm),theory(equality)],[22,62]),
[iquote('0:Res:22.1,62.1')] ).
cnf(66,plain,
( ~ cUnsatisfiable(u)
| equal(skf26(u),skf16(u)) ),
inference(ssi,[status(thm)],[65,12]),
[iquote('0:SSi:65.0,12.1')] ).
cnf(68,plain,
( ~ skP1(u)
| ~ rt2(skf26(u),v)
| ~ rtt(skf26(u),w)
| equal(v,w) ),
inference(res,[status(thm),theory(equality)],[29,36]),
[iquote('0:Res:29.1,36.1')] ).
cnf(146,plain,
( ~ skP1(u)
| ~ rtt(skf26(u),v)
| equal(skf27(u),v) ),
inference(res,[status(thm),theory(equality)],[8,68]),
[iquote('0:Res:8.0,68.1')] ).
cnf(152,plain,
( ~ skP1(u)
| ~ rt1(skf26(u),v)
| equal(skf27(u),v) ),
inference(res,[status(thm),theory(equality)],[28,146]),
[iquote('0:Res:28.1,146.1')] ).
cnf(158,plain,
( ~ cUnsatisfiable(u)
| ~ skP1(u)
| ~ rt1(skf16(u),v)
| equal(skf27(u),v) ),
inference(spl,[status(thm),theory(equality)],[66,152]),
[iquote('0:SpL:66.1,152.1')] ).
cnf(159,plain,
( ~ cUnsatisfiable(u)
| ~ rt1(skf16(u),v)
| equal(skf27(u),v) ),
inference(ssi,[status(thm)],[158,12]),
[iquote('0:SSi:158.1,12.1')] ).
cnf(176,plain,
( ~ cUnsatisfiable(u)
| equal(skf27(u),skf17(u)) ),
inference(res,[status(thm),theory(equality)],[10,159]),
[iquote('0:Res:10.0,159.1')] ).
cnf(182,plain,
( ~ cUnsatisfiable(u)
| cd(skf17(u)) ),
inference(spr,[status(thm),theory(equality)],[176,4]),
[iquote('0:SpR:176.1,4.0')] ).
cnf(188,plain,
~ cUnsatisfiable(u),
inference(ems,[status(thm)],[17,182,6]),
[iquote('0:EmS:17.0,17.1,182.1,6.0')] ).
cnf(189,plain,
$false,
inference(unc,[status(thm)],[188,2]),
[iquote('0:UnC:188.0,2.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KRS098+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n025.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 20:12:19 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.49
% 0.18/0.49 SPASS V 3.9
% 0.18/0.49 SPASS beiseite: Proof found.
% 0.18/0.49 % SZS status Theorem
% 0.18/0.49 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.49 SPASS derived 114 clauses, backtracked 0 clauses, performed 0 splits and kept 101 clauses.
% 0.18/0.49 SPASS allocated 98409 KBytes.
% 0.18/0.49 SPASS spent 0:00:00.14 on the problem.
% 0.18/0.49 0:00:00.03 for the input.
% 0.18/0.49 0:00:00.08 for the FLOTTER CNF translation.
% 0.18/0.49 0:00:00.00 for inferences.
% 0.18/0.49 0:00:00.00 for the backtracking.
% 0.18/0.49 0:00:00.01 for the reduction.
% 0.18/0.49
% 0.18/0.49
% 0.18/0.49 Here is a proof with depth 8, length 31 :
% 0.18/0.49 % SZS output start Refutation
% See solution above
% 0.18/0.49 Formulae used in the proof : axiom_4 axiom_2 axiom_5 axiom_8 axiom_9 axiom_10 axiom_11
% 0.18/0.49
%------------------------------------------------------------------------------