%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : MGT070+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 : 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:54 PM UTC 2026
% Result : Theorem 9.02s 1.75s
% Output : Proof 9.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 47 ( 34 unt; 0 def)
% Number of atoms : 79 ( 21 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 76 ( 44 ~; 20 |; 10 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-4 aty)
% Number of variables : 57 ( 5 sgn 34 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f28,axiom,
! [V,InfD,SupD] :
( ( leq(V,SupD)
& leq(InfD,V) )
=> completion_compatible(V,InfD,SupD) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',completion_compat) ).
fof(f28_nnf,plain,
! [V,InfD,SupD] :
( completion_compatible(V,InfD,SupD)
| ~ leq(V,SupD)
| ~ leq(InfD,V) ),
inference(nnf_transformation,[status(thm)],[f28]) ).
fof(f28_sk,plain,
! [InfD,V,SupD] :
( completion_compatible(V,InfD,SupD)
| ~ leq(V,SupD)
| ~ leq(InfD,V) ),
inference(skolemisation,[status(esa)],[f28_nnf]) ).
cnf(c47,plain,
( completion_compatible(X0,X1,X2)
| ~ leq(X0,X2)
| ~ leq(X1,X0) ),
inference(cnf_transformation,[status(esa)],[f28_sk]) ).
cnf(hi42,axiom,
ifeq(leq(X0,X1),true,ifeq(leq(X1,X2),true,completion_compatible(X1,X0,X2),true),true) = true,
inference(equality_encoding,[status(esa)],[c47]) ).
fof(f36,hypothesis,
! [X] : leq(ninf,X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',h_inf_lb) ).
fof(f36_nnf,plain,
! [X] : leq(ninf,X),
inference(nnf_transformation,[status(thm)],[f36]) ).
fof(f36_sk,plain,
! [X] : leq(ninf,X),
inference(skolemisation,[status(esa)],[f36_nnf]) ).
cnf(c55,plain,
leq(ninf,X0),
inference(cnf_transformation,[status(esa)],[f36_sk]) ).
cnf(hi50,axiom,
leq(ninf,X0) = true,
inference(equality_encoding,[status(esa)],[c55]) ).
cnf(h32,plain,
completion_compatible(ninf,ninf,V0) = true,
inference(hyper_resolution,[status(thm)],[hi42,hi50,hi50]) ).
fof(f39,conjecture,
? [V] :
( completion_compatible(V,ninf,nsup)
& leq(V,nsup)
& leq(ninf,V) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown_sound_compatible) ).
fof(f39_neg,negated_conjecture,
~ ? [V] :
( completion_compatible(V,ninf,nsup)
& leq(V,nsup)
& leq(ninf,V) ),
inference(negated_conjecture,[status(cth)],[f39]) ).
fof(f39_nnf,plain,
! [V] :
( ~ completion_compatible(V,ninf,nsup)
| ~ leq(V,nsup)
| ~ leq(ninf,V) ),
inference(nnf_transformation,[status(thm)],[f39_neg]) ).
fof(f39_sk,plain,
! [V] :
( ~ completion_compatible(V,ninf,nsup)
| ~ leq(V,nsup)
| ~ leq(ninf,V) ),
inference(skolemisation,[status(esa)],[f39_nnf]) ).
cnf(c58,plain,
( ~ completion_compatible(X0,ninf,nsup)
| ~ leq(X0,nsup)
| ~ leq(ninf,X0) ),
inference(cnf_transformation,[status(esa)],[f39_sk]) ).
cnf(hi58,negated_conjecture,
ifeq(leq(ninf,X0),true,ifeq(leq(X0,nsup),true,ifeq(completion_compatible(X0,ninf,nsup),true,false,true),true),true) = true,
inference(equality_encoding,[status(esa)],[c58]) ).
fof(f37,hypothesis,
! [X] : leq(X,nsup),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',h_sup_ub) ).
fof(f37_nnf,plain,
! [X] : leq(X,nsup),
inference(nnf_transformation,[status(thm)],[f37]) ).
fof(f37_sk,plain,
! [X] : leq(X,nsup),
inference(skolemisation,[status(esa)],[f37_nnf]) ).
cnf(c56,plain,
leq(X0,nsup),
inference(cnf_transformation,[status(esa)],[f37_sk]) ).
cnf(hi51,axiom,
leq(X0,nsup) = true,
inference(equality_encoding,[status(esa)],[c56]) ).
cnf(t0,plain,
true = false,
inference(hyper_resolution,[status(thm)],[hi58,hi50,hi51,h32]) ).
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(f14,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(f14_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)],[f14]) ).
fof(f14_sk,plain,
! [I1lo,I1hi,I2lo,I2hi,X] :
( ( ( in_closed(sk1(I1lo,I1hi,I2lo,I2hi),I2lo,I2hi)
& in_closed(sk1(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,[sk1])],[f14_nnf]) ).
cnf(c25,plain,
( ~ in_closed(X4,X2,X3)
| ~ in_closed(X4,X0,X1)
| ~ axis_conflict(X0,X1,X2,X3) ),
inference(cnf_transformation,[status(esa)],[f14_sk]) ).
fof(f20,axiom,
conflict != compatible,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verdicts_distinct_cf_cp) ).
fof(f20_nnf,plain,
conflict != compatible,
inference(nnf_transformation,[status(thm)],[f20]) ).
fof(f20_sk,plain,
conflict != compatible,
inference(skolemisation,[status(esa)],[f20_nnf]) ).
cnf(c37,plain,
conflict != compatible,
inference(cnf_transformation,[status(esa)],[f20_sk]) ).
fof(f21,axiom,
conflict != unknown,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verdicts_distinct_cf_un) ).
fof(f21_nnf,plain,
conflict != unknown,
inference(nnf_transformation,[status(thm)],[f21]) ).
fof(f21_sk,plain,
conflict != unknown,
inference(skolemisation,[status(esa)],[f21_nnf]) ).
cnf(c38,plain,
conflict != unknown,
inference(cnf_transformation,[status(esa)],[f21_sk]) ).
fof(f22,axiom,
compatible != unknown,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verdicts_distinct_cp_un) ).
fof(f22_nnf,plain,
compatible != unknown,
inference(nnf_transformation,[status(thm)],[f22]) ).
fof(f22_sk,plain,
compatible != unknown,
inference(skolemisation,[status(esa)],[f22_nnf]) ).
cnf(c39,plain,
compatible != unknown,
inference(cnf_transformation,[status(esa)],[f22_sk]) ).
cnf(goal_0,negated_conjecture,
true != false,
inference(equality_encoding,[status(esa)],[c0,c25,c37,c38,c39,c58]) ).
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 : MGT070+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.09/0.36 % Computer : n018.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.12/0.36 % DateTime : Thu Sep 24 01:21:19 UTC 2026
% 0.12/0.36 % CPUTime :
% 0.12/0.36 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 9.02/1.75 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.02/1.75 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------