%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : KRS101+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n025.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:33 EDT 2022
% Result : Unsatisfiable 0.19s 0.45s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of clauses : 19 ( 6 unt; 5 nHn; 19 RR)
% Number of literals : 48 ( 0 equ; 28 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
cUnsatisfiable(i2003_11_14_17_20_36582),
file('KRS101+1.p',unknown),
[] ).
cnf(7,axiom,
rs(skf7(u),skf9(u)),
file('KRS101+1.p',unknown),
[] ).
cnf(8,axiom,
rs(skf7(u),skf8(u)),
file('KRS101+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ cUnsatisfiable(u)
| skP0(u) ),
file('KRS101+1.p',unknown),
[] ).
cnf(12,axiom,
~ equal(skf9(u),skf8(u)),
file('KRS101+1.p',unknown),
[] ).
cnf(15,axiom,
( ~ cd(u)
| ~ cc(u) ),
file('KRS101+1.p',unknown),
[] ).
cnf(16,axiom,
( ~ cUnsatisfiable(u)
| rr(u,skf7(u)) ),
file('KRS101+1.p',unknown),
[] ).
cnf(17,axiom,
( ~ skP0(u)
| ~ rr(u,v)
| cd(v) ),
file('KRS101+1.p',unknown),
[] ).
cnf(18,axiom,
( ~ cUnsatisfiable(u)
| ~ rr(u,v)
| ~ rs(v,w)
| ~ rs(v,x)
| cc(v)
| equal(x,w) ),
file('KRS101+1.p',unknown),
[] ).
cnf(22,plain,
( ~ cUnsatisfiable(u)
| ~ skP0(u)
| cd(skf7(u)) ),
inference(res,[status(thm),theory(equality)],[16,17]),
[iquote('0:Res:16.1,17.1')] ).
cnf(23,plain,
( ~ cUnsatisfiable(u)
| cd(skf7(u)) ),
inference(ssi,[status(thm)],[22,9]),
[iquote('0:SSi:22.1,9.1')] ).
cnf(25,plain,
( ~ cUnsatisfiable(u)
| ~ cUnsatisfiable(u)
| ~ rs(skf7(u),v)
| ~ rs(skf7(u),w)
| cc(skf7(u))
| equal(w,v) ),
inference(res,[status(thm),theory(equality)],[16,18]),
[iquote('0:Res:16.1,18.1')] ).
cnf(26,plain,
( ~ cUnsatisfiable(u)
| ~ rs(skf7(u),v)
| ~ rs(skf7(u),w)
| cc(skf7(u))
| equal(w,v) ),
inference(obv,[status(thm),theory(equality)],[25]),
[iquote('0:Obv:25.0')] ).
cnf(27,plain,
( ~ cUnsatisfiable(u)
| ~ rs(skf7(u),v)
| cc(skf7(u))
| equal(v,skf8(u)) ),
inference(res,[status(thm),theory(equality)],[8,26]),
[iquote('0:Res:8.0,26.1')] ).
cnf(30,plain,
( ~ cUnsatisfiable(u)
| cc(skf7(u))
| equal(skf9(u),skf8(u)) ),
inference(res,[status(thm),theory(equality)],[7,27]),
[iquote('0:Res:7.0,27.1')] ).
cnf(31,plain,
( ~ cUnsatisfiable(u)
| cc(skf7(u)) ),
inference(mrr,[status(thm)],[30,12]),
[iquote('0:MRR:30.2,12.0')] ).
cnf(32,plain,
( ~ cUnsatisfiable(u)
| ~ cUnsatisfiable(u) ),
inference(ems,[status(thm)],[15,23,31]),
[iquote('0:EmS:15.0,15.1,23.1,31.1')] ).
cnf(33,plain,
~ cUnsatisfiable(u),
inference(obv,[status(thm),theory(equality)],[32]),
[iquote('0:Obv:32.0')] ).
cnf(34,plain,
$false,
inference(unc,[status(thm)],[33,2]),
[iquote('0:UnC:33.0,2.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : KRS101+1 : TPTP v8.1.0. Released v3.1.0.
% 0.12/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n025.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 20:51:34 EDT 2022
% 0.12/0.34 % 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 9 clauses, backtracked 0 clauses, performed 0 splits and kept 26 clauses.
% 0.19/0.45 SPASS allocated 98032 KBytes.
% 0.19/0.45 SPASS spent 0:00:00.10 on the problem.
% 0.19/0.45 0:00:00.03 for the input.
% 0.19/0.45 0:00:00.05 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 4, length 19 :
% 0.19/0.45 % SZS output start Refutation
% See solution above
% 0.19/0.46 Formulae used in the proof : axiom_4 axiom_2 axiom_3
% 0.19/0.46
%------------------------------------------------------------------------------