%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : KRS089+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:31 EDT 2022
% Result : Unsatisfiable 0.41s 0.63s
% Output : Refutation 0.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of clauses : 18 ( 6 unt; 4 nHn; 18 RR)
% Number of literals : 41 ( 0 equ; 21 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 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(1,axiom,
cowlThing(u),
file('KRS089+1.p',unknown),
[] ).
cnf(3,axiom,
cUnsatisfiable(i2003_11_14_17_19_53168),
file('KRS089+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ cowlThing(u)
| rp(u,ispy) ),
file('KRS089+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ rp(u,v)
| rinvP(v,u) ),
file('KRS089+1.p',unknown),
[] ).
cnf(13,axiom,
( ~ cUnsatisfiable(u)
| ~ equal(skf5(u),skf4(u)) ),
file('KRS089+1.p',unknown),
[] ).
cnf(14,axiom,
( ~ cUnsatisfiable(u)
| ~ equal(skf5(u),skf3(u)) ),
file('KRS089+1.p',unknown),
[] ).
cnf(15,axiom,
( ~ cUnsatisfiable(u)
| ~ equal(skf4(u),skf3(u)) ),
file('KRS089+1.p',unknown),
[] ).
cnf(16,axiom,
( ~ rinvP(ispy,u)
| ~ rinvP(ispy,v)
| ~ rinvP(ispy,w)
| equal(v,u)
| equal(w,u)
| equal(w,v) ),
file('KRS089+1.p',unknown),
[] ).
cnf(17,plain,
rp(u,ispy),
inference(mrr,[status(thm)],[7,1]),
[iquote('0:MRR:7.0,1.0')] ).
cnf(18,plain,
rinvP(ispy,u),
inference(res,[status(thm),theory(equality)],[17,11]),
[iquote('0:Res:17.0,11.0')] ).
cnf(20,plain,
( equal(u,v)
| equal(w,v)
| equal(w,u) ),
inference(mrr,[status(thm)],[16,18]),
[iquote('0:MRR:16.2,16.0,16.1,18.0')] ).
cnf(76,plain,
( ~ cUnsatisfiable(u)
| ~ equal(v,skf3(u))
| equal(w,v)
| equal(w,skf5(u)) ),
inference(spl,[status(thm),theory(equality)],[20,14]),
[iquote('0:SpL:20.0,14.1')] ).
cnf(571,plain,
( ~ cUnsatisfiable(u)
| equal(v,skf3(u))
| equal(v,skf5(u)) ),
inference(eqr,[status(thm),theory(equality)],[76]),
[iquote('0:EqR:76.1')] ).
cnf(641,plain,
( ~ cUnsatisfiable(u)
| ~ cUnsatisfiable(u)
| ~ equal(v,skf4(u))
| equal(v,skf3(u)) ),
inference(spl,[status(thm),theory(equality)],[571,13]),
[iquote('0:SpL:571.2,13.1')] ).
cnf(643,plain,
( ~ cUnsatisfiable(u)
| ~ equal(v,skf4(u))
| equal(v,skf3(u)) ),
inference(obv,[status(thm),theory(equality)],[641]),
[iquote('0:Obv:641.0')] ).
cnf(647,plain,
( ~ cUnsatisfiable(u)
| equal(skf4(u),skf3(u)) ),
inference(eqr,[status(thm),theory(equality)],[643]),
[iquote('0:EqR:643.1')] ).
cnf(688,plain,
~ cUnsatisfiable(u),
inference(mrr,[status(thm)],[647,15]),
[iquote('0:MRR:647.1,15.1')] ).
cnf(689,plain,
$false,
inference(unc,[status(thm)],[688,3]),
[iquote('0:UnC:688.0,3.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KRS089+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n029.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:19:35 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.41/0.63
% 0.41/0.63 SPASS V 3.9
% 0.41/0.63 SPASS beiseite: Proof found.
% 0.41/0.63 % SZS status Theorem
% 0.41/0.63 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.41/0.63 SPASS derived 572 clauses, backtracked 0 clauses, performed 3 splits and kept 348 clauses.
% 0.41/0.63 SPASS allocated 98071 KBytes.
% 0.41/0.63 SPASS spent 0:00:00.27 on the problem.
% 0.41/0.63 0:00:00.04 for the input.
% 0.41/0.63 0:00:00.04 for the FLOTTER CNF translation.
% 0.41/0.63 0:00:00.01 for inferences.
% 0.41/0.63 0:00:00.00 for the backtracking.
% 0.41/0.63 0:00:00.16 for the reduction.
% 0.41/0.63
% 0.41/0.63
% 0.41/0.63 Here is a proof with depth 4, length 18 :
% 0.41/0.63 % SZS output start Refutation
% See solution above
% 0.41/0.63 Formulae used in the proof : axiom_0 axiom_7 axiom_3 axiom_4 axiom_2 axiom_5
% 0.41/0.63
%------------------------------------------------------------------------------