%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : MGT006-1 : TPTP v9.3.1. Released v2.4.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:15 PM UTC 2026
% Result : Unsatisfiable 17.71s 2.68s
% Output : Proof 17.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 2
% Syntax : Number of formulae : 17 ( 13 unt; 0 def)
% Number of atoms : 21 ( 12 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 14 ( 10 ~; 4 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-4 aty)
% Number of variables : 6 ( 2 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f13,negated_conjecture,
( ~ greater(sk6,sk5)
| ~ greater(sk4,sk3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t6_FOL_14) ).
fof(f13_nnf,plain,
( ~ greater(sk6,sk5)
| ~ greater(sk4,sk3) ),
inference(nnf_transformation,[status(thm)],[f13]) ).
fof(f13_sk,plain,
( ~ greater(sk6,sk5)
| ~ greater(sk4,sk3) ),
inference(skolemisation,[status(esa)],[f13_nnf]) ).
cnf(c13,plain,
( ~ greater(sk6,sk5)
| ~ greater(sk4,sk3) ),
inference(cnf_transformation,[status(esa)],[f13_sk]) ).
cnf(t10,plain,
ifeq(greater(sk4,sk3),true,ifeq(greater(sk6,sk5),true,false,true),true) = true,
inference(equality_encoding,[status(esa)],[c13]) ).
cnf(t27,plain,
ifeq(greater(sk4,sk3),true,ifeq(greater(sk6,sk5),true,false,true),true) = true,
inference(orient,[status(thm)],[t10]) ).
cnf(t396,plain,
ifeq(true,true,ifeq(greater(sk6,sk5),true,false,true),true) = true,
inference(rw,[status(thm)],[t27]) ).
cnf(t8,plain,
ifeq(X1,X1,X2,X3) = X2,
introduced(definition) ).
cnf(t23,plain,
ifeq(X1,X1,X2,X3) = X2,
inference(orient,[status(thm)],[t8]) ).
cnf(t1563,plain,
ifeq(greater(sk6,sk5),true,false,true) = true,
inference(step,[status(thm)],[t396,t23]) ).
cnf(t444,plain,
ifeq(greater(sk6,sk5),true,false,true) = true,
inference(orient,[status(thm)],[t1563]) ).
cnf(t1300,plain,
ifeq(true,true,false,true) = true,
inference(rw,[status(thm)],[t444]) ).
cnf(t1935,plain,
false = true,
inference(step,[status(thm)],[t1300,t23]) ).
cnf(t1429,plain,
false = true,
inference(orient,[status(thm)],[t1935]) ).
cnf(goal_0,negated_conjecture,
true != false,
inference(equality_encoding,[status(esa)],[c13]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t1429]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT006-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.08/0.35 % Computer : n003.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Thu Sep 24 00:58:21 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 17.71/2.68 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 17.71/2.68 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------