%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : KRS113+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n022.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.19s 0.46s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of clauses : 24 ( 4 unt; 0 nHn; 24 RR)
% Number of literals : 52 ( 0 equ; 32 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 9 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_21_22376),
file('KRS113+1.p',unknown),
[] ).
cnf(5,axiom,
ca_Vx2(skf7(u)),
file('KRS113+1.p',unknown),
[] ).
cnf(8,axiom,
( ~ cUnsatisfiable(u)
| cpxcomp(u) ),
file('KRS113+1.p',unknown),
[] ).
cnf(13,axiom,
( ~ cUnsatisfiable(u)
| rr(u,skf7(u)) ),
file('KRS113+1.p',unknown),
[] ).
cnf(14,axiom,
( ~ cUnsatisfiable(u)
| rs(u,skf8(u)) ),
file('KRS113+1.p',unknown),
[] ).
cnf(15,axiom,
( ~ cp(u)
| ~ ra_Px1(u,v) ),
file('KRS113+1.p',unknown),
[] ).
cnf(16,axiom,
( ~ cpxcomp(u)
| ra_Px1(u,skf12(u)) ),
file('KRS113+1.p',unknown),
[] ).
cnf(18,axiom,
( ~ rs(u,v)
| rinvS(v,u) ),
file('KRS113+1.p',unknown),
[] ).
cnf(19,axiom,
( ~ rs(u,v)
| rr(u,v) ),
file('KRS113+1.p',unknown),
[] ).
cnf(20,axiom,
( ~ ca_Vx2(u)
| ~ rinvS(u,v)
| cp(v) ),
file('KRS113+1.p',unknown),
[] ).
cnf(21,axiom,
( ~ cUnsatisfiable(u)
| ~ rr(u,v)
| ~ rr(u,w)
| equal(v,w) ),
file('KRS113+1.p',unknown),
[] ).
cnf(28,plain,
( ~ cpxcomp(u)
| ~ cp(u) ),
inference(res,[status(thm),theory(equality)],[16,15]),
[iquote('0:Res:16.1,15.1')] ).
cnf(31,plain,
( ~ cUnsatisfiable(u)
| rinvS(skf8(u),u) ),
inference(res,[status(thm),theory(equality)],[14,18]),
[iquote('0:Res:14.1,18.0')] ).
cnf(33,plain,
( ~ cUnsatisfiable(u)
| rr(u,skf8(u)) ),
inference(res,[status(thm),theory(equality)],[14,19]),
[iquote('0:Res:14.1,19.0')] ).
cnf(37,plain,
( ~ cUnsatisfiable(u)
| ~ cUnsatisfiable(u)
| ~ rr(u,v)
| equal(skf7(u),v) ),
inference(res,[status(thm),theory(equality)],[13,21]),
[iquote('0:Res:13.1,21.1')] ).
cnf(40,plain,
( ~ cUnsatisfiable(u)
| ~ rr(u,v)
| equal(skf7(u),v) ),
inference(obv,[status(thm),theory(equality)],[37]),
[iquote('0:Obv:37.0')] ).
cnf(43,plain,
( ~ cUnsatisfiable(u)
| ~ cUnsatisfiable(u)
| equal(skf8(u),skf7(u)) ),
inference(res,[status(thm),theory(equality)],[33,40]),
[iquote('0:Res:33.1,40.1')] ).
cnf(45,plain,
( ~ cUnsatisfiable(u)
| equal(skf8(u),skf7(u)) ),
inference(obv,[status(thm),theory(equality)],[43]),
[iquote('0:Obv:43.0')] ).
cnf(47,plain,
( ~ cUnsatisfiable(u)
| rinvS(skf7(u),u) ),
inference(rew,[status(thm),theory(equality)],[45,31]),
[iquote('0:Rew:45.1,31.1')] ).
cnf(52,plain,
( ~ cUnsatisfiable(u)
| ~ ca_Vx2(skf7(u))
| cp(u) ),
inference(res,[status(thm),theory(equality)],[47,20]),
[iquote('0:Res:47.1,20.1')] ).
cnf(53,plain,
( ~ cUnsatisfiable(u)
| cp(u) ),
inference(ssi,[status(thm)],[52,5]),
[iquote('0:SSi:52.1,5.0')] ).
cnf(54,plain,
( ~ cUnsatisfiable(u)
| ~ cUnsatisfiable(u) ),
inference(ems,[status(thm)],[28,8,53]),
[iquote('0:EmS:28.0,28.1,8.1,53.1')] ).
cnf(57,plain,
~ cUnsatisfiable(u),
inference(obv,[status(thm),theory(equality)],[54]),
[iquote('0:Obv:54.0')] ).
cnf(58,plain,
$false,
inference(unc,[status(thm)],[57,2]),
[iquote('0:UnC:57.0,2.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : KRS113+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n022.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jun 7 10:56:35 EDT 2022
% 0.12/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 28 clauses, backtracked 0 clauses, performed 0 splits and kept 41 clauses.
% 0.19/0.46 SPASS allocated 98117 KBytes.
% 0.19/0.46 SPASS spent 0:00:00.11 on the problem.
% 0.19/0.46 0:00:00.04 for the input.
% 0.19/0.46 0:00:00.05 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 3, length 24 :
% 0.19/0.46 % SZS output start Refutation
% See solution above
% 0.19/0.46 Formulae used in the proof : axiom_7 axiom_2 axiom_3 axiom_4 axiom_6 axiom_8 axiom_5
% 0.19/0.46
%------------------------------------------------------------------------------