%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : MGT087+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 : 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 : Sun Sep 27 08:03:06 AM UTC 2026
% Result : Theorem 0.13s 0.37s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 13 ( 8 unt; 0 def)
% Number of atoms : 21 ( 2 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 16 ( 8 ~; 5 |; 1 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 15 ( 1 sgn 5 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(leq_def,axiom,
! [X,Y] :
( leq(X,Y)
<=> ( X = Y
| less(X,Y) ) ),
file('theBenchmark.p',leq_def) ).
fof(in_lopen,axiom,
! [X,A,B] :
( in_lopen(X,A,B)
<=> ( leq(X,B)
& less(A,X) ) ),
file('theBenchmark.p',in_lopen) ).
fof(odrl500,conjecture,
? [X] : in_lopen(X,v0,v600),
file('theBenchmark.p',odrl500) ).
fof(odrl500_neg,negated_conjecture,
~ ? [X] : in_lopen(X,v0,v600),
inference(assume_negation,[status(cth)],[odrl500]) ).
cnf(c_46,plain,
( B != A
| leq(A,B) ),
inference(clausify,[status(thm)],[leq_def]) ).
cnf(c_56,plain,
( ~ leq(A,C)
| ~ less(B,A)
| in_lopen(A,B,C) ),
inference(clausify,[status(thm)],[in_lopen]) ).
fof(ord_v0_v600,axiom,
less(v0,v600),
file('theBenchmark.p',ord_v0_v600) ).
cnf(c_79,plain,
less(v0,v600),
inference(clausify,[status(thm)],[ord_v0_v600]) ).
cnf(c_84,negated_conjecture,
~ in_lopen(A,v0,v600),
inference(clausify,[status(thm)],[odrl500_neg]) ).
cnf(c_106,plain,
leq(A,A),
inference(xxres,[status(thm)],[c_46]) ).
cnf(c_173,negated_conjecture,
( ~ leq(A,v600)
| ~ less(v0,A) ),
inference(resolve,[status(thm)],[c_56,c_84]) ).
cnf(c_174,negated_conjecture,
~ leq(v600,v600),
inference(resolve,[status(thm)],[c_173,c_79]) ).
cnf(c_172,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_106,c_174]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT087+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.08/0.34 % Computer : n020.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 : Sat Sep 26 00:13:33 UTC 2026
% 0.08/0.34 % CPUTime :
% 0.08/0.35 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/0.35 % Process 4163929 was started by sandbox2 on n020,
% 0.08/0.35 % Sat Sep 26 00:13:33 2026
% 0.08/0.35 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.13/0.36
% 0.13/0.36 % From the command line: assign(max_seconds, 300).
% 0.13/0.37
% 0.13/0.37 % SZS status Theorem for theBenchmark
% 0.13/0.37
% 0.13/0.37 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.13/0.37 % Length of proof is 9.
% 0.13/0.37 % Level of proof is 3.
% 0.13/0.37 % Maximum clause weight is 15.000.
% 0.13/0.37 % Given clauses 38.
% 0.13/0.37
% 0.13/0.37 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------