TSTP Solution File: KRS076+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : KRS076+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n023.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.19s 0.45s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 11
% Syntax : Number of clauses : 26 ( 5 unt; 0 nHn; 26 RR)
% Number of literals : 56 ( 0 equ; 33 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 : 7 ( 7 usr; 4 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
cUnsatisfiable(i2003_11_14_17_19_06193),
file('KRS076+1.p',unknown),
[] ).
cnf(5,axiom,
cp(skf4(u)),
file('KRS076+1.p',unknown),
[] ).
cnf(7,axiom,
~ cp(skf5(u)),
file('KRS076+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ cUnsatisfiable(u)
| rf(u,skf4(u)) ),
file('KRS076+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ cUnsatisfiable(u)
| rf1(u,skf5(u)) ),
file('KRS076+1.p',unknown),
[] ).
cnf(14,axiom,
( ~ rf1(u,v)
| rinvF1(v,u) ),
file('KRS076+1.p',unknown),
[] ).
cnf(17,axiom,
( ~ rs(u,v)
| rf1(u,v) ),
file('KRS076+1.p',unknown),
[] ).
cnf(18,axiom,
( ~ rs(u,v)
| rf(u,v) ),
file('KRS076+1.p',unknown),
[] ).
cnf(19,axiom,
( ~ rf(u,v)
| ~ rf(u,w)
| equal(w,v) ),
file('KRS076+1.p',unknown),
[] ).
cnf(20,axiom,
( ~ rf1(u,v)
| ~ rf1(u,w)
| equal(w,v) ),
file('KRS076+1.p',unknown),
[] ).
cnf(22,axiom,
( ~ cUnsatisfiable(u)
| ~ rinvF1(skf5(u),v)
| rs(v,skf6(v)) ),
file('KRS076+1.p',unknown),
[] ).
cnf(32,plain,
( ~ cUnsatisfiable(u)
| ~ rf1(u,v)
| equal(v,skf5(u)) ),
inference(res,[status(thm),theory(equality)],[10,20]),
[iquote('0:Res:10.1,20.0')] ).
cnf(34,plain,
( ~ cUnsatisfiable(u)
| ~ rf(u,v)
| equal(v,skf4(u)) ),
inference(res,[status(thm),theory(equality)],[9,19]),
[iquote('0:Res:9.1,19.0')] ).
cnf(36,plain,
( ~ cUnsatisfiable(u)
| ~ rf1(v,skf5(u))
| rs(v,skf6(v)) ),
inference(res,[status(thm),theory(equality)],[14,22]),
[iquote('0:Res:14.1,22.1')] ).
cnf(37,plain,
( ~ cUnsatisfiable(u)
| ~ cUnsatisfiable(u)
| rs(u,skf6(u)) ),
inference(res,[status(thm),theory(equality)],[10,36]),
[iquote('0:Res:10.1,36.1')] ).
cnf(38,plain,
( ~ cUnsatisfiable(u)
| rs(u,skf6(u)) ),
inference(obv,[status(thm),theory(equality)],[37]),
[iquote('0:Obv:37.0')] ).
cnf(40,plain,
( ~ cUnsatisfiable(u)
| rf1(u,skf6(u)) ),
inference(res,[status(thm),theory(equality)],[38,17]),
[iquote('0:Res:38.1,17.0')] ).
cnf(41,plain,
( ~ cUnsatisfiable(u)
| rf(u,skf6(u)) ),
inference(res,[status(thm),theory(equality)],[38,18]),
[iquote('0:Res:38.1,18.0')] ).
cnf(43,plain,
( ~ cUnsatisfiable(u)
| ~ cUnsatisfiable(u)
| equal(skf6(u),skf5(u)) ),
inference(res,[status(thm),theory(equality)],[40,32]),
[iquote('0:Res:40.1,32.1')] ).
cnf(45,plain,
( ~ cUnsatisfiable(u)
| equal(skf6(u),skf5(u)) ),
inference(obv,[status(thm),theory(equality)],[43]),
[iquote('0:Obv:43.0')] ).
cnf(48,plain,
( ~ cUnsatisfiable(u)
| rf(u,skf5(u)) ),
inference(rew,[status(thm),theory(equality)],[45,41]),
[iquote('0:Rew:45.1,41.1')] ).
cnf(57,plain,
( ~ cUnsatisfiable(u)
| ~ cUnsatisfiable(u)
| equal(skf5(u),skf4(u)) ),
inference(res,[status(thm),theory(equality)],[48,34]),
[iquote('0:Res:48.1,34.1')] ).
cnf(59,plain,
( ~ cUnsatisfiable(u)
| equal(skf5(u),skf4(u)) ),
inference(obv,[status(thm),theory(equality)],[57]),
[iquote('0:Obv:57.0')] ).
cnf(81,plain,
( ~ cUnsatisfiable(u)
| ~ cp(skf4(u)) ),
inference(spl,[status(thm),theory(equality)],[59,7]),
[iquote('0:SpL:59.1,7.0')] ).
cnf(82,plain,
~ cUnsatisfiable(u),
inference(mrr,[status(thm)],[81,5]),
[iquote('0:MRR:81.1,5.0')] ).
cnf(83,plain,
$false,
inference(unc,[status(thm)],[82,2]),
[iquote('0:UnC:82.0,2.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : KRS076+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.12 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n023.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue Jun 7 13:50:38 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.45
% 0.19/0.45 SPASS V 3.9
% 0.19/0.45 SPASS beiseite: Proof found.
% 0.19/0.45 % SZS status Theorem
% 0.19/0.45 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45 SPASS derived 51 clauses, backtracked 0 clauses, performed 0 splits and kept 49 clauses.
% 0.19/0.45 SPASS allocated 97947 KBytes.
% 0.19/0.45 SPASS spent 0:00:00.11 on the problem.
% 0.19/0.45 0:00:00.04 for the input.
% 0.19/0.45 0:00:00.04 for the FLOTTER CNF translation.
% 0.19/0.45 0:00:00.00 for inferences.
% 0.19/0.45 0:00:00.00 for the backtracking.
% 0.19/0.45 0:00:00.00 for the reduction.
% 0.19/0.45
% 0.19/0.45
% 0.19/0.45 Here is a proof with depth 5, length 26 :
% 0.19/0.45 % SZS output start Refutation
% See solution above
% 0.19/0.45 Formulae used in the proof : axiom_9 axiom_2 axiom_0 axiom_6 axiom_10 axiom_11 axiom_3 axiom_4
% 0.19/0.45
%------------------------------------------------------------------------------