%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : MGT089+1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n013.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 6.63s 7.04s
% Output : Proof 6.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 11
% Syntax : Number of formulae : 55 ( 39 unt; 0 def)
% Number of atoms : 98 ( 35 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 97 ( 54 ~; 27 |; 12 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-4 aty)
% Number of variables : 65 ( 0 sgn 38 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
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(c5,plain,
( X0 != X1
| leq(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f3_sk]) ).
cnf(hi4,axiom,
ifeq(X0,X1,leq(X0,X1),true) = true,
inference(equality_encoding,[status(esa)],[c5]) ).
cnf(hi81,axiom,
or(false,X0) = X0,
introduced(definition) ).
cnf(h64,plain,
leq(or(false,V0),V0) = true,
inference(hyper_resolution,[status(thm)],[hi4,hi81]) ).
cnf(h65,plain,
leq(V0,or(false,V0)) = true,
inference(hyper_resolution,[status(thm)],[hi4,hi81]) ).
fof(f8,axiom,
! [X,Y,Z] :
( ( leq(Y,Z)
& leq(X,Y) )
=> leq(X,Z) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',leq_trans) ).
fof(f8_nnf,plain,
! [X,Y,Z] :
( leq(X,Z)
| ~ leq(Y,Z)
| ~ leq(X,Y) ),
inference(nnf_transformation,[status(thm)],[f8]) ).
fof(f8_sk,plain,
! [X,Y,Z] :
( leq(X,Z)
| ~ leq(Y,Z)
| ~ leq(X,Y) ),
inference(skolemisation,[status(esa)],[f8_nnf]) ).
cnf(c10,plain,
( leq(X0,X2)
| ~ leq(X1,X2)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f8_sk]) ).
cnf(hi9,axiom,
ifeq(leq(X0,X1),true,ifeq(leq(X1,X2),true,leq(X0,X2),true),true) = true,
inference(equality_encoding,[status(esa)],[c10]) ).
cnf(h1405,plain,
leq(V0,V0) = true,
inference(hyper_resolution,[status(thm)],[hi9,h65,h64]) ).
fof(f34,axiom,
! [U,L] :
( prec(U,L,o,o)
<=> leq(U,L) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prec_oo) ).
fof(f34_nnf,plain,
! [U,L] :
( ( ~ leq(U,L)
| prec(U,L,o,o) )
& ( leq(U,L)
| ~ prec(U,L,o,o) ) ),
inference(nnf_transformation,[status(thm)],[f34]) ).
fof(f34_sk,plain,
! [U,L] :
( ( ~ leq(U,L)
| prec(U,L,o,o) )
& ( leq(U,L)
| ~ prec(U,L,o,o) ) ),
inference(skolemisation,[status(esa)],[f34_nnf]) ).
cnf(c56,plain,
( ~ leq(X0,X1)
| prec(X0,X1,o,o) ),
inference(cnf_transformation,[status(esa)],[f34_sk]) ).
cnf(hi50,axiom,
ifeq(leq(X0,X1),true,prec(X0,X1,o,o),true) = true,
inference(equality_encoding,[status(esa)],[c56]) ).
cnf(h1409,plain,
prec(V0,V0,o,o) = true,
inference(hyper_resolution,[status(thm)],[hi50,h1405]) ).
fof(f47,conjecture,
prec(v5,v5,o,o),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',odrl604) ).
fof(f47_neg,negated_conjecture,
~ prec(v5,v5,o,o),
inference(negated_conjecture,[status(cth)],[f47]) ).
fof(f47_nnf,plain,
~ prec(v5,v5,o,o),
inference(nnf_transformation,[status(thm)],[f47_neg]) ).
fof(f47_sk,plain,
~ prec(v5,v5,o,o),
inference(skolemisation,[status(esa)],[f47_nnf]) ).
cnf(c71,plain,
~ prec(v5,v5,o,o),
inference(cnf_transformation,[status(esa)],[f47_sk]) ).
cnf(hi71,negated_conjecture,
ifeq(prec(v5,v5,o,o),true,false,true) = true,
inference(equality_encoding,[status(esa)],[c71]) ).
cnf(t0,plain,
true = false,
inference(hyper_resolution,[status(thm)],[hi71,h1409]) ).
cnf(t261,plain,
false = true,
inference(orient,[status(thm)],[t0]) ).
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]) ).
fof(f13,axiom,
! [I1lo,I1hi,I2lo,I2hi] :
( axis_conflict(I1lo,I1hi,I2lo,I2hi)
<=> ~ ? [X] :
( in_closed(X,I2lo,I2hi)
& in_closed(X,I1lo,I1hi) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axis_conflict_def) ).
fof(f13_nnf,plain,
! [I1lo,I1hi,I2lo,I2hi] :
( ( ? [X] :
( in_closed(X,I2lo,I2hi)
& in_closed(X,I1lo,I1hi) )
| axis_conflict(I1lo,I1hi,I2lo,I2hi) )
& ( ! [X] :
( ~ in_closed(X,I2lo,I2hi)
| ~ in_closed(X,I1lo,I1hi) )
| ~ axis_conflict(I1lo,I1hi,I2lo,I2hi) ) ),
inference(nnf_transformation,[status(thm)],[f13]) ).
fof(f13_sk,plain,
! [I1lo,I1hi,I2lo,I2hi,X] :
( ( ( in_closed(sk0(I1lo,I1hi,I2lo,I2hi),I2lo,I2hi)
& in_closed(sk0(I1lo,I1hi,I2lo,I2hi),I1lo,I1hi) )
| axis_conflict(I1lo,I1hi,I2lo,I2hi) )
& ( ~ in_closed(X,I2lo,I2hi)
| ~ in_closed(X,I1lo,I1hi)
| ~ axis_conflict(I1lo,I1hi,I2lo,I2hi) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f13_nnf]) ).
cnf(c23,plain,
( ~ in_closed(X4,X2,X3)
| ~ in_closed(X4,X0,X1)
| ~ axis_conflict(X0,X1,X2,X3) ),
inference(cnf_transformation,[status(esa)],[f13_sk]) ).
fof(f19,axiom,
conflict != compatible,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verdicts_distinct_cf_cp) ).
fof(f19_nnf,plain,
conflict != compatible,
inference(nnf_transformation,[status(thm)],[f19]) ).
fof(f19_sk,plain,
conflict != compatible,
inference(skolemisation,[status(esa)],[f19_nnf]) ).
cnf(c35,plain,
conflict != compatible,
inference(cnf_transformation,[status(esa)],[f19_sk]) ).
fof(f20,axiom,
conflict != unknown,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verdicts_distinct_cf_un) ).
fof(f20_nnf,plain,
conflict != unknown,
inference(nnf_transformation,[status(thm)],[f20]) ).
fof(f20_sk,plain,
conflict != unknown,
inference(skolemisation,[status(esa)],[f20_nnf]) ).
cnf(c36,plain,
conflict != unknown,
inference(cnf_transformation,[status(esa)],[f20_sk]) ).
fof(f21,axiom,
compatible != unknown,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verdicts_distinct_cp_un) ).
fof(f21_nnf,plain,
compatible != unknown,
inference(nnf_transformation,[status(thm)],[f21]) ).
fof(f21_sk,plain,
compatible != unknown,
inference(skolemisation,[status(esa)],[f21_nnf]) ).
cnf(c37,plain,
compatible != unknown,
inference(cnf_transformation,[status(esa)],[f21_sk]) ).
fof(f29,axiom,
c != o,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ep_types_distinct) ).
fof(f29_nnf,plain,
c != o,
inference(nnf_transformation,[status(thm)],[f29]) ).
fof(f29_sk,plain,
c != o,
inference(skolemisation,[status(esa)],[f29_nnf]) ).
cnf(c47,plain,
c != o,
inference(cnf_transformation,[status(esa)],[f29_sk]) ).
cnf(goal_0,negated_conjecture,
true != false,
inference(equality_encoding,[status(esa)],[c0,c23,c35,c36,c37,c47,c71]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t261]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT089+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.11/6.02 % Computer : n013.cluster.edu
% 0.11/6.02 % Model : x86_64 x86_64
% 0.11/6.02 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/6.02 % Memory : 8046.5625MB
% 0.11/6.02 % OS : Linux 6.8.0-71-generic
% 0.11/6.02 % CPULimit : 300
% 0.11/6.02 % WCLimit : 300
% 0.11/6.02 % DateTime : Thu Sep 24 01:22:00 UTC 2026
% 0.11/6.02 % CPUTime :
% 0.11/6.02 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 6.63/7.04 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.63/7.04 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------