%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : MGT073+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 : n003.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 7.43s 1.61s
% Output : Proof 7.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of formulae : 68 ( 43 unt; 0 def)
% Number of atoms : 126 ( 38 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 117 ( 59 ~; 36 |; 17 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-4 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-4 aty)
% Number of variables : 85 ( 0 sgn 49 !; 4 ?)
% 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(hi84,axiom,
or(false,X0) = X0,
introduced(definition) ).
cnf(h69,plain,
leq(or(false,V0),V0) = true,
inference(hyper_resolution,[status(thm)],[hi4,hi84]) ).
cnf(h70,plain,
leq(V0,or(false,V0)) = true,
inference(hyper_resolution,[status(thm)],[hi4,hi84]) ).
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(h1176,plain,
leq(V0,V0) = true,
inference(hyper_resolution,[status(thm)],[hi9,h70,h69]) ).
fof(f5,axiom,
! [X,Y] :
( less(X,Y)
=> leq(X,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_implies_leq) ).
fof(f5_nnf,plain,
! [X,Y] :
( leq(X,Y)
| ~ less(X,Y) ),
inference(nnf_transformation,[status(thm)],[f5]) ).
fof(f5_sk,plain,
! [X,Y] :
( leq(X,Y)
| ~ less(X,Y) ),
inference(skolemisation,[status(esa)],[f5_nnf]) ).
cnf(c7,plain,
( leq(X0,X1)
| ~ less(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f5_sk]) ).
cnf(hi6,axiom,
ifeq(less(X0,X1),true,leq(X0,X1),true) = true,
inference(equality_encoding,[status(esa)],[c7]) ).
fof(f37,hypothesis,
less(n5,n10),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',order_5_10) ).
fof(f37_nnf,plain,
less(n5,n10),
inference(nnf_transformation,[status(thm)],[f37]) ).
cnf(c73,plain,
less(n5,n10),
inference(cnf_transformation,[status(esa)],[f37_nnf]) ).
cnf(hi68,axiom,
less(n5,n10) = true,
inference(equality_encoding,[status(esa)],[c73]) ).
cnf(h38,plain,
leq(n5,n10) = true,
inference(hyper_resolution,[status(thm)],[hi6,hi68]) ).
fof(f32,axiom,
! [X,A,B] :
( in_closed(X,A,B)
<=> ( leq(X,B)
& leq(A,X) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',shape_closed) ).
fof(f32_nnf,plain,
! [X,A,B] :
( ( ~ leq(X,B)
| ~ leq(A,X)
| in_closed(X,A,B) )
& ( ( leq(X,B)
& leq(A,X) )
| ~ in_closed(X,A,B) ) ),
inference(nnf_transformation,[status(thm)],[f32]) ).
fof(f32_sk,plain,
! [X,A,B] :
( ( ~ leq(X,B)
| ~ leq(A,X)
| in_closed(X,A,B) )
& ( ( leq(X,B)
& leq(A,X) )
| ~ in_closed(X,A,B) ) ),
inference(skolemisation,[status(esa)],[f32_nnf]) ).
cnf(c62,plain,
( ~ leq(X0,X2)
| ~ leq(X1,X0)
| in_closed(X0,X1,X2) ),
inference(cnf_transformation,[status(esa)],[f32_sk]) ).
cnf(hi57,axiom,
ifeq(leq(X0,X1),true,ifeq(leq(X1,X2),true,in_closed(X1,X0,X2),true),true) = true,
inference(equality_encoding,[status(esa)],[c62]) ).
cnf(h1202,plain,
in_closed(n10,n5,n10) = true,
inference(hyper_resolution,[status(thm)],[hi57,h38,h1176]) ).
fof(f36,hypothesis,
less(n0,n5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',order_0_5) ).
fof(f36_nnf,plain,
less(n0,n5),
inference(nnf_transformation,[status(thm)],[f36]) ).
cnf(c72,plain,
less(n0,n5),
inference(cnf_transformation,[status(esa)],[f36_nnf]) ).
cnf(hi67,axiom,
less(n0,n5) = true,
inference(equality_encoding,[status(esa)],[c72]) ).
cnf(h32,plain,
leq(n0,n5) = true,
inference(hyper_resolution,[status(thm)],[hi6,hi67]) ).
cnf(h88,plain,
leq(n0,n10) = true,
inference(hyper_resolution,[status(thm)],[hi9,h32,h38]) ).
cnf(h1192,plain,
in_closed(n10,n0,n10) = true,
inference(hyper_resolution,[status(thm)],[hi57,h88,h1176]) ).
fof(f39,conjecture,
? [X] :
( in_closed(X,n5,n10)
& in_closed(X,n0,n10) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',no_false_compatible) ).
fof(f39_neg,negated_conjecture,
~ ? [X] :
( in_closed(X,n5,n10)
& in_closed(X,n0,n10) ),
inference(negated_conjecture,[status(cth)],[f39]) ).
fof(f39_nnf,plain,
! [X] :
( ~ in_closed(X,n5,n10)
| ~ in_closed(X,n0,n10) ),
inference(nnf_transformation,[status(thm)],[f39_neg]) ).
fof(f39_sk,plain,
! [X] :
( ~ in_closed(X,n5,n10)
| ~ in_closed(X,n0,n10) ),
inference(skolemisation,[status(esa)],[f39_nnf]) ).
cnf(c75,plain,
( ~ in_closed(X0,n5,n10)
| ~ in_closed(X0,n0,n10) ),
inference(cnf_transformation,[status(esa)],[f39_sk]) ).
cnf(hi75,negated_conjecture,
ifeq(in_closed(X0,n0,n10),true,ifeq(in_closed(X0,n5,n10),true,false,true),true) = true,
inference(equality_encoding,[status(esa)],[c75]) ).
cnf(t0,plain,
true = false,
inference(hyper_resolution,[status(thm)],[hi75,h1192,h1202]) ).
cnf(t286,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]) ).
cnf(goal_0,negated_conjecture,
true != false,
inference(equality_encoding,[status(esa)],[c0,c23,c35,c36,c37,c75]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t286]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT073+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.37 % Computer : n003.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Thu Sep 24 01:21:35 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 7.43/1.61 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.43/1.61 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------