%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : MGT090+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n018.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 : Fri Sep 25 02:11:57 PM UTC 2026
% Result : Theorem 33.13s 4.79s
% Output : Proof 33.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 30 ( 20 unt; 0 def)
% Number of atoms : 66 ( 14 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 63 ( 27 ~; 22 |; 12 &)
% ( 2 <=>; 0 =>; 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 : 25 ( 0 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f30,axiom,
! [V,InfD,SupD] :
( wf(lt,V,InfD,SupD)
<=> ( V != InfD
& leq(V,SupD)
& leq(InfD,V) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',wf_lt) ).
fof(f30_nnf,plain,
! [V,InfD,SupD] :
( ( V = InfD
| ~ leq(V,SupD)
| ~ leq(InfD,V)
| wf(lt,V,InfD,SupD) )
& ( ( V != InfD
& leq(V,SupD)
& leq(InfD,V) )
| ~ wf(lt,V,InfD,SupD) ) ),
inference(nnf_transformation,[status(thm)],[f30]) ).
fof(f30_sk,plain,
! [V,InfD,SupD] :
( ( V = InfD
| ~ leq(V,SupD)
| ~ leq(InfD,V)
| wf(lt,V,InfD,SupD) )
& ( ( V != InfD
& leq(V,SupD)
& leq(InfD,V) )
| ~ wf(lt,V,InfD,SupD) ) ),
inference(skolemisation,[status(esa)],[f30_nnf]) ).
cnf(c57,plain,
( X0 = X1
| ~ leq(X0,X2)
| ~ leq(X1,X0)
| wf(lt,X0,X1,X2) ),
inference(cnf_transformation,[status(esa)],[f30_sk]) ).
fof(f56,axiom,
less(v0,v600),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v0_v600) ).
fof(f56_nnf,plain,
less(v0,v600),
inference(nnf_transformation,[status(thm)],[f56]) ).
cnf(c86,plain,
less(v0,v600),
inference(cnf_transformation,[status(esa)],[f56_nnf]) ).
fof(f3,axiom,
! [X,Y] :
( leq(X,Y)
<=> ( X = Y
| less(X,Y) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',leq_def) ).
fof(f3_nnf,plain,
! [X,Y] :
( ( ( X != Y
& ~ less(X,Y) )
| leq(X,Y) )
& ( X = Y
| less(X,Y)
| ~ leq(X,Y) ) ),
inference(nnf_transformation,[status(thm)],[f3]) ).
fof(f3_sk,plain,
! [X,Y] :
( ( ( X != Y
& ~ less(X,Y) )
| leq(X,Y) )
& ( X = Y
| less(X,Y)
| ~ leq(X,Y) ) ),
inference(skolemisation,[status(esa)],[f3_nnf]) ).
cnf(c4,plain,
( ~ less(X0,X1)
| leq(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f3_sk]) ).
cnf(p98,plain,
leq(v0,v600),
inference(resolution,[status(thm)],[c86,c4]) ).
cnf(p431,plain,
( v600 = v0
| ~ leq(v600,X0)
| wf(lt,v600,v0,X0) ),
inference(resolution,[status(thm)],[c57,p98]) ).
fof(f57,axiom,
less(v600,v1200),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v600_v1200) ).
fof(f57_nnf,plain,
less(v600,v1200),
inference(nnf_transformation,[status(thm)],[f57]) ).
cnf(c87,plain,
less(v600,v1200),
inference(cnf_transformation,[status(esa)],[f57_nnf]) ).
cnf(p100,plain,
leq(v600,v1200),
inference(resolution,[status(thm)],[c87,c4]) ).
cnf(p4129,plain,
( v600 = v0
| wf(lt,v600,v0,v1200) ),
inference(resolution,[status(thm)],[p431,p100]) ).
fof(f59,conjecture,
wf(lt,v600,v0,v1200),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',odrl613) ).
fof(f59_neg,negated_conjecture,
~ wf(lt,v600,v0,v1200),
inference(negated_conjecture,[status(cth)],[f59]) ).
fof(f59_nnf,plain,
~ wf(lt,v600,v0,v1200),
inference(nnf_transformation,[status(thm)],[f59_neg]) ).
fof(f59_sk,plain,
~ wf(lt,v600,v0,v1200),
inference(skolemisation,[status(esa)],[f59_nnf]) ).
cnf(c91,plain,
~ wf(lt,v600,v0,v1200),
inference(cnf_transformation,[status(esa)],[f59_sk]) ).
cnf(p6619,plain,
v600 = v0,
inference(resolution,[status(thm)],[p4129,c91]) ).
cnf(p6620,plain,
less(v0,v0),
inference(demodulation,[status(thm)],[p6619,c86]) ).
fof(f0,axiom,
! [X] : ~ less(X,X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',irreflexive) ).
fof(f0_nnf,plain,
! [X] : ~ less(X,X),
inference(nnf_transformation,[status(thm)],[f0]) ).
fof(f0_sk,plain,
! [X] : ~ less(X,X),
inference(skolemisation,[status(esa)],[f0_nnf]) ).
cnf(c0,plain,
~ less(X0,X0),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p7134,plain,
$false,
inference(resolution,[status(thm)],[p6620,c0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT090+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.10/0.36 % Computer : n018.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Thu Sep 24 01:24:33 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 33.13/4.79 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 33.13/4.79 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------