%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : MGT094+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n004.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.22s 0.55s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 5 ( 4 unt; 1 nHn; 5 RR)
% Number of literals : 6 ( 0 equ; 2 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-4 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-6 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(75,axiom,
~ axis_subsumes(v0,v800,v0,v600),
file('MGT094+1.p',unknown),
[] ).
cnf(94,axiom,
~ equal(subs_verdict(v0,v800,present,v0,v600,present),conflict),
file('MGT094+1.p',unknown),
[] ).
cnf(112,axiom,
( equal(subs_verdict(u,v,present,w,x,present),conflict)
| axis_subsumes(u,v,w,x) ),
file('MGT094+1.p',unknown),
[] ).
cnf(130,plain,
axis_subsumes(v0,v800,v0,v600),
inference(res,[status(thm),theory(equality)],[112,94]),
[iquote('0:Res:112.1,94.0')] ).
cnf(147,plain,
$false,
inference(mrr,[status(thm)],[130,75]),
[iquote('0:MRR:130.0,75.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT094+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.03 % Command : run_spass %d %s
% 0.08/0.35 % Computer : n004.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Mon Sep 7 14:25:15 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.22/0.55
% 0.22/0.55 SPASS V 3.9
% 0.22/0.55 SPASS beiseite: Proof found.
% 0.22/0.55 % SZS status Theorem
% 0.22/0.55 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.55 SPASS derived 9 clauses, backtracked 0 clauses, performed 0 splits and kept 125 clauses.
% 0.22/0.55 SPASS allocated 98132 KBytes.
% 0.22/0.55 SPASS spent 0:00:00.17 on the problem.
% 0.22/0.55 0:00:00.06 for the input.
% 0.22/0.55 0:00:00.06 for the FLOTTER CNF translation.
% 0.22/0.55 0:00:00.00 for inferences.
% 0.22/0.55 0:00:00.00 for the backtracking.
% 0.22/0.55 0:00:00.01 for the reduction.
% 0.22/0.55
% 0.22/0.55
% 0.22/0.55 Here is a proof with depth 1, length 5 :
% 0.22/0.55 % SZS output start Refutation
% See solution above
% 0.22/0.55 Formulae used in the proof : no_subs_hint odrl653 subs_present_no
% 0.22/0.55
%------------------------------------------------------------------------------