%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : FLD061-2 : TPTP v9.2.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n006.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:27 PM UTC 2026
% Result : Unsatisfiable 1.37s 1.75s
% Output : CNFRefutation 1.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 14
% Syntax : Number of clauses : 42 ( 22 unt; 2 nHn; 42 RR)
% Number of literals : 76 ( 0 equ; 34 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 : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 40 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(symmetry_of_equality,axiom,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',symmetry_of_equality) ).
cnf(add_equals_v_8,negated_conjecture,
equalish(add(d,b),v),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',add_equals_v_8) ).
cnf(compatibility_of_equality_and_order_relation,axiom,
( less_or_equal(X1,X2)
| ~ less_or_equal(X3,X2)
| ~ equalish(X3,X1) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/FLD001-0.ax',totality_of_order_relation) ).
cnf(v_is_defined,hypothesis,
defined(v),
file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/benchmark/Axioms/FLD001-0.ax',compatibility_of_order_relation_and_addition) ).
cnf(less_or_equal_10,negated_conjecture,
less_or_equal(c,d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_10) ).
cnf(commutativity_addition,axiom,
( equalish(add(X1,X2),add(X2,X1))
| ~ defined(X1)
| ~ defined(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',commutativity_addition) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_is_defined) ).
cnf(c_is_defined,hypothesis,
defined(c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_is_defined) ).
cnf(less_or_equal_9,negated_conjecture,
less_or_equal(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_9) ).
cnf(add_equals_u_7,negated_conjecture,
equalish(add(a,c),u),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',add_equals_u_7) ).
cnf(not_less_or_equal_11,negated_conjecture,
~ less_or_equal(u,v),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_less_or_equal_11) ).
cnf(c_0_14,axiom,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
symmetry_of_equality ).
cnf(c_0_15,negated_conjecture,
equalish(add(d,b),v),
add_equals_v_8 ).
cnf(c_0_16,axiom,
( less_or_equal(X1,X2)
| ~ less_or_equal(X3,X2)
| ~ equalish(X3,X1) ),
compatibility_of_equality_and_order_relation ).
cnf(c_0_17,negated_conjecture,
equalish(v,add(d,b)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,axiom,
( less_or_equal(X1,X2)
| less_or_equal(X2,X1)
| ~ defined(X1)
| ~ defined(X2) ),
totality_of_order_relation ).
cnf(c_0_19,negated_conjecture,
( less_or_equal(add(d,b),X1)
| ~ less_or_equal(v,X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
( less_or_equal(X1,X1)
| ~ defined(X1) ),
inference(ef,[status(thm)],[c_0_18]) ).
cnf(c_0_21,hypothesis,
defined(v),
v_is_defined ).
cnf(c_0_22,axiom,
( less_or_equal(X1,X2)
| ~ less_or_equal(X1,X3)
| ~ less_or_equal(X3,X2) ),
transitivity_of_order_relation ).
cnf(c_0_23,negated_conjecture,
less_or_equal(add(d,b),v),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_24,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_25,negated_conjecture,
less_or_equal(c,d),
less_or_equal_10 ).
cnf(c_0_26,axiom,
( equalish(add(X1,X2),add(X2,X1))
| ~ defined(X1)
| ~ defined(X2) ),
commutativity_addition ).
cnf(c_0_27,negated_conjecture,
( less_or_equal(X1,v)
| ~ less_or_equal(X1,add(d,b)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,negated_conjecture,
( less_or_equal(add(c,X1),add(d,X1))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_30,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_16,c_0_26]) ).
cnf(c_0_31,negated_conjecture,
less_or_equal(add(c,b),v),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).
cnf(c_0_32,hypothesis,
defined(c),
c_is_defined ).
cnf(c_0_33,negated_conjecture,
less_or_equal(add(b,c),v),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_29]),c_0_32])]) ).
cnf(c_0_34,negated_conjecture,
less_or_equal(a,b),
less_or_equal_9 ).
cnf(c_0_35,negated_conjecture,
equalish(add(a,c),u),
add_equals_u_7 ).
cnf(c_0_36,negated_conjecture,
( less_or_equal(X1,v)
| ~ less_or_equal(X1,add(b,c)) ),
inference(spm,[status(thm)],[c_0_22,c_0_33]) ).
cnf(c_0_37,negated_conjecture,
( less_or_equal(add(a,X1),add(b,X1))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_34]) ).
cnf(c_0_38,negated_conjecture,
( less_or_equal(u,X1)
| ~ less_or_equal(add(a,c),X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_35]) ).
cnf(c_0_39,negated_conjecture,
less_or_equal(add(a,c),v),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_32])]) ).
cnf(c_0_40,negated_conjecture,
~ less_or_equal(u,v),
not_less_or_equal_11 ).
cnf(c_0_41,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : FLD061-2 : TPTP v9.2.1. Bugfixed v2.1.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.33 % Computer : n006.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Mon May 4 17:29:46 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.35 % start to proof: theBenchmark
% 1.37/1.75 % Version : CSE_E---1.7
% 1.37/1.75 % Problem : theBenchmark.p
% 1.37/1.75 % SZS status Unsatisfiable for theBenchmark.p
% 1.37/1.75 % SZS output start CNFRefutation
% See solution above
% 1.37/1.75 % Total time : 1.368s
%------------------------------------------------------------------------------