%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : FLD056-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n005.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 01:15:04 PM UTC 2026
% Result : Unsatisfiable 11.36s 12.15s
% Output : Proof 11.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 6
% Syntax : Number of formulae : 36 ( 32 unt; 0 def)
% Number of atoms : 48 ( 20 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 30 ( 18 ~; 12 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-4 aty)
% Number of variables : 20 ( 2 sgn 4 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f17,axiom,
( ~ defined(Y)
| ~ defined(X)
| less_or_equal(Y,X)
| less_or_equal(X,Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',totality_of_order_relation) ).
fof(f17_nnf,plain,
! [X,Y] :
( ~ defined(Y)
| ~ defined(X)
| less_or_equal(Y,X)
| less_or_equal(X,Y) ),
inference(nnf_transformation,[status(thm)],[f17]) ).
fof(f17_sk,plain,
! [X,Y] :
( ~ defined(Y)
| ~ defined(X)
| less_or_equal(Y,X)
| less_or_equal(X,Y) ),
inference(skolemisation,[status(esa)],[f17_nnf]) ).
cnf(c17,plain,
( ~ defined(X1)
| ~ defined(X0)
| less_or_equal(X1,X0)
| less_or_equal(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f17_sk]) ).
cnf(t28,plain,
ifeq(defined(X1),true,ifeq(defined(X2),true,or(less_or_equal(X1,X2),less_or_equal(X2,X1)),true),true) = true,
inference(equality_encoding,[status(esa)],[c17]) ).
cnf(t46,plain,
ifeq(defined(X1),true,ifeq(defined(X2),true,or(less_or_equal(X1,X2),less_or_equal(X2,X1)),true),true) = true,
inference(orient,[status(thm)],[t28]) ).
cnf(f28,negated_conjecture,
~ less_or_equal(a,a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_less_or_equal_2) ).
fof(f28_nnf,plain,
~ less_or_equal(a,a),
inference(nnf_transformation,[status(thm)],[f28]) ).
fof(f28_sk,plain,
~ less_or_equal(a,a),
inference(skolemisation,[status(esa)],[f28_nnf]) ).
cnf(c28,plain,
~ less_or_equal(a,a),
inference(cnf_transformation,[status(esa)],[f28_sk]) ).
cnf(t4,plain,
less_or_equal(a,a) = false,
inference(equality_encoding,[status(esa)],[c28]) ).
cnf(t169,plain,
less_or_equal(a,a) = false,
inference(orient,[status(thm)],[t4]) ).
cnf(t178,plain,
true = ifeq(defined(a),true,ifeq(defined(a),true,or(false,less_or_equal(a,a)),true),true),
inference(cp,[status(thm)],[t46,t169]) ).
cnf(f27,hypothesis,
defined(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_is_defined) ).
fof(f27_nnf,plain,
defined(a),
inference(nnf_transformation,[status(thm)],[f27]) ).
cnf(c27,plain,
defined(a),
inference(cnf_transformation,[status(esa)],[f27_nnf]) ).
cnf(t0,plain,
defined(a) = true,
inference(equality_encoding,[status(esa)],[c27]) ).
cnf(t96,plain,
defined(a) = true,
inference(orient,[status(thm)],[t0]) ).
cnf(t190,plain,
true = ifeq(true,true,ifeq(defined(a),true,or(false,less_or_equal(a,a)),true),true),
inference(step,[status(thm)],[t178,t96]) ).
cnf(t9,plain,
ifeq(X1,X1,X2,X3) = X2,
introduced(definition) ).
cnf(t36,plain,
ifeq(X1,X1,X2,X3) = X2,
inference(orient,[status(thm)],[t9]) ).
cnf(t191,plain,
true = ifeq(defined(a),true,or(false,less_or_equal(a,a)),true),
inference(step,[status(thm)],[t190,t36]) ).
cnf(t192,plain,
true = ifeq(true,true,or(false,less_or_equal(a,a)),true),
inference(step,[status(thm)],[t191,t96]) ).
cnf(t193,plain,
true = or(false,less_or_equal(a,a)),
inference(step,[status(thm)],[t192,t36]) ).
cnf(t7,plain,
or(false,X1) = X1,
introduced(definition) ).
cnf(t38,plain,
or(false,X1) = X1,
inference(orient,[status(thm)],[t7]) ).
cnf(t194,plain,
true = less_or_equal(a,a),
inference(step,[status(thm)],[t193,t38]) ).
cnf(t195,plain,
true = false,
inference(step,[status(thm)],[t194,t169]) ).
cnf(t181,plain,
false = true,
inference(orient,[status(thm)],[t195]) ).
cnf(f26,axiom,
~ equalish(additive_identity,multiplicative_identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',different_identities) ).
fof(f26_nnf,plain,
~ equalish(additive_identity,multiplicative_identity),
inference(nnf_transformation,[status(thm)],[f26]) ).
fof(f26_sk,plain,
~ equalish(additive_identity,multiplicative_identity),
inference(skolemisation,[status(esa)],[f26_nnf]) ).
cnf(c26,plain,
~ equalish(additive_identity,multiplicative_identity),
inference(cnf_transformation,[status(esa)],[f26_sk]) ).
cnf(goal_0,negated_conjecture,
true != false,
inference(equality_encoding,[status(esa)],[c26,c28]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t181]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : FLD056-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/10.59 % Computer : n005.cluster.edu
% 0.10/10.59 % Model : x86_64 x86_64
% 0.10/10.59 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/10.59 % Memory : 8046.5625MB
% 0.10/10.59 % OS : Linux 6.8.0-71-generic
% 0.10/10.59 % CPULimit : 300
% 0.10/10.59 % WCLimit : 300
% 0.10/10.59 % DateTime : Fri Sep 25 10:57:27 UTC 2026
% 0.10/10.59 % CPUTime :
% 0.10/10.59 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 11.36/12.15 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 11.36/12.15 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------