%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : FLD071-4 : 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 : n007.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:31 PM UTC 2026
% Result : Unsatisfiable 1.28s 1.72s
% Output : CNFRefutation 1.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 13 ( 9 unt; 0 nHn; 13 RR)
% Number of literals : 22 ( 0 equ; 11 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 9 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(compatibility_of_order_relation_and_multiplication,axiom,
( less_or_equal(additive_identity,X1)
| ~ less_or_equal(additive_identity,X2)
| ~ less_or_equal(additive_identity,X3)
| ~ product(X2,X3,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',compatibility_of_order_relation_and_multiplication) ).
cnf(less_or_equal_5,negated_conjecture,
less_or_equal(additive_identity,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_5) ).
cnf(less_or_equal_4,negated_conjecture,
less_or_equal(additive_identity,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_4) ).
cnf(product_6,negated_conjecture,
product(a,b,u),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product_6) ).
cnf(not_less_or_equal_7,negated_conjecture,
~ less_or_equal(additive_identity,u),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_less_or_equal_7) ).
cnf(c_0_5,axiom,
( less_or_equal(additive_identity,X1)
| ~ less_or_equal(additive_identity,X2)
| ~ less_or_equal(additive_identity,X3)
| ~ product(X2,X3,X1) ),
compatibility_of_order_relation_and_multiplication ).
cnf(c_0_6,negated_conjecture,
less_or_equal(additive_identity,b),
less_or_equal_5 ).
cnf(c_0_7,negated_conjecture,
( less_or_equal(additive_identity,X1)
| ~ less_or_equal(additive_identity,X2)
| ~ product(X2,b,X1) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,negated_conjecture,
less_or_equal(additive_identity,a),
less_or_equal_4 ).
cnf(c_0_9,negated_conjecture,
( less_or_equal(additive_identity,X1)
| ~ product(a,b,X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,negated_conjecture,
product(a,b,u),
product_6 ).
cnf(c_0_11,negated_conjecture,
~ less_or_equal(additive_identity,u),
not_less_or_equal_7 ).
cnf(c_0_12,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : FLD071-4 : 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.14/0.33 % Computer : n007.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:30:39 EDT 2026
% 0.14/0.33 % CPUTime :
% 0.14/0.34 % start to proof: theBenchmark
% 1.28/1.72 % Version : CSE_E---1.7
% 1.28/1.72 % Problem : theBenchmark.p
% 1.28/1.72 % SZS status Unsatisfiable for theBenchmark.p
% 1.28/1.72 % SZS output start CNFRefutation
% See solution above
% 1.28/1.72 % Total time : 1.371s
%------------------------------------------------------------------------------