%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : KRS108+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n029.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.18s 0.45s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 21
% Syntax : Number of clauses : 38 ( 9 unt; 4 nHn; 38 RR)
% Number of literals : 79 ( 0 equ; 44 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 17 ( 16 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
cUnsatisfiable(i2003_11_14_17_21_04740),
file('KRS108+1.p',unknown),
[] ).
cnf(4,axiom,
ca_Ax14(skf18(u)),
file('KRS108+1.p',unknown),
[] ).
cnf(5,axiom,
cp1(skf27(u)),
file('KRS108+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ cUnsatisfiable(u)
| cp2(u) ),
file('KRS108+1.p',unknown),
[] ).
cnf(8,axiom,
( ~ cp1(u)
| ca_Cx1(u) ),
file('KRS108+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ cp2(u)
| ca_Cx2(u) ),
file('KRS108+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ ca_Cx1(u)
| cp2xcomp(u) ),
file('KRS108+1.p',unknown),
[] ).
cnf(16,axiom,
( ~ ca_Cx2(u)
| cp5xcomp(u) ),
file('KRS108+1.p',unknown),
[] ).
cnf(17,axiom,
( ~ ca_Cx2(u)
| cp3xcomp(u) ),
file('KRS108+1.p',unknown),
[] ).
cnf(18,axiom,
( ~ ca_Cx2(u)
| cp4xcomp(u) ),
file('KRS108+1.p',unknown),
[] ).
cnf(22,axiom,
( ~ ra_Px5(u,v)
| cp2(u) ),
file('KRS108+1.p',unknown),
[] ).
cnf(23,axiom,
( cp2xcomp(u)
| ra_Px5(u,skf20(u)) ),
file('KRS108+1.p',unknown),
[] ).
cnf(30,axiom,
( ~ ra_Px1(u,v)
| ca_Cx1(u) ),
file('KRS108+1.p',unknown),
[] ).
cnf(31,axiom,
( ca_Cx1xcomp(u)
| ra_Px1(u,skf31(u)) ),
file('KRS108+1.p',unknown),
[] ).
cnf(36,axiom,
( ~ cUnsatisfiable(u)
| rinvR(u,skf18(u)) ),
file('KRS108+1.p',unknown),
[] ).
cnf(37,axiom,
( ~ cp2(u)
| ra_Px5(u,skf19(u)) ),
file('KRS108+1.p',unknown),
[] ).
cnf(38,axiom,
( ~ cp2xcomp(u)
| ~ ra_Px5(u,v) ),
file('KRS108+1.p',unknown),
[] ).
cnf(45,axiom,
( ~ ca_Ax14(u)
| rr(u,skf27(u)) ),
file('KRS108+1.p',unknown),
[] ).
cnf(52,axiom,
( ~ rinvR(u,v)
| rr(v,u) ),
file('KRS108+1.p',unknown),
[] ).
cnf(59,axiom,
( ~ ca_Ax14(u)
| ~ rr(u,v)
| ~ rr(u,w)
| equal(v,w) ),
file('KRS108+1.p',unknown),
[] ).
cnf(60,axiom,
( ~ cp4xcomp(u)
| ~ cp3xcomp(u)
| ~ cp5xcomp(u)
| ~ cp2xcomp(u)
| ca_Cx1(u) ),
file('KRS108+1.p',unknown),
[] ).
cnf(65,plain,
( cp2xcomp(u)
| cp2(u) ),
inference(res,[status(thm),theory(equality)],[23,22]),
[iquote('0:Res:23.1,22.0')] ).
cnf(66,plain,
( ca_Cx1xcomp(u)
| ca_Cx1(u) ),
inference(res,[status(thm),theory(equality)],[31,30]),
[iquote('0:Res:31.1,30.0')] ).
cnf(83,plain,
( ~ cp2(u)
| ~ cp2xcomp(u) ),
inference(res,[status(thm),theory(equality)],[37,38]),
[iquote('0:Res:37.1,38.1')] ).
cnf(84,plain,
( ~ cUnsatisfiable(u)
| ~ ca_Cx1(u) ),
inference(ems,[status(thm)],[83,7,12]),
[iquote('0:EmS:83.0,83.1,7.1,12.1')] ).
cnf(88,plain,
~ cp1(i2003_11_14_17_21_04740),
inference(ems,[status(thm)],[84,2,8]),
[iquote('0:EmS:84.0,84.1,2.0,8.1')] ).
cnf(89,plain,
ca_Cx1xcomp(i2003_11_14_17_21_04740),
inference(ems,[status(thm)],[84,2,66]),
[iquote('0:EmS:84.0,84.1,2.0,66.1')] ).
cnf(110,plain,
( ~ cp2xcomp(i2003_11_14_17_21_04740)
| ~ cp5xcomp(i2003_11_14_17_21_04740)
| ~ cp3xcomp(i2003_11_14_17_21_04740)
| ~ cp4xcomp(i2003_11_14_17_21_04740) ),
inference(ems,[status(thm)],[84,2,60]),
[iquote('0:EmS:84.0,84.1,2.0,60.4')] ).
cnf(112,plain,
~ cp2xcomp(i2003_11_14_17_21_04740),
inference(ssi,[status(thm)],[110,7,9,18,2,89,17,16]),
[iquote('0:SSi:110.3,110.2,110.1,7.0,9.0,18.1,2.1,89.1,7.0,9.0,17.1,2.1,89.1,7.0,9.0,16.1,2.1,89.1')] ).
cnf(114,plain,
cp2(i2003_11_14_17_21_04740),
inference(sor,[status(thm)],[112,65]),
[iquote('0:SoR:112.0,65.0')] ).
cnf(120,plain,
( ~ ca_Ax14(u)
| ~ ca_Ax14(u)
| ~ rr(u,v)
| equal(skf27(u),v) ),
inference(res,[status(thm),theory(equality)],[45,59]),
[iquote('0:Res:45.1,59.1')] ).
cnf(122,plain,
( ~ ca_Ax14(u)
| ~ rr(u,v)
| equal(skf27(u),v) ),
inference(obv,[status(thm),theory(equality)],[120]),
[iquote('0:Obv:120.0')] ).
cnf(126,plain,
( ~ ca_Ax14(u)
| ~ rinvR(v,u)
| equal(skf27(u),v) ),
inference(res,[status(thm),theory(equality)],[52,122]),
[iquote('0:Res:52.1,122.1')] ).
cnf(127,plain,
( ~ cUnsatisfiable(u)
| ~ ca_Ax14(skf18(u))
| equal(skf27(skf18(u)),u) ),
inference(res,[status(thm),theory(equality)],[36,126]),
[iquote('0:Res:36.1,126.1')] ).
cnf(129,plain,
( ~ cUnsatisfiable(u)
| equal(skf27(skf18(u)),u) ),
inference(ssi,[status(thm)],[127,4]),
[iquote('0:SSi:127.1,4.0')] ).
cnf(130,plain,
( ~ cUnsatisfiable(u)
| cp1(u) ),
inference(spr,[status(thm),theory(equality)],[129,5]),
[iquote('0:SpR:129.1,5.0')] ).
cnf(135,plain,
~ cUnsatisfiable(i2003_11_14_17_21_04740),
inference(sor,[status(thm)],[88,130]),
[iquote('0:SoR:88.0,130.1')] ).
cnf(136,plain,
$false,
inference(ssi,[status(thm)],[135,2,89,114]),
[iquote('0:SSi:135.0,2.0,89.0,114.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : KRS108+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.11 % Command : run_spass %d %s
% 0.11/0.32 % Computer : n029.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Tue Jun 7 12:27:05 EDT 2022
% 0.11/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/sandbox/benchmark/theBenchmark.p
% 0.18/0.45 SPASS derived 69 clauses, backtracked 0 clauses, performed 0 splits and kept 93 clauses.
% 0.18/0.45 SPASS allocated 97940 KBytes.
% 0.18/0.45 SPASS spent 0:00:00.11 on the problem.
% 0.18/0.45 0:00:00.04 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 38 :
% 0.18/0.45 % SZS output start Refutation
% See solution above
% 0.18/0.45 Formulae used in the proof : axiom_26 axiom_2 axiom_15 axiom_3 axiom_5 axiom_16 axiom_19 axiom_4 axiom_6 axiom_17 axiom_18 axiom_25
% 0.18/0.45
%------------------------------------------------------------------------------