%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : MGT070+1 : TPTP v9.3.0. Released v9.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n012.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:19:59 AM UTC 2026
% Result : Theorem 0.07s 0.40s
% Output : Refutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 7 ( 4 unt; 0 nHn; 7 RR)
% Number of literals : 12 ( 0 equ; 8 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(6,axiom,
leq(ninf,u),
file('MGT070+1.p',unknown),
[] ).
cnf(7,axiom,
leq(u,nsup),
file('MGT070+1.p',unknown),
[] ).
cnf(39,axiom,
( ~ leq(u,v)
| ~ leq(w,u)
| completion_compatible(u,w,v) ),
file('MGT070+1.p',unknown),
[] ).
cnf(40,axiom,
( ~ leq(ninf,u)
| ~ leq(u,nsup)
| ~ completion_compatible(u,ninf,nsup) ),
file('MGT070+1.p',unknown),
[] ).
cnf(61,plain,
~ completion_compatible(u,ninf,nsup),
inference(mrr,[status(thm)],[40,6,7]),
[iquote('0:MRR:40.0,40.1,6.0,7.0')] ).
cnf(62,plain,
( ~ leq(ninf,u)
| ~ leq(u,nsup) ),
inference(res,[status(thm),theory(equality)],[39,61]),
[iquote('0:Res:39.2,61.0')] ).
cnf(63,plain,
$false,
inference(mrr,[status(thm)],[62,6,7]),
[iquote('0:MRR:62.0,62.1,6.0,7.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : MGT070+1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.02 % Command : run_spass %d %s
% 0.03/0.30 % Computer : n012.cluster.edu
% 0.03/0.30 % Model : x86_64 x86_64
% 0.03/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.30 % Memory : 8046.5625MB
% 0.03/0.30 % OS : Linux 6.8.0-71-generic
% 0.03/0.30 % CPULimit : 300
% 0.03/0.30 % WCLimit : 300
% 0.03/0.30 % DateTime : Mon Sep 7 13:53:41 UTC 2026
% 0.03/0.30 % CPUTime :
% 0.07/0.40
% 0.07/0.40 SPASS V 3.9
% 0.07/0.40 SPASS beiseite: Proof found.
% 0.07/0.40 % SZS status Theorem
% 0.07/0.40 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.40 SPASS derived 1 clauses, backtracked 0 clauses, performed 0 splits and kept 54 clauses.
% 0.07/0.40 SPASS allocated 98341 KBytes.
% 0.07/0.40 SPASS spent 0:00:00.09 on the problem.
% 0.07/0.40 0:00:00.03 for the input.
% 0.07/0.40 0:00:00.03 for the FLOTTER CNF translation.
% 0.07/0.40 0:00:00.00 for inferences.
% 0.07/0.40 0:00:00.00 for the backtracking.
% 0.07/0.40 0:00:00.00 for the reduction.
% 0.07/0.40
% 0.07/0.40
% 0.07/0.40 Here is a proof with depth 1, length 7 :
% 0.07/0.40 % SZS output start Refutation
% See solution above
% 0.07/0.40 Formulae used in the proof : h_inf_lb h_sup_ub completion_compat unknown_sound_compatible
% 0.07/0.40
%------------------------------------------------------------------------------