%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : MGT089+1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n005.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.38s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 10 ( 6 unt; 0 def)
% Number of atoms : 15 ( 2 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 10 ( 5 ~; 3 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-4 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 9 ( 0 sgn 4 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(leq_def,axiom,
! [X,Y] :
( leq(X,Y)
<=> ( X = Y
| less(X,Y) ) ),
file('theBenchmark.p',leq_def) ).
fof(prec_oo,axiom,
! [U,L] :
( prec(U,L,o,o)
<=> leq(U,L) ),
file('theBenchmark.p',prec_oo) ).
fof(odrl604,conjecture,
prec(v5,v5,o,o),
file('theBenchmark.p',odrl604) ).
fof(odrl604_neg,negated_conjecture,
~ prec(v5,v5,o,o),
inference(assume_negation,[status(cth)],[odrl604]) ).
cnf(c_56,negated_conjecture,
~ prec(v5,v5,o,o),
inference(clausify,[status(thm)],[odrl604_neg]) ).
cnf(c_57,plain,
( ~ leq(A,B)
| prec(A,B,o,o) ),
inference(clausify,[status(thm)],[prec_oo]) ).
cnf(c_96,plain,
( B != A
| leq(A,B) ),
inference(clausify,[status(thm)],[leq_def]) ).
cnf(c_112,negated_conjecture,
~ leq(v5,v5),
inference(resolve,[status(thm)],[c_57,c_56]) ).
cnf(c_131,plain,
leq(A,A),
inference(xxres,[status(thm)],[c_96]) ).
cnf(c_132,plain,
$false,
inference(resolve,[status(thm)],[c_131,c_112]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT089+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.35 % Computer : n005.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Sat Sep 26 00:12:31 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/0.35 % Process 617978 was started by sandbox on n005,
% 0.08/0.35 % Sat Sep 26 00:12:31 2026
% 0.08/0.35 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.13/0.36
% 0.13/0.36 % From the command line: assign(max_seconds, 300).
% 0.13/0.38
% 0.13/0.38 % SZS status Theorem for theBenchmark
% 0.13/0.38
% 0.13/0.38 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.13/0.38 % Length of proof is 9.
% 0.13/0.38 % Level of proof is 3.
% 0.13/0.38 % Maximum clause weight is 8.000.
% 0.13/0.38 % Given clauses 34.
% 0.13/0.38
% 0.13/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------