%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : BOO011-4 : TPTP v9.2.1. Bugfixed v1.2.1.
% 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 : n021.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:11:06 PM UTC 2026
% Result : Unsatisfiable 1.24s 1.72s
% Output : CNFRefutation 1.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 10 ( 10 unt; 0 nHn; 3 RR)
% Number of literals : 10 ( 9 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 9 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(additive_id1,axiom,
add(X1,additive_identity) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/BOO004-0.ax',additive_id1) ).
cnf(commutativity_of_add,axiom,
add(X1,X2) = add(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/BOO004-0.ax',commutativity_of_add) ).
cnf(additive_inverse1,axiom,
add(X1,inverse(X1)) = multiplicative_identity,
file('/export/starexec/sandbox2/benchmark/Axioms/BOO004-0.ax',additive_inverse1) ).
cnf(prove_inverse_of_1_is_0,negated_conjecture,
inverse(additive_identity) != multiplicative_identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_inverse_of_1_is_0) ).
cnf(c_0_4,axiom,
add(X1,additive_identity) = X1,
additive_id1 ).
cnf(c_0_5,axiom,
add(X1,X2) = add(X2,X1),
commutativity_of_add ).
cnf(c_0_6,axiom,
add(X1,inverse(X1)) = multiplicative_identity,
additive_inverse1 ).
cnf(c_0_7,plain,
add(additive_identity,X1) = X1,
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_8,negated_conjecture,
inverse(additive_identity) != multiplicative_identity,
prove_inverse_of_1_is_0 ).
cnf(c_0_9,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : BOO011-4 : TPTP v9.2.1. Bugfixed v1.2.1.
% 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.15/0.33 % Computer : n021.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 : Tue May 5 10:45:10 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 1.24/1.72 % Version : CSE_E---1.7
% 1.24/1.72 % Problem : theBenchmark.p
% 1.24/1.72 % SZS status Unsatisfiable for theBenchmark.p
% 1.24/1.72 % SZS output start CNFRefutation
% See solution above
% 1.24/1.72 % Total time : 1.371s
%------------------------------------------------------------------------------