%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : RNG012-6 : TPTP v9.2.1. Released v1.0.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 : n027.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 05:05:00 PM UTC 2026
% Result : Unsatisfiable 2.49s 2.10s
% Output : CNFRefutation 2.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of clauses : 33 ( 33 unt; 0 nHn; 3 RR)
% Number of literals : 33 ( 32 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 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 : 58 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity_for_addition,axiom,
add(X1,add(X2,X3)) = add(add(X1,X2),X3),
file('/export/starexec/sandbox/benchmark/Axioms/RNG003-0.ax',associativity_for_addition) ).
cnf(right_additive_inverse,axiom,
add(X1,additive_inverse(X1)) = additive_identity,
file('/export/starexec/sandbox/benchmark/Axioms/RNG003-0.ax',right_additive_inverse) ).
cnf(left_additive_identity,axiom,
add(additive_identity,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/RNG003-0.ax',left_additive_identity) ).
cnf(commutativity_for_addition,axiom,
add(X1,X2) = add(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/RNG003-0.ax',commutativity_for_addition) ).
cnf(distribute1,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X1,X2),multiply(X1,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/RNG003-0.ax',distribute1) ).
cnf(right_additive_identity,axiom,
add(X1,additive_identity) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/RNG003-0.ax',right_additive_identity) ).
cnf(additive_inverse_additive_inverse,axiom,
additive_inverse(additive_inverse(X1)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/RNG003-0.ax',additive_inverse_additive_inverse) ).
cnf(right_multiplicative_zero,axiom,
multiply(X1,additive_identity) = additive_identity,
file('/export/starexec/sandbox/benchmark/Axioms/RNG003-0.ax',right_multiplicative_zero) ).
cnf(distribute2,axiom,
multiply(add(X1,X2),X3) = add(multiply(X1,X3),multiply(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/RNG003-0.ax',distribute2) ).
cnf(left_multiplicative_zero,axiom,
multiply(additive_identity,X1) = additive_identity,
file('/export/starexec/sandbox/benchmark/Axioms/RNG003-0.ax',left_multiplicative_zero) ).
cnf(prove_equation,negated_conjecture,
multiply(additive_inverse(a),additive_inverse(b)) != multiply(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_equation) ).
cnf(c_0_11,axiom,
add(X1,add(X2,X3)) = add(add(X1,X2),X3),
associativity_for_addition ).
cnf(c_0_12,axiom,
add(X1,additive_inverse(X1)) = additive_identity,
right_additive_inverse ).
cnf(c_0_13,axiom,
add(additive_identity,X1) = X1,
left_additive_identity ).
cnf(c_0_14,plain,
add(X1,add(additive_inverse(X1),X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_15,axiom,
add(X1,X2) = add(X2,X1),
commutativity_for_addition ).
cnf(c_0_16,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X1,X2),multiply(X1,X3)),
distribute1 ).
cnf(c_0_17,plain,
add(X1,add(X2,additive_inverse(add(X1,X2)))) = additive_identity,
inference(spm,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_18,axiom,
add(X1,additive_identity) = X1,
right_additive_identity ).
cnf(c_0_19,plain,
add(X1,add(X2,additive_inverse(X1))) = X2,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
add(multiply(X1,X2),add(multiply(X1,X3),X4)) = add(multiply(X1,add(X2,X3)),X4),
inference(spm,[status(thm)],[c_0_11,c_0_16]) ).
cnf(c_0_21,plain,
add(X1,additive_inverse(add(additive_inverse(X2),X1))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_17]),c_0_18]) ).
cnf(c_0_22,axiom,
additive_inverse(additive_inverse(X1)) = X1,
additive_inverse_additive_inverse ).
cnf(c_0_23,plain,
add(multiply(X1,add(X2,X3)),additive_inverse(multiply(X1,X2))) = multiply(X1,X3),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,axiom,
multiply(X1,additive_identity) = additive_identity,
right_multiplicative_zero ).
cnf(c_0_25,plain,
add(X1,additive_inverse(add(X2,X1))) = additive_inverse(X2),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,axiom,
multiply(add(X1,X2),X3) = add(multiply(X1,X3),multiply(X2,X3)),
distribute2 ).
cnf(c_0_27,plain,
additive_inverse(multiply(X1,X2)) = multiply(X1,additive_inverse(X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_12]),c_0_24]),c_0_13]) ).
cnf(c_0_28,plain,
add(multiply(X1,X2),multiply(add(X3,X1),additive_inverse(X2))) = multiply(X3,additive_inverse(X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_27]) ).
cnf(c_0_29,axiom,
multiply(additive_identity,X1) = additive_identity,
left_multiplicative_zero ).
cnf(c_0_30,negated_conjecture,
multiply(additive_inverse(a),additive_inverse(b)) != multiply(a,b),
prove_equation ).
cnf(c_0_31,plain,
multiply(additive_inverse(X1),X2) = multiply(X1,additive_inverse(X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_12]),c_0_29]),c_0_18]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : RNG012-6 : TPTP v9.2.1. Released v1.0.0.
% 0.00/0.12 % 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.16/0.33 % Computer : n027.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 : Tue May 5 01:59:05 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 2.49/2.10 % Version : CSE_E---1.7
% 2.49/2.10 % Problem : theBenchmark.p
% 2.49/2.10 % SZS status Unsatisfiable for theBenchmark.p
% 2.49/2.10 % SZS output start CNFRefutation
% See solution above
% 2.49/2.11 % Total time : 1.371s
%------------------------------------------------------------------------------