%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : KRS015-1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n021.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:17 EDT 2022
% Result : Unsatisfiable 0.20s 0.42s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of clauses : 24 ( 5 unt; 0 nHn; 24 RR)
% Number of literals : 53 ( 0 equ; 34 neg)
% Maximal clause size : 4 ( 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(1,axiom,
( ~ c(u)
| t2least(u) ),
file('KRS015-1.p',unknown),
[] ).
cnf(3,axiom,
( ~ t2least(u)
| ~ equalish(u1r2(u),u1r1(u)) ),
file('KRS015-1.p',unknown),
[] ).
cnf(4,axiom,
( ~ t2least(u)
| t(u,u1r1(u)) ),
file('KRS015-1.p',unknown),
[] ).
cnf(5,axiom,
( ~ t2least(u)
| t(u,u1r2(u)) ),
file('KRS015-1.p',unknown),
[] ).
cnf(7,axiom,
( ~ d(u)
| t1most(u) ),
file('KRS015-1.p',unknown),
[] ).
cnf(9,axiom,
( ~ t1most(u)
| ~ t(u,v)
| ~ t(u,w)
| equalish(w,v) ),
file('KRS015-1.p',unknown),
[] ).
cnf(13,axiom,
( ~ e(u)
| r(u,u4r4(u)) ),
file('KRS015-1.p',unknown),
[] ).
cnf(14,axiom,
( ~ e(u)
| ~ r(u,v)
| s(u,v) ),
file('KRS015-1.p',unknown),
[] ).
cnf(16,axiom,
( ~ e(u)
| ~ s(u,v)
| d(v) ),
file('KRS015-1.p',unknown),
[] ).
cnf(17,axiom,
( ~ e(u)
| ~ r(u,v)
| c(v) ),
file('KRS015-1.p',unknown),
[] ).
cnf(26,axiom,
e(exist),
file('KRS015-1.p',unknown),
[] ).
cnf(31,plain,
( ~ r(exist,u)
| s(exist,u) ),
inference(res,[status(thm),theory(equality)],[26,14]),
[iquote('0:Res:26.0,14.0')] ).
cnf(33,plain,
( ~ s(exist,u)
| d(u) ),
inference(res,[status(thm),theory(equality)],[26,16]),
[iquote('0:Res:26.0,16.0')] ).
cnf(34,plain,
( ~ r(exist,u)
| c(u) ),
inference(res,[status(thm),theory(equality)],[26,17]),
[iquote('0:Res:26.0,17.0')] ).
cnf(35,plain,
r(exist,u4r4(exist)),
inference(res,[status(thm),theory(equality)],[26,13]),
[iquote('0:Res:26.0,13.0')] ).
cnf(57,plain,
c(u4r4(exist)),
inference(res,[status(thm),theory(equality)],[35,34]),
[iquote('0:Res:35.0,34.0')] ).
cnf(58,plain,
( ~ r(exist,u)
| d(u) ),
inference(res,[status(thm),theory(equality)],[31,33]),
[iquote('0:Res:31.1,33.0')] ).
cnf(59,plain,
d(u4r4(exist)),
inference(res,[status(thm),theory(equality)],[35,58]),
[iquote('0:Res:35.0,58.0')] ).
cnf(83,plain,
( ~ t2least(u)
| ~ t1most(u)
| ~ t(u,v)
| equalish(v,u1r1(u)) ),
inference(res,[status(thm),theory(equality)],[4,9]),
[iquote('0:Res:4.1,9.1')] ).
cnf(87,plain,
( ~ t2least(u)
| ~ t1most(u)
| ~ t2least(u)
| ~ t(u,u1r2(u)) ),
inference(res,[status(thm),theory(equality)],[83,3]),
[iquote('0:Res:83.3,3.1')] ).
cnf(88,plain,
( ~ t1most(u)
| ~ t2least(u)
| ~ t(u,u1r2(u)) ),
inference(obv,[status(thm),theory(equality)],[87]),
[iquote('0:Obv:87.0')] ).
cnf(89,plain,
( ~ t1most(u)
| ~ t2least(u) ),
inference(mrr,[status(thm)],[88,5]),
[iquote('0:MRR:88.2,5.1')] ).
cnf(93,plain,
( ~ d(u)
| ~ c(u) ),
inference(ems,[status(thm)],[89,7,1]),
[iquote('0:EmS:89.0,89.1,7.1,1.1')] ).
cnf(99,plain,
$false,
inference(ems,[status(thm)],[93,59,57]),
[iquote('0:EmS:93.0,93.1,59.0,57.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : KRS015-1 : TPTP v8.1.0. Released v2.0.0.
% 0.06/0.13 % Command : run_spass %d %s
% 0.14/0.34 % Computer : n021.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Tue Jun 7 05:43:21 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.42
% 0.20/0.42 SPASS V 3.9
% 0.20/0.42 SPASS beiseite: Proof found.
% 0.20/0.42 % SZS status Theorem
% 0.20/0.42 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.42 SPASS derived 44 clauses, backtracked 0 clauses, performed 0 splits and kept 51 clauses.
% 0.20/0.42 SPASS allocated 75655 KBytes.
% 0.20/0.42 SPASS spent 0:00:00.07 on the problem.
% 0.20/0.42 0:00:00.04 for the input.
% 0.20/0.42 0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.42 0:00:00.00 for inferences.
% 0.20/0.42 0:00:00.00 for the backtracking.
% 0.20/0.42 0:00:00.00 for the reduction.
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 Here is a proof with depth 4, length 24 :
% 0.20/0.42 % SZS output start Refutation
% See solution above
% 0.20/0.42 Formulae used in the proof : clause_2 clause_4 clause_5 clause_6 clause_8 clause_10 clause_14 clause_15 clause_17 clause_18 clause_1
% 0.20/0.42
%------------------------------------------------------------------------------