%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : KRS112+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n026.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:35 EDT 2022
% Result : Unsatisfiable 0.19s 0.42s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 15
% Syntax : Number of clauses : 32 ( 5 unt; 0 nHn; 32 RR)
% Number of literals : 69 ( 0 equ; 41 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 12 ( 11 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_21_19256),
file('KRS112+1.p',unknown),
[] ).
cnf(4,axiom,
cp(skf7(u)),
file('KRS112+1.p',unknown),
[] ).
cnf(5,axiom,
ca_Ax2(skf6(u)),
file('KRS112+1.p',unknown),
[] ).
cnf(8,axiom,
( ~ ca_Ax2(u)
| cpxcomp(u) ),
file('KRS112+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ cUnsatisfiable(u)
| rf1(u,skf6(u)) ),
file('KRS112+1.p',unknown),
[] ).
cnf(13,axiom,
( ~ cUnsatisfiable(u)
| rf(u,skf7(u)) ),
file('KRS112+1.p',unknown),
[] ).
cnf(14,axiom,
( ~ cp(u)
| ~ ra_Px1(u,v) ),
file('KRS112+1.p',unknown),
[] ).
cnf(15,axiom,
( ~ cpxcomp(u)
| ra_Px1(u,skf9(u)) ),
file('KRS112+1.p',unknown),
[] ).
cnf(16,axiom,
( ~ ca_Vx3(u)
| rs(u,skf11(u)) ),
file('KRS112+1.p',unknown),
[] ).
cnf(20,axiom,
( ~ rf1(u,v)
| rinvF1(v,u) ),
file('KRS112+1.p',unknown),
[] ).
cnf(23,axiom,
( ~ rs(u,v)
| rf(u,v) ),
file('KRS112+1.p',unknown),
[] ).
cnf(24,axiom,
( ~ rs(u,v)
| rf1(u,v) ),
file('KRS112+1.p',unknown),
[] ).
cnf(25,axiom,
( ~ ca_Ax2(u)
| ~ rinvF1(u,v)
| ca_Vx3(v) ),
file('KRS112+1.p',unknown),
[] ).
cnf(29,axiom,
( ~ rf(u,v)
| ~ rf(u,w)
| equal(w,v) ),
file('KRS112+1.p',unknown),
[] ).
cnf(30,axiom,
( ~ rf1(u,v)
| ~ rf1(u,w)
| equal(w,v) ),
file('KRS112+1.p',unknown),
[] ).
cnf(38,plain,
( ~ cpxcomp(u)
| ~ cp(u) ),
inference(res,[status(thm),theory(equality)],[15,14]),
[iquote('0:Res:15.1,14.1')] ).
cnf(44,plain,
( ~ ca_Vx3(u)
| rf1(u,skf11(u)) ),
inference(res,[status(thm),theory(equality)],[16,24]),
[iquote('0:Res:16.1,24.0')] ).
cnf(45,plain,
( ~ ca_Vx3(u)
| rf(u,skf11(u)) ),
inference(res,[status(thm),theory(equality)],[16,23]),
[iquote('0:Res:16.1,23.0')] ).
cnf(57,plain,
( ~ ca_Ax2(u)
| ~ rf1(v,u)
| ca_Vx3(v) ),
inference(res,[status(thm),theory(equality)],[20,25]),
[iquote('0:Res:20.1,25.1')] ).
cnf(59,plain,
( ~ cUnsatisfiable(u)
| ~ ca_Ax2(skf6(u))
| ca_Vx3(u) ),
inference(res,[status(thm),theory(equality)],[12,57]),
[iquote('0:Res:12.1,57.1')] ).
cnf(62,plain,
( ~ cUnsatisfiable(u)
| ca_Vx3(u) ),
inference(ssi,[status(thm)],[59,5]),
[iquote('0:SSi:59.1,5.0')] ).
cnf(63,plain,
( ~ cUnsatisfiable(u)
| ~ rf1(u,v)
| equal(v,skf6(u)) ),
inference(res,[status(thm),theory(equality)],[12,30]),
[iquote('0:Res:12.1,30.0')] ).
cnf(68,plain,
( ~ ca_Vx3(u)
| ~ cUnsatisfiable(u)
| equal(skf11(u),skf6(u)) ),
inference(res,[status(thm),theory(equality)],[44,63]),
[iquote('0:Res:44.1,63.1')] ).
cnf(70,plain,
( ~ cUnsatisfiable(u)
| equal(skf11(u),skf6(u)) ),
inference(ssi,[status(thm)],[68,62]),
[iquote('0:SSi:68.0,62.1')] ).
cnf(79,plain,
( ~ cUnsatisfiable(u)
| ~ rf(u,v)
| equal(v,skf7(u)) ),
inference(res,[status(thm),theory(equality)],[13,29]),
[iquote('0:Res:13.1,29.0')] ).
cnf(102,plain,
( ~ ca_Vx3(u)
| ~ cUnsatisfiable(u)
| equal(skf11(u),skf7(u)) ),
inference(res,[status(thm),theory(equality)],[45,79]),
[iquote('0:Res:45.1,79.1')] ).
cnf(104,plain,
( ~ ca_Vx3(u)
| ~ cUnsatisfiable(u)
| equal(skf7(u),skf6(u)) ),
inference(rew,[status(thm),theory(equality)],[70,102]),
[iquote('0:Rew:70.1,102.2')] ).
cnf(105,plain,
( ~ cUnsatisfiable(u)
| equal(skf7(u),skf6(u)) ),
inference(ssi,[status(thm)],[104,62]),
[iquote('0:SSi:104.0,62.1')] ).
cnf(109,plain,
( ~ cUnsatisfiable(u)
| cp(skf6(u)) ),
inference(spr,[status(thm),theory(equality)],[105,4]),
[iquote('0:SpR:105.1,4.0')] ).
cnf(114,plain,
( ~ ca_Ax2(skf6(u))
| ~ cUnsatisfiable(u) ),
inference(ems,[status(thm)],[38,8,109]),
[iquote('0:EmS:38.0,38.1,8.1,109.1')] ).
cnf(116,plain,
~ cUnsatisfiable(u),
inference(ssi,[status(thm)],[114,5,109]),
[iquote('0:SSi:114.0,5.1,109.0')] ).
cnf(117,plain,
$false,
inference(unc,[status(thm)],[116,2]),
[iquote('0:UnC:116.0,2.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : KRS112+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n026.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 10:08:16 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.42
% 0.19/0.42 SPASS V 3.9
% 0.19/0.42 SPASS beiseite: Proof found.
% 0.19/0.42 % SZS status Theorem
% 0.19/0.42 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.42 SPASS derived 73 clauses, backtracked 0 clauses, performed 0 splits and kept 64 clauses.
% 0.19/0.42 SPASS allocated 97889 KBytes.
% 0.19/0.42 SPASS spent 0:00:00.07 on the problem.
% 0.19/0.42 0:00:00.03 for the input.
% 0.19/0.42 0:00:00.02 for the FLOTTER CNF translation.
% 0.19/0.42 0:00:00.00 for inferences.
% 0.19/0.42 0:00:00.00 for the backtracking.
% 0.19/0.42 0:00:00.00 for the reduction.
% 0.19/0.42
% 0.19/0.42
% 0.19/0.42 Here is a proof with depth 4, length 32 :
% 0.19/0.42 % SZS output start Refutation
% See solution above
% 0.19/0.42 Formulae used in the proof : axiom_13 axiom_2 axiom_3 axiom_5 axiom_4 axiom_6 axiom_0 axiom_10 axiom_14 axiom_15 axiom_7 axiom_8
% 0.19/0.42
%------------------------------------------------------------------------------