TSTP Solution File: KRS073+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : KRS073+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n028.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:28 EDT 2022
% Result : Unsatisfiable 0.18s 0.45s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of clauses : 22 ( 3 unt; 0 nHn; 22 RR)
% Number of literals : 46 ( 0 equ; 26 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
cUnsatisfiable(i2003_11_14_17_18_54369),
file('KRS073+1.p',unknown),
[] ).
cnf(8,axiom,
( ~ cUnsatisfiable(u)
| ~ cp(u) ),
file('KRS073+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ cUnsatisfiable(u)
| rf(u,skf6(u)) ),
file('KRS073+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ rf(u,v)
| rinvF(v,u) ),
file('KRS073+1.p',unknown),
[] ).
cnf(15,axiom,
( ~ rs(u,v)
| rinvS(v,u) ),
file('KRS073+1.p',unknown),
[] ).
cnf(17,axiom,
( ~ rs(u,v)
| rf(u,v) ),
file('KRS073+1.p',unknown),
[] ).
cnf(18,axiom,
( ~ cUnsatisfiable(u)
| ~ rinvS(skf6(v),w)
| cp(w) ),
file('KRS073+1.p',unknown),
[] ).
cnf(19,axiom,
( ~ rf(u,v)
| ~ rf(u,w)
| equal(w,v) ),
file('KRS073+1.p',unknown),
[] ).
cnf(22,axiom,
( ~ cUnsatisfiable(u)
| ~ rinvF(skf6(v),w)
| rs(w,skf7(w)) ),
file('KRS073+1.p',unknown),
[] ).
cnf(29,plain,
( ~ rinvS(skf6(u),v)
| cp(v) ),
inference(ems,[status(thm)],[18,2]),
[iquote('0:EmS:18.0,2.0')] ).
cnf(32,plain,
( ~ cUnsatisfiable(u)
| ~ rf(u,v)
| equal(v,skf6(u)) ),
inference(res,[status(thm),theory(equality)],[9,19]),
[iquote('0:Res:9.1,19.0')] ).
cnf(34,plain,
( ~ rinvF(skf6(u),v)
| rs(v,skf7(v)) ),
inference(ems,[status(thm)],[22,2]),
[iquote('0:EmS:22.0,2.0')] ).
cnf(35,plain,
( ~ rf(u,skf6(v))
| rs(u,skf7(u)) ),
inference(res,[status(thm),theory(equality)],[11,34]),
[iquote('0:Res:11.1,34.0')] ).
cnf(36,plain,
( ~ cUnsatisfiable(u)
| rs(u,skf7(u)) ),
inference(res,[status(thm),theory(equality)],[9,35]),
[iquote('0:Res:9.1,35.0')] ).
cnf(38,plain,
( ~ cUnsatisfiable(u)
| rf(u,skf7(u)) ),
inference(res,[status(thm),theory(equality)],[36,17]),
[iquote('0:Res:36.1,17.0')] ).
cnf(39,plain,
( ~ cUnsatisfiable(u)
| rinvS(skf7(u),u) ),
inference(res,[status(thm),theory(equality)],[36,15]),
[iquote('0:Res:36.1,15.0')] ).
cnf(40,plain,
( ~ cUnsatisfiable(u)
| ~ cUnsatisfiable(u)
| equal(skf7(u),skf6(u)) ),
inference(res,[status(thm),theory(equality)],[38,32]),
[iquote('0:Res:38.1,32.1')] ).
cnf(42,plain,
( ~ cUnsatisfiable(u)
| equal(skf7(u),skf6(u)) ),
inference(obv,[status(thm),theory(equality)],[40]),
[iquote('0:Obv:40.0')] ).
cnf(45,plain,
( ~ cUnsatisfiable(u)
| rinvS(skf6(u),u) ),
inference(rew,[status(thm),theory(equality)],[42,39]),
[iquote('0:Rew:42.1,39.1')] ).
cnf(53,plain,
( ~ cUnsatisfiable(u)
| cp(u) ),
inference(res,[status(thm),theory(equality)],[45,29]),
[iquote('0:Res:45.1,29.0')] ).
cnf(54,plain,
~ cUnsatisfiable(u),
inference(mrr,[status(thm)],[53,8]),
[iquote('0:MRR:53.1,8.1')] ).
cnf(55,plain,
$false,
inference(unc,[status(thm)],[54,2]),
[iquote('0:UnC:54.0,2.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KRS073+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n028.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 12:07:00 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 27 clauses, backtracked 0 clauses, performed 0 splits and kept 40 clauses.
% 0.18/0.45 SPASS allocated 98024 KBytes.
% 0.18/0.45 SPASS spent 0:00:00.10 on the problem.
% 0.18/0.45 0:00:00.03 for the input.
% 0.18/0.45 0:00:00.04 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 5, length 22 :
% 0.18/0.45 % SZS output start Refutation
% See solution above
% 0.18/0.45 Formulae used in the proof : axiom_9 axiom_2 axiom_5 axiom_7 axiom_11 axiom_3
% 0.18/0.45
%------------------------------------------------------------------------------