%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : KRS079+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n017.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:29 EDT 2022
% Result : Unsatisfiable 0.19s 0.45s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 12
% Syntax : Number of clauses : 26 ( 6 unt; 0 nHn; 26 RR)
% Number of literals : 56 ( 0 equ; 32 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 8 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,
cowlThing(u),
file('KRS079+1.p',unknown),
[] ).
cnf(2,axiom,
cUnsatisfiable(i2003_11_14_17_19_17492),
file('KRS079+1.p',unknown),
[] ).
cnf(5,axiom,
cp1(skf4(u)),
file('KRS079+1.p',unknown),
[] ).
cnf(6,axiom,
cp2(skf3(u)),
file('KRS079+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ cp2(u)
| ~ cp1(u) ),
file('KRS079+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ cUnsatisfiable(u)
| rf2(u,skf3(u)) ),
file('KRS079+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ cUnsatisfiable(u)
| rf1(u,skf4(u)) ),
file('KRS079+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ cUnsatisfiable(u)
| rr(u,skf5(u)) ),
file('KRS079+1.p',unknown),
[] ).
cnf(13,axiom,
( ~ rr(u,v)
| rf1(u,v) ),
file('KRS079+1.p',unknown),
[] ).
cnf(14,axiom,
( ~ rr(u,v)
| rf2(u,v) ),
file('KRS079+1.p',unknown),
[] ).
cnf(15,axiom,
( ~ cowlThing(u)
| ~ rf1(u,v)
| ~ rf1(u,w)
| equal(v,w) ),
file('KRS079+1.p',unknown),
[] ).
cnf(16,axiom,
( ~ cowlThing(u)
| ~ rf2(u,v)
| ~ rf2(u,w)
| equal(v,w) ),
file('KRS079+1.p',unknown),
[] ).
cnf(18,plain,
( ~ rf2(u,v)
| ~ rf2(u,w)
| equal(w,v) ),
inference(mrr,[status(thm)],[16,1]),
[iquote('0:MRR:16.0,1.0')] ).
cnf(19,plain,
( ~ rf1(u,v)
| ~ rf1(u,w)
| equal(w,v) ),
inference(mrr,[status(thm)],[15,1]),
[iquote('0:MRR:15.0,1.0')] ).
cnf(21,plain,
( ~ cUnsatisfiable(u)
| rf2(u,skf5(u)) ),
inference(res,[status(thm),theory(equality)],[12,14]),
[iquote('0:Res:12.1,14.0')] ).
cnf(22,plain,
( ~ cUnsatisfiable(u)
| rf1(u,skf5(u)) ),
inference(res,[status(thm),theory(equality)],[12,13]),
[iquote('0:Res:12.1,13.0')] ).
cnf(23,plain,
( ~ cUnsatisfiable(u)
| ~ rf2(u,v)
| equal(v,skf3(u)) ),
inference(res,[status(thm),theory(equality)],[10,18]),
[iquote('0:Res:10.1,18.0')] ).
cnf(26,plain,
( ~ cUnsatisfiable(u)
| ~ cUnsatisfiable(u)
| equal(skf5(u),skf3(u)) ),
inference(res,[status(thm),theory(equality)],[21,23]),
[iquote('0:Res:21.1,23.1')] ).
cnf(27,plain,
( ~ cUnsatisfiable(u)
| equal(skf5(u),skf3(u)) ),
inference(obv,[status(thm),theory(equality)],[26]),
[iquote('0:Obv:26.0')] ).
cnf(30,plain,
( ~ cUnsatisfiable(u)
| rf1(u,skf3(u)) ),
inference(rew,[status(thm),theory(equality)],[27,22]),
[iquote('0:Rew:27.1,22.1')] ).
cnf(34,plain,
( ~ cUnsatisfiable(u)
| ~ rf1(u,v)
| equal(v,skf4(u)) ),
inference(res,[status(thm),theory(equality)],[11,19]),
[iquote('0:Res:11.1,19.0')] ).
cnf(38,plain,
( ~ cUnsatisfiable(u)
| ~ cUnsatisfiable(u)
| equal(skf4(u),skf3(u)) ),
inference(res,[status(thm),theory(equality)],[30,34]),
[iquote('0:Res:30.1,34.1')] ).
cnf(39,plain,
( ~ cUnsatisfiable(u)
| equal(skf4(u),skf3(u)) ),
inference(obv,[status(thm),theory(equality)],[38]),
[iquote('0:Obv:38.0')] ).
cnf(42,plain,
( ~ cUnsatisfiable(u)
| cp1(skf3(u)) ),
inference(spr,[status(thm),theory(equality)],[39,5]),
[iquote('0:SpR:39.1,5.0')] ).
cnf(44,plain,
~ cUnsatisfiable(u),
inference(ems,[status(thm)],[9,6,42]),
[iquote('0:EmS:9.0,9.1,6.0,42.1')] ).
cnf(45,plain,
$false,
inference(unc,[status(thm)],[44,2]),
[iquote('0:UnC:44.0,2.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : KRS079+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.12 % Command : run_spass %d %s
% 0.11/0.33 % Computer : n017.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % 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 18:11:17 EDT 2022
% 0.11/0.33 % 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/sandbox2/benchmark/theBenchmark.p
% 0.19/0.45 SPASS derived 22 clauses, backtracked 0 clauses, performed 0 splits and kept 28 clauses.
% 0.19/0.45 SPASS allocated 97848 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.04 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 26 :
% 0.19/0.45 % SZS output start Refutation
% See solution above
% 0.19/0.45 Formulae used in the proof : axiom_0 axiom_6 axiom_2 axiom_3 axiom_7 axiom_8 axiom_4 axiom_5
% 0.19/0.45
%------------------------------------------------------------------------------