%------------------------------------------------------------------------------
% File : LEO-II---2.3.1
% Problem : MGT094+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% Transfm : none
% Format : tptp:raw
% Command : leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox2/solver/bin/eprover /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n020.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 : Wed Oct 7 10:31:51 AM UTC 2026
% Result : Theorem 0.09s 0.26s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 14
% Syntax : Number of formulae : 62 ( 58 unt; 0 typ; 0 def)
% Number of atoms : 173 ( 82 equ; 0 cnn)
% Maximal formula atoms : 2 ( 2 avg)
% Number of connectives : 239 ( 33 ~; 8 |; 0 &; 195 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 31 ( 28 usr; 15 con; 0-6 aty)
% Number of variables : 44 ( 0 ^; 44 !; 0 ?; 44 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_absent,type,
absent: $i ).
thf(tp_axis_compatible,type,
axis_compatible: $i > $i > $i > $i > $o ).
thf(tp_axis_conflict,type,
axis_conflict: $i > $i > $i > $i > $o ).
thf(tp_axis_subsumes,type,
axis_subsumes: $i > $i > $i > $i > $o ).
thf(tp_box_subs,type,
box_subs: $i > $i > $i ).
thf(tp_box_verdict,type,
box_verdict: $i > $i > $i ).
thf(tp_compatible,type,
compatible: $i ).
thf(tp_conflict,type,
conflict: $i ).
thf(tp_in_closed,type,
in_closed: $i > $i > $i > $o ).
thf(tp_in_lopen,type,
in_lopen: $i > $i > $i > $o ).
thf(tp_in_open,type,
in_open: $i > $i > $i > $o ).
thf(tp_in_ropen,type,
in_ropen: $i > $i > $i > $o ).
thf(tp_is_presence,type,
is_presence: $i > $o ).
thf(tp_is_verdict,type,
is_verdict: $i > $o ).
thf(tp_leq,type,
leq: $i > $i > $o ).
thf(tp_less,type,
less: $i > $i > $o ).
thf(tp_present,type,
present: $i ).
thf(tp_subs_verdict,type,
subs_verdict: $i > $i > $i > $i > $i > $i > $i ).
thf(tp_unknown,type,
unknown: $i ).
thf(tp_v0,type,
v0: $i ).
thf(tp_v150,type,
v150: $i ).
thf(tp_v16,type,
v16: $i ).
thf(tp_v300,type,
v300: $i ).
thf(tp_v32,type,
v32: $i ).
thf(tp_v400,type,
v400: $i ).
thf(tp_v600,type,
v600: $i ).
thf(tp_v800,type,
v800: $i ).
thf(tp_val,type,
val: $i > $o ).
thf(1,axiom,
~ ( axis_subsumes @ v0 @ v800 @ v0 @ v600 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',no_subs_hint) ).
thf(3,axiom,
less @ v600 @ v800,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v600_v800) ).
thf(24,axiom,
less @ v0 @ v800,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v0_v800) ).
thf(25,axiom,
less @ v0 @ v600,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v0_v600) ).
thf(31,axiom,
val @ v800,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',val_v800) ).
thf(32,axiom,
val @ v600,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',val_v600) ).
thf(38,axiom,
val @ v0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',val_v0) ).
thf(44,axiom,
! [L1: $i,H1: $i,L2: $i,H2: $i] :
( ~ ( axis_subsumes @ L1 @ H1 @ L2 @ H2 )
=> ( ( subs_verdict @ L1 @ H1 @ present @ L2 @ H2 @ present )
= conflict ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subs_present_no) ).
thf(50,axiom,
present != absent,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',presence_distinct) ).
thf(52,axiom,
is_presence @ present,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',present_is_presence) ).
thf(59,axiom,
conflict != unknown,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verdicts_distinct_cf_un) ).
thf(60,axiom,
conflict != compatible,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verdicts_distinct_cf_cp) ).
thf(63,axiom,
is_verdict @ conflict,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conflict_is_verdict) ).
thf(80,conjecture,
( ( subs_verdict @ v0 @ v800 @ present @ v0 @ v600 @ present )
= conflict ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',odrl653) ).
thf(81,negated_conjecture,
( ( ( subs_verdict @ v0 @ v800 @ present @ v0 @ v600 @ present )
= conflict )
= $false ),
inference(negate_conjecture,[status(cth)],[80]) ).
thf(82,plain,
( ( ( subs_verdict @ v0 @ v800 @ present @ v0 @ v600 @ present )
= conflict )
= $false ),
inference(unfold_def,[status(thm)],[81]) ).
thf(83,plain,
( ( ~ ( axis_subsumes @ v0 @ v800 @ v0 @ v600 ) )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(84,plain,
( ( less @ v600 @ v800 )
= $true ),
inference(unfold_def,[status(thm)],[3]) ).
thf(85,plain,
( ( less @ v0 @ v800 )
= $true ),
inference(unfold_def,[status(thm)],[24]) ).
thf(86,plain,
( ( less @ v0 @ v600 )
= $true ),
inference(unfold_def,[status(thm)],[25]) ).
thf(87,plain,
( ( val @ v800 )
= $true ),
inference(unfold_def,[status(thm)],[31]) ).
thf(88,plain,
( ( val @ v600 )
= $true ),
inference(unfold_def,[status(thm)],[32]) ).
thf(89,plain,
( ( val @ v0 )
= $true ),
inference(unfold_def,[status(thm)],[38]) ).
thf(90,plain,
( ( ! [L1: $i,H1: $i,L2: $i,H2: $i] :
( ~ ( axis_subsumes @ L1 @ H1 @ L2 @ H2 )
=> ( ( subs_verdict @ L1 @ H1 @ present @ L2 @ H2 @ present )
= conflict ) ) )
= $true ),
inference(unfold_def,[status(thm)],[44]) ).
thf(91,plain,
( ( present != absent )
= $true ),
inference(unfold_def,[status(thm)],[50]) ).
thf(92,plain,
( ( is_presence @ present )
= $true ),
inference(unfold_def,[status(thm)],[52]) ).
thf(93,plain,
( ( conflict != unknown )
= $true ),
inference(unfold_def,[status(thm)],[59]) ).
thf(94,plain,
( ( conflict != compatible )
= $true ),
inference(unfold_def,[status(thm)],[60]) ).
thf(95,plain,
( ( is_verdict @ conflict )
= $true ),
inference(unfold_def,[status(thm)],[63]) ).
thf(96,plain,
( ( ( subs_verdict @ v0 @ v800 @ present @ v0 @ v600 @ present )
!= conflict )
= $true ),
inference(polarity_switch,[status(thm)],[82]) ).
thf(97,plain,
( ( is_verdict @ conflict )
= $true ),
inference(copy,[status(thm)],[95]) ).
thf(98,plain,
( ( conflict != compatible )
= $true ),
inference(copy,[status(thm)],[94]) ).
thf(99,plain,
( ( conflict != unknown )
= $true ),
inference(copy,[status(thm)],[93]) ).
thf(100,plain,
( ( is_presence @ present )
= $true ),
inference(copy,[status(thm)],[92]) ).
thf(101,plain,
( ( present != absent )
= $true ),
inference(copy,[status(thm)],[91]) ).
thf(102,plain,
( ( ! [L1: $i,H1: $i,L2: $i,H2: $i] :
( ~ ( axis_subsumes @ L1 @ H1 @ L2 @ H2 )
=> ( ( subs_verdict @ L1 @ H1 @ present @ L2 @ H2 @ present )
= conflict ) ) )
= $true ),
inference(copy,[status(thm)],[90]) ).
thf(103,plain,
( ( val @ v0 )
= $true ),
inference(copy,[status(thm)],[89]) ).
thf(104,plain,
( ( val @ v600 )
= $true ),
inference(copy,[status(thm)],[88]) ).
thf(105,plain,
( ( val @ v800 )
= $true ),
inference(copy,[status(thm)],[87]) ).
thf(106,plain,
( ( less @ v0 @ v600 )
= $true ),
inference(copy,[status(thm)],[86]) ).
thf(107,plain,
( ( less @ v0 @ v800 )
= $true ),
inference(copy,[status(thm)],[85]) ).
thf(108,plain,
( ( less @ v600 @ v800 )
= $true ),
inference(copy,[status(thm)],[84]) ).
thf(109,plain,
( ( ~ ( axis_subsumes @ v0 @ v800 @ v0 @ v600 ) )
= $true ),
inference(copy,[status(thm)],[83]) ).
thf(110,plain,
( ( ( subs_verdict @ v0 @ v800 @ present @ v0 @ v600 @ present )
!= conflict )
= $true ),
inference(copy,[status(thm)],[96]) ).
thf(111,plain,
( ( conflict != unknown )
= $true ),
inference(unfold_def,[status(thm)],[99]) ).
thf(112,plain,
( ( conflict != compatible )
= $true ),
inference(unfold_def,[status(thm)],[98]) ).
thf(113,plain,
( ( present != absent )
= $true ),
inference(unfold_def,[status(thm)],[101]) ).
thf(114,plain,
( ( ! [SX0: $i,SX1: $i,SX2: $i,SX3: $i] :
( ~ ~ ( axis_subsumes @ SX0 @ SX1 @ SX2 @ SX3 )
| ( ( subs_verdict @ SX0 @ SX1 @ present @ SX2 @ SX3 @ present )
= conflict ) ) )
= $true ),
inference(unfold_def,[status(thm)],[102]) ).
thf(115,plain,
( ( axis_subsumes @ v0 @ v800 @ v0 @ v600 )
= $false ),
inference(extcnf_not_pos,[status(thm)],[109]) ).
thf(116,plain,
( ( ( subs_verdict @ v0 @ v800 @ present @ v0 @ v600 @ present )
= conflict )
= $false ),
inference(extcnf_not_pos,[status(thm)],[110]) ).
thf(117,plain,
( ( conflict = unknown )
= $false ),
inference(extcnf_not_pos,[status(thm)],[111]) ).
thf(118,plain,
( ( conflict = compatible )
= $false ),
inference(extcnf_not_pos,[status(thm)],[112]) ).
thf(119,plain,
( ( present = absent )
= $false ),
inference(extcnf_not_pos,[status(thm)],[113]) ).
thf(120,plain,
! [SV1: $i] :
( ( ! [SY4: $i,SY5: $i,SY6: $i] :
( ~ ~ ( axis_subsumes @ SV1 @ SY4 @ SY5 @ SY6 )
| ( ( subs_verdict @ SV1 @ SY4 @ present @ SY5 @ SY6 @ present )
= conflict ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[114]) ).
thf(121,plain,
! [SV2: $i,SV1: $i] :
( ( ! [SY7: $i,SY8: $i] :
( ~ ~ ( axis_subsumes @ SV1 @ SV2 @ SY7 @ SY8 )
| ( ( subs_verdict @ SV1 @ SV2 @ present @ SY7 @ SY8 @ present )
= conflict ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[120]) ).
thf(122,plain,
! [SV3: $i,SV2: $i,SV1: $i] :
( ( ! [SY9: $i] :
( ~ ~ ( axis_subsumes @ SV1 @ SV2 @ SV3 @ SY9 )
| ( ( subs_verdict @ SV1 @ SV2 @ present @ SV3 @ SY9 @ present )
= conflict ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[121]) ).
thf(123,plain,
! [SV4: $i,SV3: $i,SV2: $i,SV1: $i] :
( ( ~ ~ ( axis_subsumes @ SV1 @ SV2 @ SV3 @ SV4 )
| ( ( subs_verdict @ SV1 @ SV2 @ present @ SV3 @ SV4 @ present )
= conflict ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[122]) ).
thf(124,plain,
! [SV4: $i,SV3: $i,SV2: $i,SV1: $i] :
( ( ( ~ ~ ( axis_subsumes @ SV1 @ SV2 @ SV3 @ SV4 ) )
= $true )
| ( ( ( subs_verdict @ SV1 @ SV2 @ present @ SV3 @ SV4 @ present )
= conflict )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[123]) ).
thf(125,plain,
! [SV4: $i,SV3: $i,SV2: $i,SV1: $i] :
( ( ( ~ ( axis_subsumes @ SV1 @ SV2 @ SV3 @ SV4 ) )
= $false )
| ( ( ( subs_verdict @ SV1 @ SV2 @ present @ SV3 @ SV4 @ present )
= conflict )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[124]) ).
thf(126,plain,
! [SV4: $i,SV3: $i,SV2: $i,SV1: $i] :
( ( ( axis_subsumes @ SV1 @ SV2 @ SV3 @ SV4 )
= $true )
| ( ( ( subs_verdict @ SV1 @ SV2 @ present @ SV3 @ SV4 @ present )
= conflict )
= $true ) ),
inference(extcnf_not_neg,[status(thm)],[125]) ).
thf(127,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[97,126,119,118,117,116,115,108,107,106,105,104,103,100]) ).
thf(128,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[127]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT094+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.04 % Command : leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox2/solver/bin/eprover /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.16 % Computer : n020.cluster.edu
% 0.09/0.16 % Model : x86_64 x86_64
% 0.09/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.16 % Memory : 8046.5625MB
% 0.09/0.16 % OS : Linux 6.8.0-71-generic
% 0.09/0.16 % CPULimit : 300
% 0.09/0.16 % WCLimit : 300
% 0.09/0.16 % DateTime : Tue Oct 6 12:45:06 UTC 2026
% 0.09/0.16 % CPUTime :
% 0.09/0.16 Running leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox2/solver/bin/eprover /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.26
% 0.09/0.26 No.of.Axioms: 13
% 0.09/0.26
% 0.09/0.26 Length.of.Defs: 0
% 0.09/0.26
% 0.09/0.26 Contains.Choice.Funs: false
% 0.09/0.26 .
% 0.09/0.26
% 0.09/0.26 ********************************
% 0.09/0.26 * All subproblems solved! *
% 0.09/0.26 ********************************
% 0.09/0.26 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:1,axioms:13,ps:0,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:false,expand_extuni:false,foatp:e,atp_timeout:299,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:127,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.09/0.26
% 0.09/0.26 %**** Beginning of derivation protocol ****
% 0.09/0.26 % SZS output start CNFRefutation
% See solution above
% 0.09/0.27
% 0.09/0.27 %**** End of derivation protocol ****
% 0.09/0.27 %**** no. of clauses in derivation: 62 ****
% 0.09/0.27 %**** clause counter: 127 ****
% 0.09/0.27
% 0.09/0.27 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:1,axioms:13,ps:0,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:false,expand_extuni:false,foatp:e,atp_timeout:299,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:127,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------