%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : FLD060-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 : n031.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 2.33s 2.01s
% Output : CNFRefutation 2.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of clauses : 35 ( 14 unt; 0 nHn; 35 RR)
% Number of literals : 69 ( 0 equ; 36 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 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 : 44 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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_3,negated_conjecture,
less_or_equal(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_3) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_is_defined) ).
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(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_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(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(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(not_less_or_equal_4,negated_conjecture,
~ less_or_equal(add(a,a),add(b,b)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_less_or_equal_4) ).
cnf(c_0_11,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_12,negated_conjecture,
less_or_equal(a,b),
less_or_equal_3 ).
cnf(c_0_13,negated_conjecture,
( less_or_equal(add(a,X1),add(b,X1))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_15,axiom,
( equalish(add(X1,X2),add(X2,X1))
| ~ defined(X1)
| ~ defined(X2) ),
commutativity_addition ).
cnf(c_0_16,axiom,
( equalish(X1,X1)
| ~ defined(X1) ),
reflexivity_of_equality ).
cnf(c_0_17,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_18,axiom,
( less_or_equal(X1,X2)
| ~ less_or_equal(X3,X2)
| ~ equalish(X3,X1) ),
compatibility_of_equality_and_order_relation ).
cnf(c_0_19,hypothesis,
less_or_equal(add(a,b),add(b,b)),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,hypothesis,
( equalish(add(X1,b),add(b,X1))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_21,axiom,
( equalish(add(X1,X2),add(X3,X2))
| ~ defined(X2)
| ~ equalish(X1,X3) ),
compatibility_of_equality_and_addition ).
cnf(c_0_22,hypothesis,
equalish(a,a),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,axiom,
( less_or_equal(X1,X2)
| ~ less_or_equal(X1,X3)
| ~ less_or_equal(X3,X2) ),
transitivity_of_order_relation ).
cnf(c_0_24,hypothesis,
( less_or_equal(X1,add(b,b))
| ~ equalish(add(a,b),X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,axiom,
( equalish(X1,X2)
| ~ equalish(X1,X3)
| ~ equalish(X3,X2) ),
transitivity_of_equality ).
cnf(c_0_26,hypothesis,
equalish(add(a,b),add(b,a)),
inference(spm,[status(thm)],[c_0_20,c_0_17]) ).
cnf(c_0_27,hypothesis,
( equalish(add(a,X1),add(a,X1))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,hypothesis,
( less_or_equal(X1,add(b,b))
| ~ less_or_equal(X1,X2)
| ~ equalish(add(a,b),X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,hypothesis,
( equalish(X1,add(b,a))
| ~ equalish(X1,add(a,b)) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,hypothesis,
equalish(add(a,b),add(a,b)),
inference(spm,[status(thm)],[c_0_27,c_0_14]) ).
cnf(c_0_31,negated_conjecture,
~ less_or_equal(add(a,a),add(b,b)),
not_less_or_equal_4 ).
cnf(c_0_32,hypothesis,
( less_or_equal(X1,add(b,b))
| ~ less_or_equal(X1,add(b,a)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).
cnf(c_0_33,hypothesis,
less_or_equal(add(a,a),add(b,a)),
inference(spm,[status(thm)],[c_0_13,c_0_17]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : FLD060-1 : TPTP v9.2.1. Bugfixed v2.1.0.
% 0.00/0.11 % 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.32 % Computer : n031.cluster.edu
% 0.15/0.32 % Model : x86_64 x86_64
% 0.15/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.32 % Memory : 8042.1875MB
% 0.15/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.32 % CPULimit : 300
% 0.15/0.32 % WCLimit : 300
% 0.15/0.32 % DateTime : Mon May 4 17:31:53 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 2.33/2.01 % Version : CSE_E---1.7
% 2.33/2.01 % Problem : theBenchmark.p
% 2.33/2.01 % SZS status Unsatisfiable for theBenchmark.p
% 2.33/2.01 % SZS output start CNFRefutation
% See solution above
% 2.33/2.02 % Total time : 1.369s
%------------------------------------------------------------------------------