%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : ROB023-1 : 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 : n022.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:44 PM UTC 2026
% Result : Unsatisfiable 1.91s 1.93s
% Output : CNFRefutation 1.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of clauses : 32 ( 32 unt; 0 nHn; 4 RR)
% Number of literals : 32 ( 31 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 2 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 : 53 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity_of_add,axiom,
add(add(X1,X2),X3) = add(X1,add(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/ROB001-0.ax',associativity_of_add) ).
cnf(x_plus_x_is_x,hypothesis,
add(X1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x_plus_x_is_x) ).
cnf(robbins_axiom,axiom,
negate(add(negate(add(X1,X2)),negate(add(X1,negate(X2))))) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/ROB001-0.ax',robbins_axiom) ).
cnf(commutativity_of_add,axiom,
add(X1,X2) = add(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/ROB001-0.ax',commutativity_of_add) ).
cnf(prove_huntingtons_axiom,negated_conjecture,
add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))) != b,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_huntingtons_axiom) ).
cnf(c_0_5,axiom,
add(add(X1,X2),X3) = add(X1,add(X2,X3)),
associativity_of_add ).
cnf(c_0_6,hypothesis,
add(X1,X1) = X1,
x_plus_x_is_x ).
cnf(c_0_7,axiom,
negate(add(negate(add(X1,X2)),negate(add(X1,negate(X2))))) = X1,
robbins_axiom ).
cnf(c_0_8,hypothesis,
add(X1,add(X1,X2)) = add(X1,X2),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,axiom,
add(X1,X2) = add(X2,X1),
commutativity_of_add ).
cnf(c_0_10,hypothesis,
negate(add(negate(add(X1,X2)),negate(add(X1,negate(add(X1,X2)))))) = X1,
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,hypothesis,
add(X1,add(X2,X1)) = add(X2,X1),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
negate(add(negate(add(X1,X2)),negate(add(negate(X2),X1)))) = X1,
inference(spm,[status(thm)],[c_0_7,c_0_9]) ).
cnf(c_0_13,hypothesis,
negate(add(X1,negate(add(X1,negate(add(X1,X2)))))) = negate(add(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_10]),c_0_9]) ).
cnf(c_0_14,hypothesis,
add(X1,add(X2,add(X1,X3))) = add(X2,add(X1,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_11]),c_0_5]),c_0_5]) ).
cnf(c_0_15,hypothesis,
negate(add(negate(negate(X1)),negate(add(X1,negate(X1))))) = negate(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_6]),c_0_9]),c_0_9]) ).
cnf(c_0_16,plain,
add(X1,add(X2,X3)) = add(X3,add(X1,X2)),
inference(spm,[status(thm)],[c_0_9,c_0_5]) ).
cnf(c_0_17,plain,
add(X1,add(X2,X3)) = add(X2,add(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_9]),c_0_5]) ).
cnf(c_0_18,plain,
negate(add(negate(add(X1,X2)),negate(add(negate(X1),X2)))) = X2,
inference(spm,[status(thm)],[c_0_12,c_0_9]) ).
cnf(c_0_19,hypothesis,
negate(add(X1,negate(add(X1,negate(add(X2,add(X1,X3))))))) = negate(add(X2,add(X1,X3))),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,hypothesis,
negate(add(negate(X1),negate(add(X1,add(negate(X1),negate(negate(X1))))))) = negate(negate(X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_15]),c_0_16]),c_0_9]),c_0_17]),c_0_9]) ).
cnf(c_0_21,hypothesis,
negate(add(negate(add(X1,X2)),negate(add(X1,add(negate(X1),X2))))) = add(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_8]),c_0_17]) ).
cnf(c_0_22,hypothesis,
negate(add(X1,add(negate(X1),negate(negate(X1))))) = negate(add(negate(X1),negate(negate(X1)))),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,hypothesis,
add(X1,negate(negate(X1))) = negate(negate(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_18]) ).
cnf(c_0_24,hypothesis,
negate(add(negate(X1),negate(add(X1,negate(X1))))) = X1,
inference(spm,[status(thm)],[c_0_7,c_0_6]) ).
cnf(c_0_25,hypothesis,
add(negate(X1),negate(add(X1,negate(X1)))) = negate(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_5]),c_0_9]),c_0_8]) ).
cnf(c_0_26,negated_conjecture,
add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))) != b,
prove_huntingtons_axiom ).
cnf(c_0_27,hypothesis,
negate(negate(X1)) = X1,
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,plain,
negate(add(negate(add(X1,X2)),negate(add(X2,negate(X1))))) = X2,
inference(spm,[status(thm)],[c_0_7,c_0_9]) ).
cnf(c_0_29,negated_conjecture,
add(negate(add(a,negate(b))),negate(add(negate(b),negate(a)))) != b,
inference(rw,[status(thm)],[c_0_26,c_0_9]) ).
cnf(c_0_30,hypothesis,
add(negate(add(X1,X2)),negate(add(X2,negate(X1)))) = negate(X2),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : ROB023-1 : TPTP v9.2.1. Released v1.0.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.16/0.33 % Computer : n022.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:52:51 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 1.91/1.93 % Version : CSE_E---1.7
% 1.91/1.93 % Problem : theBenchmark.p
% 1.91/1.93 % SZS status Unsatisfiable for theBenchmark.p
% 1.91/1.93 % SZS output start CNFRefutation
% See solution above
% 1.91/1.93 % Total time : 1.367s
%------------------------------------------------------------------------------