%------------------------------------------------------------------------------
% File : Z3---4.15.1
% Problem : MGT093+1 : TPTP v9.3.0. Released v9.3.0.
% Transfm : NO INFORMATION
% Format : NO INFORMATION
% Command : run_E %s %d THM
% Computer : n029.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:24:13 AM UTC 2026
% Result : Theorem 0.14s 0.41s
% Output : Proof 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of formulae : 25 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 160 ( 72 equ)
% Maximal formula atoms : 10 ( 6 avg)
% Number of connectives : 162 ( 40 ~; 36 |; 61 &)
% ( 18 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of FOOLs : 13 ( 13 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 20 ( 18 !; 0 ?; 20 :)
% Comments :
%------------------------------------------------------------------------------
tff(is_verdict_type,type,
is_verdict: $i > $o ).
tff(compatible_type,type,
compatible: $i ).
tff(conflict_type,type,
conflict: $i ).
tff(xone_verdict_type,type,
xone_verdict: ( $i * $i ) > $i ).
tff(1,plain,
( is_verdict(compatible)
<=> is_verdict(compatible) ),
inference(rewrite,[status(thm)],[]) ).
tff(2,axiom,
is_verdict(compatible),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+2.ax',compatible_is_verdict) ).
tff(3,plain,
is_verdict(compatible),
inference(modus_ponens,[status(thm)],[2,1]) ).
tff(4,plain,
( is_verdict(conflict)
<=> is_verdict(conflict) ),
inference(rewrite,[status(thm)],[]) ).
tff(5,axiom,
is_verdict(conflict),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+2.ax',conflict_is_verdict) ).
tff(6,plain,
is_verdict(conflict),
inference(modus_ponens,[status(thm)],[5,4]) ).
tff(7,plain,
( ( xone_verdict(compatible,conflict) != compatible )
<=> ( xone_verdict(compatible,conflict) != compatible ) ),
inference(rewrite,[status(thm)],[]) ).
tff(8,axiom,
xone_verdict(compatible,conflict) != compatible,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',odrl644) ).
tff(9,plain,
xone_verdict(compatible,conflict) != compatible,
inference(modus_ponens,[status(thm)],[8,7]) ).
tff(10,plain,
( ( ( xone_verdict(compatible,conflict) = compatible )
| ~ is_verdict(conflict)
| ~ is_verdict(compatible) )
<=> ( ( xone_verdict(compatible,conflict) = compatible )
| ~ is_verdict(conflict)
| ~ is_verdict(compatible) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(11,plain,
( ( ( xone_verdict(compatible,conflict) = compatible )
| ~ is_verdict(compatible)
| ~ is_verdict(conflict) )
<=> ( ( xone_verdict(compatible,conflict) = compatible )
| ~ is_verdict(conflict)
| ~ is_verdict(compatible) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(12,plain,
( ! [Vm: $i,Vr: $i] :
( ( xone_verdict(compatible,conflict) = compatible )
| ~ is_verdict(compatible)
| ~ is_verdict(conflict) )
<=> ( ( xone_verdict(compatible,conflict) = compatible )
| ~ is_verdict(compatible)
| ~ is_verdict(conflict) ) ),
inference(elim_unused_vars,[status(thm)],[]) ).
tff(13,plain,
( ! [Vm: $i,Vr: $i] :
( ~ ( is_verdict(Vm)
& is_verdict(Vr)
& ( Vm = compatible )
& ( Vr = conflict ) )
| ( xone_verdict(Vm,Vr) = compatible ) )
<=> ! [Vm: $i,Vr: $i] :
( ( xone_verdict(compatible,conflict) = compatible )
| ~ is_verdict(compatible)
| ~ is_verdict(conflict) ) ),
inference(destructive_equality_resolution,[status(thm)],[]) ).
tff(14,plain,
( ! [Vm: $i,Vr: $i] :
( ~ ( is_verdict(Vm)
& is_verdict(Vr)
& ( Vm = compatible )
& ( Vr = conflict ) )
| ( xone_verdict(Vm,Vr) = compatible ) )
<=> ( ( xone_verdict(compatible,conflict) = compatible )
| ~ is_verdict(compatible)
| ~ is_verdict(conflict) ) ),
inference(transitivity,[status(thm)],[13,12]) ).
tff(15,plain,
( ! [Vm: $i,Vr: $i] :
( ~ ( is_verdict(Vm)
& is_verdict(Vr)
& ( Vm = compatible )
& ( Vr = conflict ) )
| ( xone_verdict(Vm,Vr) = compatible ) )
<=> ( ( xone_verdict(compatible,conflict) = compatible )
| ~ is_verdict(conflict)
| ~ is_verdict(compatible) ) ),
inference(transitivity,[status(thm)],[14,11]) ).
tff(16,plain,
^ [Vm: $i,Vr: $i] :
trans(monotonicity(trans(monotonicity(rewrite(( ( is_verdict(Vm)
& is_verdict(Vr)
& ( Vm = compatible ) )
<=> ( is_verdict(Vm)
& is_verdict(Vr)
& ( Vm = compatible ) ) )),
( ( is_verdict(Vm)
& is_verdict(Vr)
& ( Vm = compatible )
& ( Vr = conflict ) )
<=> ( is_verdict(Vm)
& is_verdict(Vr)
& ( Vm = compatible )
& ( Vr = conflict ) ) )),
rewrite(( ( is_verdict(Vm)
& is_verdict(Vr)
& ( Vm = compatible )
& ( Vr = conflict ) )
<=> ( is_verdict(Vm)
& is_verdict(Vr)
& ( Vm = compatible )
& ( Vr = conflict ) ) )),
( ( is_verdict(Vm)
& is_verdict(Vr)
& ( Vm = compatible )
& ( Vr = conflict ) )
<=> ( is_verdict(Vm)
& is_verdict(Vr)
& ( Vm = compatible )
& ( Vr = conflict ) ) )),
( ( ( is_verdict(Vm)
& is_verdict(Vr)
& ( Vm = compatible )
& ( Vr = conflict ) )
=> ( xone_verdict(Vm,Vr) = compatible ) )
<=> ( ( is_verdict(Vm)
& is_verdict(Vr)
& ( Vm = compatible )
& ( Vr = conflict ) )
=> ( xone_verdict(Vm,Vr) = compatible ) ) )),
rewrite(( ( ( is_verdict(Vm)
& is_verdict(Vr)
& ( Vm = compatible )
& ( Vr = conflict ) )
=> ( xone_verdict(Vm,Vr) = compatible ) )
<=> ( ~ ( is_verdict(Vm)
& is_verdict(Vr)
& ( Vm = compatible )
& ( Vr = conflict ) )
| ( xone_verdict(Vm,Vr) = compatible ) ) )),
( ( ( is_verdict(Vm)
& is_verdict(Vr)
& ( Vm = compatible )
& ( Vr = conflict ) )
=> ( xone_verdict(Vm,Vr) = compatible ) )
<=> ( ~ ( is_verdict(Vm)
& is_verdict(Vr)
& ( Vm = compatible )
& ( Vr = conflict ) )
| ( xone_verdict(Vm,Vr) = compatible ) ) )),
inference(bind,[status(th)],[]) ).
tff(17,plain,
( ! [Vm: $i,Vr: $i] :
( ( is_verdict(Vm)
& is_verdict(Vr)
& ( Vm = compatible )
& ( Vr = conflict ) )
=> ( xone_verdict(Vm,Vr) = compatible ) )
<=> ! [Vm: $i,Vr: $i] :
( ~ ( is_verdict(Vm)
& is_verdict(Vr)
& ( Vm = compatible )
& ( Vr = conflict ) )
| ( xone_verdict(Vm,Vr) = compatible ) ) ),
inference(quant_intro,[status(thm)],[16]) ).
tff(18,plain,
( ! [Vm: $i,Vr: $i] :
( ( is_verdict(Vm)
& is_verdict(Vr)
& ( Vm = compatible )
& ( Vr = conflict ) )
=> ( xone_verdict(Vm,Vr) = compatible ) )
<=> ( ( xone_verdict(compatible,conflict) = compatible )
| ~ is_verdict(conflict)
| ~ is_verdict(compatible) ) ),
inference(transitivity,[status(thm)],[17,15]) ).
tff(19,axiom,
! [Vm: $i,Vr: $i] :
( ( is_verdict(Vm)
& is_verdict(Vr)
& ( Vm = compatible )
& ( Vr = conflict ) )
=> ( xone_verdict(Vm,Vr) = compatible ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+3.ax',xone_compat) ).
tff(20,plain,
( ( xone_verdict(compatible,conflict) = compatible )
| ~ is_verdict(conflict)
| ~ is_verdict(compatible) ),
inference(modus_ponens,[status(thm)],[19,18]) ).
tff(21,plain,
( ( xone_verdict(compatible,conflict) = compatible )
| ~ is_verdict(conflict)
| ~ is_verdict(compatible) ),
inference(modus_ponens,[status(thm)],[20,10]) ).
tff(22,plain,
( ( xone_verdict(compatible,conflict) = compatible )
| ~ is_verdict(conflict)
| ~ is_verdict(compatible) ),
inference(modus_ponens,[status(thm)],[21,10]) ).
tff(23,plain,
( ( xone_verdict(compatible,conflict) = compatible )
| ~ is_verdict(conflict)
| ~ is_verdict(compatible) ),
inference(modus_ponens,[status(thm)],[22,10]) ).
tff(24,plain,
( ( xone_verdict(compatible,conflict) = compatible )
| ~ is_verdict(conflict)
| ~ is_verdict(compatible) ),
inference(modus_ponens,[status(thm)],[23,10]) ).
tff(25,plain,
$false,
inference(unit_resolution,[status(thm)],[24,9,6,3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT093+1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.03 % Command : run_E %s %d THM
% 0.08/0.34 % Computer : n029.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.34 % DateTime : Mon Sep 7 14:03:28 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.14/0.41 % SZS status Theorem
% 0.14/0.41 % SZS output start Proof
% See solution above
% 0.14/0.42 % E exiting
%------------------------------------------------------------------------------