%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : MGT092+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.02s 0.41s
% Output : CNFRefutation 0.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of formulae : 35 ( 20 unt; 0 def)
% Number of atoms : 67 ( 10 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 61 ( 29 ~; 20 |; 9 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-4 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 29 ( 0 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(irreflexive,axiom,
! [X] : ~ less(X,X),
file('theBenchmark.p',irreflexive) ).
fof(transitive,axiom,
! [X,Y,Z] :
( ( less(Y,Z)
& less(X,Y) )
=> less(X,Z) ),
file('theBenchmark.p',transitive) ).
fof(trichotomy,axiom,
! [X,Y] :
( less(Y,X)
| X = Y
| less(X,Y) ),
file('theBenchmark.p',trichotomy) ).
fof(less_implies_leq,axiom,
! [X,Y] :
( less(X,Y)
=> leq(X,Y) ),
file('theBenchmark.p',less_implies_leq) ).
fof(sharpness_conflict,axiom,
! [U,V,InfD,SupD] :
( ( leq(V,SupD)
& less(U,V)
& leq(U,SupD)
& leq(InfD,U) )
=> completion_conflict(U,V,InfD,SupD) ),
file('theBenchmark.p',sharpness_conflict) ).
fof(distinct,axiom,
( v800 != v1200
& v400 != v1200
& v400 != v800
& v0 != v1200
& v0 != v800
& v0 != v400 ),
file('theBenchmark.p',distinct) ).
fof(odrl633,conjecture,
completion_conflict(v400,v800,v0,v1200),
file('theBenchmark.p',odrl633) ).
fof(odrl633_neg,negated_conjecture,
~ completion_conflict(v400,v800,v0,v1200),
inference(assume_negation,[status(cth)],[odrl633]) ).
cnf(c_47,negated_conjecture,
~ completion_conflict(v400,v800,v0,v1200),
inference(clausify,[status(thm)],[odrl633_neg]) ).
cnf(c_49,plain,
v1200 != v400,
inference(clausify,[status(thm)],[distinct]) ).
fof(ord_v800_v1200,axiom,
less(v800,v1200),
file('theBenchmark.p',ord_v800_v1200) ).
cnf(c_56,plain,
less(v800,v1200),
inference(clausify,[status(thm)],[ord_v800_v1200]) ).
fof(ord_v400_v800,axiom,
less(v400,v800),
file('theBenchmark.p',ord_v400_v800) ).
cnf(c_57,plain,
less(v400,v800),
inference(clausify,[status(thm)],[ord_v400_v800]) ).
fof(ord_v0_v400,axiom,
less(v0,v400),
file('theBenchmark.p',ord_v0_v400) ).
cnf(c_58,plain,
less(v0,v400),
inference(clausify,[status(thm)],[ord_v0_v400]) ).
cnf(c_85,plain,
( completion_conflict(B,D,A,C)
| ~ leq(D,C)
| ~ less(B,D)
| ~ leq(B,C)
| ~ leq(A,B) ),
inference(clausify,[status(thm)],[sharpness_conflict]) ).
cnf(c_89,plain,
( leq(A,B)
| ~ less(A,B) ),
inference(clausify,[status(thm)],[less_implies_leq]) ).
cnf(c_93,plain,
( less(B,A)
| B = A
| less(A,B) ),
inference(clausify,[status(thm)],[trichotomy]) ).
cnf(c_94,plain,
( less(A,C)
| ~ less(B,C)
| ~ less(A,B) ),
inference(clausify,[status(thm)],[transitive]) ).
cnf(c_95,plain,
~ less(A,A),
inference(clausify,[status(thm)],[irreflexive]) ).
cnf(c_145,plain,
leq(v0,v400),
inference(resolve,[status(thm)],[c_89,c_58]) ).
cnf(c_147,plain,
leq(v800,v1200),
inference(resolve,[status(thm)],[c_89,c_56]) ).
cnf(c_254,plain,
( less(A,v800)
| ~ less(A,v400) ),
inference(resolve,[status(thm)],[c_94,c_57]) ).
cnf(c_179,plain,
~ less(v800,v400),
inference(resolve,[status(thm)],[c_254,c_95]) ).
cnf(c_255,plain,
( less(v800,A)
| ~ less(v1200,A) ),
inference(resolve,[status(thm)],[c_94,c_56]) ).
cnf(c_198,plain,
~ less(v1200,v400),
inference(resolve,[status(thm)],[c_255,c_179]) ).
cnf(c_256,plain,
( completion_conflict(v400,B,v0,A)
| ~ leq(B,A)
| ~ less(v400,B)
| ~ leq(v400,A) ),
inference(resolve,[status(thm)],[c_85,c_145]) ).
cnf(c_257,plain,
( completion_conflict(v400,v800,v0,A)
| ~ leq(v800,A)
| ~ leq(v400,A) ),
inference(resolve,[status(thm)],[c_256,c_57]) ).
cnf(c_258,plain,
( completion_conflict(v400,v800,v0,v1200)
| ~ leq(v400,v1200) ),
inference(resolve,[status(thm)],[c_257,c_147]) ).
cnf(c_223,negated_conjecture,
~ leq(v400,v1200),
inference(resolve,[status(thm)],[c_258,c_47]) ).
cnf(c_259,plain,
( v1200 = v400
| less(v400,v1200) ),
inference(resolve,[status(thm)],[c_198,c_93]) ).
cnf(c_242,plain,
less(v400,v1200),
inference(resolve,[status(thm)],[c_49,c_259]) ).
cnf(c_260,plain,
leq(v400,v1200),
inference(resolve,[status(thm)],[c_242,c_89]) ).
cnf(c_253,plain,
$false,
inference(resolve,[status(thm)],[c_223,c_260]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT092+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.02/0.37 % Computer : n020.cluster.edu
% 0.02/0.37 % Model : x86_64 x86_64
% 0.02/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.02/0.37 % Memory : 8046.5625MB
% 0.02/0.37 % OS : Linux 6.8.0-71-generic
% 0.02/0.37 % CPULimit : 300
% 0.02/0.37 % WCLimit : 300
% 0.02/0.37 % DateTime : Sat Sep 26 00:13:19 UTC 2026
% 0.02/0.37 % CPUTime :
% 0.02/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.02/0.37 % Process 4163509 was started by sandbox2 on n020,
% 0.02/0.37 % Sat Sep 26 00:13:19 2026
% 0.02/0.37 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.02/0.38
% 0.02/0.38 % From the command line: assign(max_seconds, 300).
% 0.02/0.41
% 0.02/0.41 % SZS status Theorem for theBenchmark
% 0.02/0.41
% 0.02/0.41 % Proof 1 at 0.01 (+ 0.01) seconds.
% 0.02/0.41 % Length of proof is 24.
% 0.02/0.41 % Level of proof is 5.
% 0.02/0.41 % Maximum clause weight is 22.000.
% 0.02/0.41 % Given clauses 74.
% 0.02/0.41
% 0.02/0.41 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------