%------------------------------------------------------------------------------
% File : Metis---2.4
% Problem : MGT093+1 : TPTP v9.3.0. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : metis --show proof --show saturation %s
% Computer : n002.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:16:17 AM UTC 2026
% Result : Theorem 0.13s 0.39s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 26 ( 16 unt; 0 def)
% Number of atoms : 55 ( 33 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 58 ( 29 ~; 25 |; 3 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 8 ( 0 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(xone_compat,axiom,
! [Vm,Vr] :
( ( is_verdict(Vm)
& is_verdict(Vr)
& Vm = compatible
& Vr = conflict )
=> xone_verdict(Vm,Vr) = compatible ) ).
fof(conflict_is_verdict,axiom,
is_verdict(conflict) ).
fof(compatible_is_verdict,axiom,
is_verdict(compatible) ).
fof(odrl644,conjecture,
xone_verdict(compatible,conflict) = compatible ).
fof(subgoal_0,plain,
xone_verdict(compatible,conflict) = compatible,
inference(strip,[],[odrl644]) ).
fof(negate_0_0,plain,
xone_verdict(compatible,conflict) != compatible,
inference(negate,[],[subgoal_0]) ).
fof(normalize_0_0,plain,
xone_verdict(compatible,conflict) != compatible,
inference(canonicalize,[],[negate_0_0]) ).
fof(normalize_0_1,plain,
! [Vm,Vr] :
( Vm != compatible
| Vr != conflict
| ~ is_verdict(Vm)
| ~ is_verdict(Vr)
| xone_verdict(Vm,Vr) = compatible ),
inference(canonicalize,[],[xone_compat]) ).
fof(normalize_0_2,plain,
! [Vm,Vr] :
( Vm != compatible
| Vr != conflict
| ~ is_verdict(Vm)
| ~ is_verdict(Vr)
| xone_verdict(Vm,Vr) = compatible ),
inference(specialize,[],[normalize_0_1]) ).
fof(normalize_0_3,plain,
is_verdict(compatible),
inference(canonicalize,[],[compatible_is_verdict]) ).
fof(normalize_0_4,plain,
is_verdict(conflict),
inference(canonicalize,[],[conflict_is_verdict]) ).
cnf(refute_0_0,plain,
xone_verdict(compatible,conflict) != compatible,
inference(canonicalize,[],[normalize_0_0]) ).
cnf(refute_0_1,plain,
( Vm != compatible
| Vr != conflict
| ~ is_verdict(Vm)
| ~ is_verdict(Vr)
| xone_verdict(Vm,Vr) = compatible ),
inference(canonicalize,[],[normalize_0_2]) ).
cnf(refute_0_2,plain,
( compatible != compatible
| conflict != conflict
| ~ is_verdict(compatible)
| ~ is_verdict(conflict)
| xone_verdict(compatible,conflict) = compatible ),
inference(subst,[],[refute_0_1:[bind(Vm,$fot(compatible)),bind(Vr,$fot(conflict))]]) ).
cnf(refute_0_3,plain,
compatible = compatible,
introduced(tautology,[refl,[$fot(compatible)]]) ).
cnf(refute_0_4,plain,
( conflict != conflict
| ~ is_verdict(compatible)
| ~ is_verdict(conflict)
| xone_verdict(compatible,conflict) = compatible ),
inference(resolve,[$cnf( $equal(compatible,compatible) )],[refute_0_3,refute_0_2]) ).
cnf(refute_0_5,plain,
conflict = conflict,
introduced(tautology,[refl,[$fot(conflict)]]) ).
cnf(refute_0_6,plain,
( ~ is_verdict(compatible)
| ~ is_verdict(conflict)
| xone_verdict(compatible,conflict) = compatible ),
inference(resolve,[$cnf( $equal(conflict,conflict) )],[refute_0_5,refute_0_4]) ).
cnf(refute_0_7,plain,
is_verdict(compatible),
inference(canonicalize,[],[normalize_0_3]) ).
cnf(refute_0_8,plain,
( ~ is_verdict(conflict)
| xone_verdict(compatible,conflict) = compatible ),
inference(resolve,[$cnf( is_verdict(compatible) )],[refute_0_7,refute_0_6]) ).
cnf(refute_0_9,plain,
is_verdict(conflict),
inference(canonicalize,[],[normalize_0_4]) ).
cnf(refute_0_10,plain,
xone_verdict(compatible,conflict) = compatible,
inference(resolve,[$cnf( is_verdict(conflict) )],[refute_0_9,refute_0_8]) ).
cnf(refute_0_11,plain,
( compatible != compatible
| xone_verdict(compatible,conflict) != compatible
| xone_verdict(compatible,conflict) = compatible ),
introduced(tautology,[equality,[$cnf( $equal(xone_verdict(compatible,conflict),compatible) ),[0,0],$fot(compatible)]]) ).
cnf(refute_0_12,plain,
( compatible != compatible
| xone_verdict(compatible,conflict) = compatible ),
inference(resolve,[$cnf( $equal(xone_verdict(compatible,conflict),compatible) )],[refute_0_10,refute_0_11]) ).
cnf(refute_0_13,plain,
compatible != compatible,
inference(resolve,[$cnf( $equal(xone_verdict(compatible,conflict),compatible) )],[refute_0_12,refute_0_0]) ).
cnf(refute_0_14,plain,
$false,
inference(resolve,[$cnf( $equal(compatible,compatible) )],[refute_0_3,refute_0_13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT093+1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.03 % Command : metis --show proof --show saturation %s
% 0.10/0.34 % Computer : n002.cluster.edu
% 0.10/0.34 % Model : x86_64 x86_64
% 0.10/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.34 % Memory : 8046.5625MB
% 0.10/0.34 % OS : Linux 6.8.0-71-generic
% 0.10/0.34 % CPULimit : 300
% 0.10/0.34 % WCLimit : 300
% 0.10/0.34 % DateTime : Mon Sep 7 14:03:52 UTC 2026
% 0.10/0.34 % CPUTime :
% 0.10/0.35 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.13/0.39 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.39
% 0.13/0.39 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 0.13/0.39
%------------------------------------------------------------------------------