%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : FLD060-2 : 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 : n008.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 1.38s 1.75s
% Output : CNFRefutation 1.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 13
% Syntax : Number of clauses : 39 ( 20 unt; 2 nHn; 39 RR)
% Number of literals : 72 ( 0 equ; 33 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 39 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(symmetry_of_equality,axiom,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',symmetry_of_equality) ).
cnf(add_equals_v_6,negated_conjecture,
equalish(add(b,b),v),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',add_equals_v_6) ).
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(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(v_is_defined,hypothesis,
defined(v),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',v_is_defined) ).
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(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_7,negated_conjecture,
less_or_equal(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_7) ).
cnf(commutativity_addition,axiom,
( equalish(add(X1,X2),add(X2,X1))
| ~ defined(X1)
| ~ defined(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',commutativity_addition) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_is_defined) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_is_defined) ).
cnf(add_equals_u_5,negated_conjecture,
equalish(add(a,a),u),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',add_equals_u_5) ).
cnf(not_less_or_equal_8,negated_conjecture,
~ less_or_equal(u,v),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_less_or_equal_8) ).
cnf(c_0_13,axiom,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
symmetry_of_equality ).
cnf(c_0_14,negated_conjecture,
equalish(add(b,b),v),
add_equals_v_6 ).
cnf(c_0_15,axiom,
( less_or_equal(X1,X2)
| ~ less_or_equal(X3,X2)
| ~ equalish(X3,X1) ),
compatibility_of_equality_and_order_relation ).
cnf(c_0_16,negated_conjecture,
equalish(v,add(b,b)),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,axiom,
( less_or_equal(X1,X2)
| less_or_equal(X2,X1)
| ~ defined(X1)
| ~ defined(X2) ),
totality_of_order_relation ).
cnf(c_0_18,negated_conjecture,
( less_or_equal(add(b,b),X1)
| ~ less_or_equal(v,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
( less_or_equal(X1,X1)
| ~ defined(X1) ),
inference(ef,[status(thm)],[c_0_17]) ).
cnf(c_0_20,hypothesis,
defined(v),
v_is_defined ).
cnf(c_0_21,axiom,
( less_or_equal(X1,X2)
| ~ less_or_equal(X1,X3)
| ~ less_or_equal(X3,X2) ),
transitivity_of_order_relation ).
cnf(c_0_22,negated_conjecture,
less_or_equal(add(b,b),v),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_23,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_24,negated_conjecture,
less_or_equal(a,b),
less_or_equal_7 ).
cnf(c_0_25,axiom,
( equalish(add(X1,X2),add(X2,X1))
| ~ defined(X1)
| ~ defined(X2) ),
commutativity_addition ).
cnf(c_0_26,negated_conjecture,
( less_or_equal(X1,v)
| ~ less_or_equal(X1,add(b,b)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,negated_conjecture,
( less_or_equal(add(a,X1),add(b,X1))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_29,plain,
( less_or_equal(add(X1,X2),X3)
| ~ less_or_equal(add(X2,X1),X3)
| ~ defined(X1)
| ~ defined(X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_25]) ).
cnf(c_0_30,negated_conjecture,
less_or_equal(add(a,b),v),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]) ).
cnf(c_0_31,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_32,negated_conjecture,
equalish(add(a,a),u),
add_equals_u_5 ).
cnf(c_0_33,negated_conjecture,
less_or_equal(add(b,a),v),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_28]),c_0_31])]) ).
cnf(c_0_34,negated_conjecture,
( less_or_equal(u,X1)
| ~ less_or_equal(add(a,a),X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
( less_or_equal(X1,v)
| ~ less_or_equal(X1,add(b,a)) ),
inference(spm,[status(thm)],[c_0_21,c_0_33]) ).
cnf(c_0_36,negated_conjecture,
less_or_equal(u,add(b,a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_27]),c_0_31])]) ).
cnf(c_0_37,negated_conjecture,
~ less_or_equal(u,v),
not_less_or_equal_8 ).
cnf(c_0_38,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : FLD060-2 : 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.14/0.33 % Computer : n008.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Mon May 4 17:29:58 EDT 2026
% 0.14/0.33 % CPUTime :
% 0.14/0.34 % start to proof: theBenchmark
% 1.38/1.75 % Version : CSE_E---1.7
% 1.38/1.75 % Problem : theBenchmark.p
% 1.38/1.75 % SZS status Unsatisfiable for theBenchmark.p
% 1.38/1.75 % SZS output start CNFRefutation
% See solution above
% 1.38/1.75 % Total time : 1.371s
%------------------------------------------------------------------------------