%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : KRS078+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n027.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.50s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 18 ( 4 unt; 0 nHn; 18 RR)
% Number of literals : 37 ( 0 equ; 21 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 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_19_13721),
file('KRS078+1.p',unknown),
[] ).
cnf(8,axiom,
( ~ rs(skf11(u),v)
| cp(v) ),
file('KRS078+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ cUnsatisfiable(u)
| rr(u,skf9(u)) ),
file('KRS078+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ cUnsatisfiable(u)
| rs(u,skf12(u)) ),
file('KRS078+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ cUnsatisfiable(u)
| ~ cp(skf12(u)) ),
file('KRS078+1.p',unknown),
[] ).
cnf(13,axiom,
( ~ rr(u,v)
| rinvR(v,u) ),
file('KRS078+1.p',unknown),
[] ).
cnf(14,axiom,
( ~ cUnsatisfiable(u)
| rinvR(skf9(v),skf11(v)) ),
file('KRS078+1.p',unknown),
[] ).
cnf(15,axiom,
( ~ cUnsatisfiable(u)
| ~ rinvR(skf9(v),w)
| ~ rinvR(skf9(v),x)
| equal(w,x) ),
file('KRS078+1.p',unknown),
[] ).
cnf(21,plain,
( ~ cUnsatisfiable(u)
| rinvR(skf9(u),u) ),
inference(res,[status(thm),theory(equality)],[9,13]),
[iquote('0:Res:9.1,13.0')] ).
cnf(23,plain,
rinvR(skf9(u),skf11(u)),
inference(ems,[status(thm)],[14,2]),
[iquote('0:EmS:14.0,2.0')] ).
cnf(24,plain,
( ~ rinvR(skf9(u),v)
| ~ rinvR(skf9(u),w)
| equal(v,w) ),
inference(ems,[status(thm)],[15,2]),
[iquote('0:EmS:15.0,2.0')] ).
cnf(25,plain,
( ~ rinvR(skf9(u),v)
| equal(skf11(u),v) ),
inference(res,[status(thm),theory(equality)],[23,24]),
[iquote('0:Res:23.0,24.0')] ).
cnf(29,plain,
( ~ cUnsatisfiable(u)
| equal(skf11(u),u) ),
inference(res,[status(thm),theory(equality)],[21,25]),
[iquote('0:Res:21.1,25.0')] ).
cnf(32,plain,
( ~ cUnsatisfiable(u)
| ~ rs(u,v)
| cp(v) ),
inference(spl,[status(thm),theory(equality)],[29,8]),
[iquote('0:SpL:29.1,8.0')] ).
cnf(36,plain,
( ~ cUnsatisfiable(u)
| ~ cUnsatisfiable(u)
| cp(skf12(u)) ),
inference(res,[status(thm),theory(equality)],[10,32]),
[iquote('0:Res:10.1,32.1')] ).
cnf(37,plain,
( ~ cUnsatisfiable(u)
| cp(skf12(u)) ),
inference(obv,[status(thm),theory(equality)],[36]),
[iquote('0:Obv:36.0')] ).
cnf(38,plain,
~ cUnsatisfiable(u),
inference(mrr,[status(thm)],[37,11]),
[iquote('0:MRR:37.1,11.1')] ).
cnf(39,plain,
$false,
inference(unc,[status(thm)],[38,2]),
[iquote('0:UnC:38.0,2.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : KRS078+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.12 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n027.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue Jun 7 13:59:25 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.50
% 0.19/0.50 SPASS V 3.9
% 0.19/0.50 SPASS beiseite: Proof found.
% 0.19/0.50 % SZS status Theorem
% 0.19/0.50 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.50 SPASS derived 17 clauses, backtracked 0 clauses, performed 0 splits and kept 30 clauses.
% 0.19/0.50 SPASS allocated 98412 KBytes.
% 0.19/0.50 SPASS spent 0:00:00.16 on the problem.
% 0.19/0.50 0:00:00.04 for the input.
% 0.19/0.50 0:00:00.10 for the FLOTTER CNF translation.
% 0.19/0.50 0:00:00.00 for inferences.
% 0.19/0.50 0:00:00.00 for the backtracking.
% 0.19/0.50 0:00:00.00 for the reduction.
% 0.19/0.50
% 0.19/0.50
% 0.19/0.50 Here is a proof with depth 5, length 18 :
% 0.19/0.50 % SZS output start Refutation
% See solution above
% 0.19/0.50 Formulae used in the proof : axiom_4 axiom_2 axiom_3
% 0.19/0.50
%------------------------------------------------------------------------------