%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : KRS069+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:27 EDT 2022
% Result : Unsatisfiable 0.20s 0.46s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of clauses : 22 ( 5 unt; 0 nHn; 22 RR)
% Number of literals : 45 ( 0 equ; 26 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 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(2,axiom,
cUnsatisfiable(i2003_11_14_17_18_2750),
file('KRS069+1.p',unknown),
[] ).
cnf(5,axiom,
cp1(skf3(u)),
file('KRS069+1.p',unknown),
[] ).
cnf(7,axiom,
~ cp1(skf4(u)),
file('KRS069+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ cUnsatisfiable(u)
| rf1(u,skf3(u)) ),
file('KRS069+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ cUnsatisfiable(u)
| rf2(u,skf4(u)) ),
file('KRS069+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ cUnsatisfiable(u)
| rf3(u,skf5(u)) ),
file('KRS069+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ rf3(u,v)
| rf1(u,v) ),
file('KRS069+1.p',unknown),
[] ).
cnf(13,axiom,
( ~ rf3(u,v)
| rf2(u,v) ),
file('KRS069+1.p',unknown),
[] ).
cnf(14,axiom,
( ~ rf1(u,v)
| ~ rf1(u,w)
| equal(w,v) ),
file('KRS069+1.p',unknown),
[] ).
cnf(15,axiom,
( ~ rf2(u,v)
| ~ rf2(u,w)
| equal(w,v) ),
file('KRS069+1.p',unknown),
[] ).
cnf(18,plain,
( ~ cUnsatisfiable(u)
| rf2(u,skf5(u)) ),
inference(res,[status(thm),theory(equality)],[11,13]),
[iquote('0:Res:11.1,13.0')] ).
cnf(19,plain,
( ~ cUnsatisfiable(u)
| rf1(u,skf5(u)) ),
inference(res,[status(thm),theory(equality)],[11,12]),
[iquote('0:Res:11.1,12.0')] ).
cnf(20,plain,
( ~ cUnsatisfiable(u)
| ~ rf2(u,v)
| equal(v,skf4(u)) ),
inference(res,[status(thm),theory(equality)],[10,15]),
[iquote('0:Res:10.1,15.0')] ).
cnf(23,plain,
( ~ cUnsatisfiable(u)
| ~ cUnsatisfiable(u)
| equal(skf5(u),skf4(u)) ),
inference(res,[status(thm),theory(equality)],[18,20]),
[iquote('0:Res:18.1,20.1')] ).
cnf(24,plain,
( ~ cUnsatisfiable(u)
| equal(skf5(u),skf4(u)) ),
inference(obv,[status(thm),theory(equality)],[23]),
[iquote('0:Obv:23.0')] ).
cnf(27,plain,
( ~ cUnsatisfiable(u)
| rf1(u,skf4(u)) ),
inference(rew,[status(thm),theory(equality)],[24,19]),
[iquote('0:Rew:24.1,19.1')] ).
cnf(31,plain,
( ~ cUnsatisfiable(u)
| ~ rf1(u,v)
| equal(v,skf3(u)) ),
inference(res,[status(thm),theory(equality)],[9,14]),
[iquote('0:Res:9.1,14.0')] ).
cnf(36,plain,
( ~ cUnsatisfiable(u)
| ~ cUnsatisfiable(u)
| equal(skf4(u),skf3(u)) ),
inference(res,[status(thm),theory(equality)],[27,31]),
[iquote('0:Res:27.1,31.1')] ).
cnf(37,plain,
( ~ cUnsatisfiable(u)
| equal(skf4(u),skf3(u)) ),
inference(obv,[status(thm),theory(equality)],[36]),
[iquote('0:Obv:36.0')] ).
cnf(49,plain,
( ~ cUnsatisfiable(u)
| ~ cp1(skf3(u)) ),
inference(spl,[status(thm),theory(equality)],[37,7]),
[iquote('0:SpL:37.1,7.0')] ).
cnf(50,plain,
~ cUnsatisfiable(u),
inference(mrr,[status(thm)],[49,5]),
[iquote('0:MRR:49.1,5.0')] ).
cnf(51,plain,
$false,
inference(unc,[status(thm)],[50,2]),
[iquote('0:UnC:50.0,2.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : KRS069+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jun 7 15:12:05 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.46
% 0.20/0.46 SPASS V 3.9
% 0.20/0.46 SPASS beiseite: Proof found.
% 0.20/0.46 % SZS status Theorem
% 0.20/0.46 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.46 SPASS derived 30 clauses, backtracked 0 clauses, performed 0 splits and kept 34 clauses.
% 0.20/0.46 SPASS allocated 97826 KBytes.
% 0.20/0.46 SPASS spent 0:00:00.11 on the problem.
% 0.20/0.46 0:00:00.04 for the input.
% 0.20/0.46 0:00:00.05 for the FLOTTER CNF translation.
% 0.20/0.46 0:00:00.00 for inferences.
% 0.20/0.46 0:00:00.00 for the backtracking.
% 0.20/0.46 0:00:00.00 for the reduction.
% 0.20/0.46
% 0.20/0.46
% 0.20/0.46 Here is a proof with depth 3, length 22 :
% 0.20/0.46 % SZS output start Refutation
% See solution above
% 0.20/0.46 Formulae used in the proof : axiom_6 axiom_2 axiom_7 axiom_8 axiom_3 axiom_4
% 0.20/0.46
%------------------------------------------------------------------------------