%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : MGT089+1 : TPTP v9.3.0. Released v9.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n016.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 8 06:20:01 AM UTC 2026
% Result : Theorem 0.21s 0.54s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 6 ( 4 unt; 0 nHn; 6 RR)
% Number of literals : 8 ( 0 equ; 4 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-4 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(22,axiom,
~ prec(v5,v5,o,o),
file('MGT089+1.p',unknown),
[] ).
cnf(24,axiom,
( ~ equal(u,v)
| leq(u,v) ),
file('MGT089+1.p',unknown),
[] ).
cnf(44,axiom,
( ~ leq(u,v)
| prec(u,v,o,o) ),
file('MGT089+1.p',unknown),
[] ).
cnf(74,plain,
~ leq(v5,v5),
inference(res,[status(thm),theory(equality)],[44,22]),
[iquote('0:Res:44.1,22.0')] ).
cnf(85,plain,
leq(u,u),
inference(eqr,[status(thm),theory(equality)],[24]),
[iquote('0:EqR:24.0')] ).
cnf(86,plain,
$false,
inference(unc,[status(thm)],[85,74]),
[iquote('0:UnC:85.0,74.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT089+1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.04 % Command : run_spass %d %s
% 0.08/0.34 % Computer : n016.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.08/0.34 % CPULimit : 300
% 0.08/0.34 % WCLimit : 300
% 0.08/0.35 % DateTime : Mon Sep 7 14:04:17 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.21/0.54
% 0.21/0.54 SPASS V 3.9
% 0.21/0.54 SPASS beiseite: Proof found.
% 0.21/0.54 % SZS status Theorem
% 0.21/0.54 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.54 SPASS derived 12 clauses, backtracked 0 clauses, performed 0 splits and kept 74 clauses.
% 0.21/0.54 SPASS allocated 98067 KBytes.
% 0.21/0.54 SPASS spent 0:00:00.17 on the problem.
% 0.21/0.54 0:00:00.06 for the input.
% 0.21/0.54 0:00:00.06 for the FLOTTER CNF translation.
% 0.21/0.54 0:00:00.00 for inferences.
% 0.21/0.54 0:00:00.00 for the backtracking.
% 0.21/0.54 0:00:00.00 for the reduction.
% 0.21/0.54
% 0.21/0.54
% 0.21/0.54 Here is a proof with depth 1, length 6 :
% 0.21/0.54 % SZS output start Refutation
% See solution above
% 0.21/0.54 Formulae used in the proof : odrl604 leq_def prec_oo
% 0.21/0.54
%------------------------------------------------------------------------------