%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : BOO004-2 : TPTP v9.2.1. Released v1.0.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 : n002.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:03 PM UTC 2026
% Result : Unsatisfiable 1.26s 1.73s
% Output : CNFRefutation 1.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 15 ( 15 unt; 0 nHn; 3 RR)
% Number of literals : 15 ( 14 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 17 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(distributivity2,axiom,
add(X1,multiply(X2,X3)) = multiply(add(X1,X2),add(X1,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/BOO003-0.ax',distributivity2) ).
cnf(additive_inverse1,axiom,
add(X1,inverse(X1)) = multiplicative_identity,
file('/export/starexec/sandbox2/benchmark/Axioms/BOO003-0.ax',additive_inverse1) ).
cnf(multiplicative_id1,axiom,
multiply(X1,multiplicative_identity) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/BOO003-0.ax',multiplicative_id1) ).
cnf(multiplicative_inverse1,axiom,
multiply(X1,inverse(X1)) = additive_identity,
file('/export/starexec/sandbox2/benchmark/Axioms/BOO003-0.ax',multiplicative_inverse1) ).
cnf(additive_id1,axiom,
add(X1,additive_identity) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/BOO003-0.ax',additive_id1) ).
cnf(prove_a_plus_a_is_a,negated_conjecture,
add(a,a) != a,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_a_plus_a_is_a) ).
cnf(c_0_6,axiom,
add(X1,multiply(X2,X3)) = multiply(add(X1,X2),add(X1,X3)),
distributivity2 ).
cnf(c_0_7,axiom,
add(X1,inverse(X1)) = multiplicative_identity,
additive_inverse1 ).
cnf(c_0_8,axiom,
multiply(X1,multiplicative_identity) = X1,
multiplicative_id1 ).
cnf(c_0_9,plain,
add(X1,multiply(X2,inverse(X1))) = add(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).
cnf(c_0_10,axiom,
multiply(X1,inverse(X1)) = additive_identity,
multiplicative_inverse1 ).
cnf(c_0_11,axiom,
add(X1,additive_identity) = X1,
additive_id1 ).
cnf(c_0_12,negated_conjecture,
add(a,a) != a,
prove_a_plus_a_is_a ).
cnf(c_0_13,plain,
add(X1,X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.12 % Problem : BOO004-2 : TPTP v9.2.1. Released v1.0.0.
% 0.13/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.34 % Computer : n002.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Tue May 5 10:44:46 EDT 2026
% 0.16/0.34 % CPUTime :
% 0.16/0.35 % start to proof: theBenchmark
% 1.26/1.73 % Version : CSE_E---1.7
% 1.26/1.73 % Problem : theBenchmark.p
% 1.26/1.73 % SZS status Unsatisfiable for theBenchmark.p
% 1.26/1.73 % SZS output start CNFRefutation
% See solution above
% 1.26/1.73 % Total time : 1.371s
%------------------------------------------------------------------------------