%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : KRS122+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n024.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:37 EDT 2022
% Result : Unsatisfiable 0.22s 0.45s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of clauses : 22 ( 5 unt; 0 nHn; 22 RR)
% Number of literals : 45 ( 0 equ; 27 neg)
% Maximal clause size : 3 ( 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_55116),
file('KRS122+1.p',unknown),
[] ).
cnf(4,axiom,
ca_Ax2(skf5(u)),
file('KRS122+1.p',unknown),
[] ).
cnf(5,axiom,
cp1xcomp(skf9(u)),
file('KRS122+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ ca_Ax2(u)
| cp1(u) ),
file('KRS122+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ cUnsatisfiable(u)
| rf(u,skf5(u)) ),
file('KRS122+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ cp1(u)
| ~ ra_Px1(u,v) ),
file('KRS122+1.p',unknown),
[] ).
cnf(13,axiom,
( ~ cp1xcomp(u)
| ra_Px1(u,skf7(u)) ),
file('KRS122+1.p',unknown),
[] ).
cnf(14,axiom,
( ~ ca_Vx3(u)
| rf(u,skf9(u)) ),
file('KRS122+1.p',unknown),
[] ).
cnf(16,axiom,
( ~ rf(u,v)
| rinvF(v,u) ),
file('KRS122+1.p',unknown),
[] ).
cnf(20,axiom,
( ~ ca_Ax2(u)
| ~ rinvF(u,v)
| ca_Vx3(v) ),
file('KRS122+1.p',unknown),
[] ).
cnf(24,axiom,
( ~ rf(u,v)
| ~ rf(u,w)
| equal(w,v) ),
file('KRS122+1.p',unknown),
[] ).
cnf(29,plain,
( ~ cp1xcomp(u)
| ~ cp1(u) ),
inference(res,[status(thm),theory(equality)],[13,12]),
[iquote('0:Res:13.1,12.1')] ).
cnf(39,plain,
( ~ ca_Ax2(u)
| ~ rf(v,u)
| ca_Vx3(v) ),
inference(res,[status(thm),theory(equality)],[16,20]),
[iquote('0:Res:16.1,20.1')] ).
cnf(45,plain,
( ~ cUnsatisfiable(u)
| ~ ca_Ax2(skf5(u))
| ca_Vx3(u) ),
inference(res,[status(thm),theory(equality)],[11,39]),
[iquote('0:Res:11.1,39.1')] ).
cnf(48,plain,
( ~ cUnsatisfiable(u)
| ca_Vx3(u) ),
inference(ssi,[status(thm)],[45,4]),
[iquote('0:SSi:45.1,4.0')] ).
cnf(50,plain,
( ~ cUnsatisfiable(u)
| ~ rf(u,v)
| equal(v,skf5(u)) ),
inference(res,[status(thm),theory(equality)],[11,24]),
[iquote('0:Res:11.1,24.0')] ).
cnf(54,plain,
( ~ ca_Vx3(u)
| ~ cUnsatisfiable(u)
| equal(skf9(u),skf5(u)) ),
inference(res,[status(thm),theory(equality)],[14,50]),
[iquote('0:Res:14.1,50.1')] ).
cnf(56,plain,
( ~ cUnsatisfiable(u)
| equal(skf9(u),skf5(u)) ),
inference(ssi,[status(thm)],[54,48]),
[iquote('0:SSi:54.0,48.1')] ).
cnf(57,plain,
( ~ cUnsatisfiable(u)
| cp1xcomp(skf5(u)) ),
inference(spr,[status(thm),theory(equality)],[56,5]),
[iquote('0:SpR:56.1,5.0')] ).
cnf(60,plain,
( ~ cUnsatisfiable(u)
| ~ ca_Ax2(skf5(u)) ),
inference(ems,[status(thm)],[29,57,7]),
[iquote('0:EmS:29.0,29.1,57.1,7.1')] ).
cnf(62,plain,
~ cUnsatisfiable(u),
inference(ssi,[status(thm)],[60,4,57]),
[iquote('0:SSi:60.1,4.1,57.0')] ).
cnf(63,plain,
$false,
inference(unc,[status(thm)],[62,2]),
[iquote('0:UnC:62.0,2.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : KRS122+1 : TPTP v8.1.0. Released v3.1.0.
% 0.04/0.13 % Command : run_spass %d %s
% 0.14/0.35 % Computer : n024.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Tue Jun 7 10:54:34 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.22/0.45
% 0.22/0.45 SPASS V 3.9
% 0.22/0.45 SPASS beiseite: Proof found.
% 0.22/0.45 % SZS status Theorem
% 0.22/0.45 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.45 SPASS derived 34 clauses, backtracked 0 clauses, performed 0 splits and kept 39 clauses.
% 0.22/0.45 SPASS allocated 97800 KBytes.
% 0.22/0.45 SPASS spent 0:00:00.09 on the problem.
% 0.22/0.45 0:00:00.04 for the input.
% 0.22/0.45 0:00:00.03 for the FLOTTER CNF translation.
% 0.22/0.45 0:00:00.00 for inferences.
% 0.22/0.45 0:00:00.00 for the backtracking.
% 0.22/0.45 0:00:00.00 for the reduction.
% 0.22/0.45
% 0.22/0.45
% 0.22/0.45 Here is a proof with depth 4, length 22 :
% 0.22/0.45 % SZS output start Refutation
% See solution above
% 0.22/0.45 Formulae used in the proof : axiom_11 axiom_2 axiom_6 axiom_8 axiom_5 axiom_3 axiom_4 axiom_7
% 0.22/0.45
%------------------------------------------------------------------------------