%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : MGT094+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n016.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 : Sun Sep 27 08:03:06 AM UTC 2026
% Result : Theorem 0.09s 0.40s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of formulae : 9 ( 7 unt; 0 def)
% Number of atoms : 11 ( 6 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 7 ( 5 ~; 1 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-4 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-6 aty)
% Number of variables : 8 ( 0 sgn 4 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(subs_present_no,axiom,
! [L1,H1,L2,H2] :
( ~ axis_subsumes(L1,H1,L2,H2)
=> subs_verdict(L1,H1,present,L2,H2,present) = conflict ),
file('theBenchmark.p',subs_present_no) ).
fof(odrl653,conjecture,
subs_verdict(v0,v800,present,v0,v600,present) = conflict,
file('theBenchmark.p',odrl653) ).
fof(odrl653_neg,negated_conjecture,
subs_verdict(v0,v800,present,v0,v600,present) != conflict,
inference(assume_negation,[status(cth)],[odrl653]) ).
cnf(c_100,plain,
( subs_verdict(A,B,present,C,D,present) = conflict
| axis_subsumes(A,B,C,D) ),
inference(clausify,[status(thm)],[subs_present_no]) ).
fof(no_subs_hint,axiom,
~ axis_subsumes(v0,v800,v0,v600),
file('theBenchmark.p',no_subs_hint) ).
cnf(c_172,plain,
~ axis_subsumes(v0,v800,v0,v600),
inference(clausify,[status(thm)],[no_subs_hint]) ).
cnf(c_173,negated_conjecture,
subs_verdict(v0,v800,present,v0,v600,present) != conflict,
inference(clausify,[status(thm)],[odrl653_neg]) ).
cnf(c_331,plain,
subs_verdict(v0,v800,present,v0,v600,present) = conflict,
inference(resolve,[status(thm)],[c_172,c_100]) ).
cnf(c_330,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_173,c_331]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT094+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n016.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sat Sep 26 00:17:59 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.36 % Process 3654341 was started by sandbox2 on n016,
% 0.09/0.36 % Sat Sep 26 00:17:59 2026
% 0.09/0.36 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.09/0.37
% 0.09/0.37 % From the command line: assign(max_seconds, 300).
% 0.09/0.40
% 0.09/0.40 % SZS status Theorem for theBenchmark
% 0.09/0.40
% 0.09/0.40 % Proof 1 at 0.01 (+ 0.01) seconds.
% 0.09/0.40 % Length of proof is 6.
% 0.09/0.40 % Level of proof is 2.
% 0.09/0.40 % Maximum clause weight is 24.000.
% 0.09/0.40 % Given clauses 104.
% 0.09/0.40
% 0.09/0.40 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------