%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : MGT090+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n008.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.39s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 20 ( 13 unt; 0 def)
% Number of atoms : 33 ( 9 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 28 ( 15 ~; 7 |; 4 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 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 : 10 ( 0 sgn 5 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(less_implies_leq,axiom,
! [X,Y] :
( less(X,Y)
=> leq(X,Y) ),
file('theBenchmark.p',less_implies_leq) ).
fof(wf_lt,axiom,
! [V,InfD,SupD] :
( wf(lt,V,InfD,SupD)
<=> ( V != InfD
& leq(V,SupD)
& leq(InfD,V) ) ),
file('theBenchmark.p',wf_lt) ).
fof(distinct,axiom,
( v600 != v1200
& v0 != v1200
& v0 != v600 ),
file('theBenchmark.p',distinct) ).
fof(odrl613,conjecture,
wf(lt,v600,v0,v1200),
file('theBenchmark.p',odrl613) ).
fof(odrl613_neg,negated_conjecture,
~ wf(lt,v600,v0,v1200),
inference(assume_negation,[status(cth)],[odrl613]) ).
cnf(c_61,negated_conjecture,
~ wf(lt,v600,v0,v1200),
inference(clausify,[status(thm)],[odrl613_neg]) ).
cnf(c_64,plain,
v600 != v0,
inference(clausify,[status(thm)],[distinct]) ).
cnf(c_65,plain,
v0 != v600,
inference(copy,[status(thm)],[c_64]) ).
fof(ord_v600_v1200,axiom,
less(v600,v1200),
file('theBenchmark.p',ord_v600_v1200) ).
cnf(c_66,plain,
less(v600,v1200),
inference(clausify,[status(thm)],[ord_v600_v1200]) ).
fof(ord_v0_v600,axiom,
less(v0,v600),
file('theBenchmark.p',ord_v0_v600) ).
cnf(c_67,plain,
less(v0,v600),
inference(clausify,[status(thm)],[ord_v0_v600]) ).
cnf(c_88,plain,
( B = A
| ~ leq(A,C)
| ~ leq(B,A)
| wf(lt,A,B,C) ),
inference(clausify,[status(thm)],[wf_lt]) ).
cnf(c_128,plain,
( leq(A,B)
| ~ less(A,B) ),
inference(clausify,[status(thm)],[less_implies_leq]) ).
cnf(c_177,plain,
leq(v0,v600),
inference(resolve,[status(thm)],[c_128,c_67]) ).
cnf(c_178,plain,
leq(v600,v1200),
inference(resolve,[status(thm)],[c_128,c_66]) ).
cnf(c_266,negated_conjecture,
( v0 = v600
| ~ leq(v600,v1200)
| ~ leq(v0,v600) ),
inference(resolve,[status(thm)],[c_88,c_61]) ).
cnf(c_267,negated_conjecture,
( v0 = v600
| ~ leq(v600,v1200) ),
inference(resolve,[status(thm)],[c_266,c_177]) ).
cnf(c_268,negated_conjecture,
~ leq(v600,v1200),
inference(resolve,[status(thm)],[c_267,c_65]) ).
cnf(c_265,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_178,c_268]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT090+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.35 % Computer : n008.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Sat Sep 26 00:13:24 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.10/0.35 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.35 % Process 2245397 was started by sandbox on n008,
% 0.10/0.35 % Sat Sep 26 00:13:24 2026
% 0.10/0.35 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.10/0.37
% 0.10/0.37 % From the command line: assign(max_seconds, 300).
% 0.13/0.39
% 0.13/0.39 % SZS status Theorem for theBenchmark
% 0.13/0.39
% 0.13/0.39 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.13/0.39 % Length of proof is 14.
% 0.13/0.39 % Level of proof is 3.
% 0.13/0.39 % Maximum clause weight is 19.000.
% 0.13/0.39 % Given clauses 79.
% 0.13/0.39
% 0.13/0.39 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------