%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : FLD059-1 : TPTP v9.2.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n027.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 04:18:26 PM UTC 2026
% Result : Unsatisfiable 4.03s 3.20s
% Output : CNFRefutation 4.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 13
% Syntax : Number of clauses : 51 ( 20 unt; 2 nHn; 51 RR)
% Number of literals : 98 ( 0 equ; 47 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 57 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(totality_of_order_relation,axiom,
( less_or_equal(X1,X2)
| less_or_equal(X2,X1)
| ~ defined(X1)
| ~ defined(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',totality_of_order_relation) ).
cnf(well_definedness_of_additive_identity,axiom,
defined(additive_identity),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',well_definedness_of_additive_identity) ).
cnf(existence_of_identity_addition,axiom,
( equalish(add(additive_identity,X1),X1)
| ~ defined(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',existence_of_identity_addition) ).
cnf(compatibility_of_equality_and_order_relation,axiom,
( less_or_equal(X1,X2)
| ~ less_or_equal(X3,X2)
| ~ equalish(X3,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',compatibility_of_equality_and_order_relation) ).
cnf(symmetry_of_equality,axiom,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',symmetry_of_equality) ).
cnf(compatibility_of_order_relation_and_addition,axiom,
( less_or_equal(add(X1,X2),add(X3,X2))
| ~ defined(X2)
| ~ less_or_equal(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',compatibility_of_order_relation_and_addition) ).
cnf(less_or_equal_2,negated_conjecture,
less_or_equal(additive_identity,a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_2) ).
cnf(transitivity_of_equality,axiom,
( equalish(X1,X2)
| ~ equalish(X1,X3)
| ~ equalish(X3,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',transitivity_of_equality) ).
cnf(reflexivity_of_equality,axiom,
( equalish(X1,X1)
| ~ defined(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',reflexivity_of_equality) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_is_defined) ).
cnf(compatibility_of_equality_and_addition,axiom,
( equalish(add(X1,X2),add(X3,X2))
| ~ defined(X2)
| ~ equalish(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',compatibility_of_equality_and_addition) ).
cnf(transitivity_of_order_relation,axiom,
( less_or_equal(X1,X2)
| ~ less_or_equal(X1,X3)
| ~ less_or_equal(X3,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',transitivity_of_order_relation) ).
cnf(not_less_or_equal_3,negated_conjecture,
~ less_or_equal(additive_identity,add(a,a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_less_or_equal_3) ).
cnf(c_0_13,axiom,
( less_or_equal(X1,X2)
| less_or_equal(X2,X1)
| ~ defined(X1)
| ~ defined(X2) ),
totality_of_order_relation ).
cnf(c_0_14,plain,
( less_or_equal(X1,X1)
| ~ defined(X1) ),
inference(ef,[status(thm)],[c_0_13]) ).
cnf(c_0_15,axiom,
defined(additive_identity),
well_definedness_of_additive_identity ).
cnf(c_0_16,axiom,
( equalish(add(additive_identity,X1),X1)
| ~ defined(X1) ),
existence_of_identity_addition ).
cnf(c_0_17,axiom,
( less_or_equal(X1,X2)
| ~ less_or_equal(X3,X2)
| ~ equalish(X3,X1) ),
compatibility_of_equality_and_order_relation ).
cnf(c_0_18,plain,
less_or_equal(additive_identity,additive_identity),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,axiom,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
symmetry_of_equality ).
cnf(c_0_20,plain,
equalish(add(additive_identity,additive_identity),additive_identity),
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_21,axiom,
( less_or_equal(add(X1,X2),add(X3,X2))
| ~ defined(X2)
| ~ less_or_equal(X1,X3) ),
compatibility_of_order_relation_and_addition ).
cnf(c_0_22,negated_conjecture,
less_or_equal(additive_identity,a),
less_or_equal_2 ).
cnf(c_0_23,plain,
( less_or_equal(X1,additive_identity)
| ~ equalish(additive_identity,X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,axiom,
( equalish(X1,X2)
| ~ equalish(X1,X3)
| ~ equalish(X3,X2) ),
transitivity_of_equality ).
cnf(c_0_25,plain,
equalish(additive_identity,add(additive_identity,additive_identity)),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,axiom,
( equalish(X1,X1)
| ~ defined(X1) ),
reflexivity_of_equality ).
cnf(c_0_27,negated_conjecture,
( less_or_equal(add(additive_identity,X1),add(a,X1))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_29,plain,
( less_or_equal(X1,additive_identity)
| ~ equalish(additive_identity,X2)
| ~ equalish(X2,X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_23]) ).
cnf(c_0_30,plain,
( equalish(X1,add(additive_identity,additive_identity))
| ~ equalish(X1,additive_identity) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,plain,
equalish(additive_identity,additive_identity),
inference(spm,[status(thm)],[c_0_26,c_0_15]) ).
cnf(c_0_32,axiom,
( equalish(add(X1,X2),add(X3,X2))
| ~ defined(X2)
| ~ equalish(X1,X3) ),
compatibility_of_equality_and_addition ).
cnf(c_0_33,axiom,
( less_or_equal(X1,X2)
| ~ less_or_equal(X1,X3)
| ~ less_or_equal(X3,X2) ),
transitivity_of_order_relation ).
cnf(c_0_34,hypothesis,
less_or_equal(add(additive_identity,a),add(a,a)),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_35,plain,
( less_or_equal(X1,additive_identity)
| ~ equalish(add(additive_identity,additive_identity),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).
cnf(c_0_36,plain,
( equalish(add(additive_identity,X1),add(add(additive_identity,additive_identity),X1))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_32,c_0_25]) ).
cnf(c_0_37,hypothesis,
( less_or_equal(X1,add(a,a))
| ~ less_or_equal(X1,add(additive_identity,a)) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,plain,
less_or_equal(add(additive_identity,additive_identity),additive_identity),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_30]),c_0_20])]) ).
cnf(c_0_39,hypothesis,
equalish(add(additive_identity,a),a),
inference(spm,[status(thm)],[c_0_16,c_0_28]) ).
cnf(c_0_40,hypothesis,
equalish(add(additive_identity,a),add(add(additive_identity,additive_identity),a)),
inference(spm,[status(thm)],[c_0_36,c_0_28]) ).
cnf(c_0_41,hypothesis,
( less_or_equal(X1,add(a,a))
| ~ less_or_equal(X2,add(additive_identity,a))
| ~ equalish(X2,X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_37]) ).
cnf(c_0_42,plain,
( less_or_equal(add(add(additive_identity,additive_identity),X1),add(additive_identity,X1))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_38]) ).
cnf(c_0_43,hypothesis,
( equalish(X1,a)
| ~ equalish(X1,add(additive_identity,a)) ),
inference(spm,[status(thm)],[c_0_24,c_0_39]) ).
cnf(c_0_44,hypothesis,
equalish(add(add(additive_identity,additive_identity),a),add(additive_identity,a)),
inference(spm,[status(thm)],[c_0_19,c_0_40]) ).
cnf(c_0_45,hypothesis,
( less_or_equal(X1,add(a,a))
| ~ equalish(add(add(additive_identity,additive_identity),a),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_28])]) ).
cnf(c_0_46,hypothesis,
equalish(add(add(additive_identity,additive_identity),a),a),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_47,hypothesis,
less_or_equal(a,add(a,a)),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_48,negated_conjecture,
~ less_or_equal(additive_identity,add(a,a)),
not_less_or_equal_3 ).
cnf(c_0_49,hypothesis,
( less_or_equal(X1,add(a,a))
| ~ less_or_equal(X1,a) ),
inference(spm,[status(thm)],[c_0_33,c_0_47]) ).
cnf(c_0_50,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : FLD059-1 : TPTP v9.2.1. Bugfixed v2.1.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.33 % Computer : n027.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Mon May 4 17:30:05 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 4.03/3.20 % Version : CSE_E---1.7
% 4.03/3.20 % Problem : theBenchmark.p
% 4.03/3.20 % SZS status Unsatisfiable for theBenchmark.p
% 4.03/3.20 % SZS output start CNFRefutation
% See solution above
% 4.03/3.21 % Total time : 2.371s
%------------------------------------------------------------------------------