%------------------------------------------------------------------------------
% File : Twee---2.7
% Problem : ROB022-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n009.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 12:36:12 PM UTC 2026
% Result : Unsatisfiable 5.62s 1.22s
% Output : CNFRefutation 6.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 51
% Number of leaves : 5
% Syntax : Number of clauses : 195 ( 195 unt; 0 nHn; 50 RR)
% Number of literals : 195 ( 194 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 9 ( 3 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 213 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c1,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(c2,axiom,
add(X,Y) = add(Y,X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_of_add) ).
cnf(c3,plain,
add(negate(negate(X2)),X2) = add(X2,negate(negate(X2))),
inference(substitution,[status(thm)],[c2]) ).
cnf(c4,plain,
add(X2,negate(negate(X2))) = add(negate(negate(X2)),X2),
inference(symmetry,[status(thm)],[c3]) ).
cnf(c5,plain,
negate(add(X2,negate(negate(X2)))) = negate(add(negate(negate(X2)),X2)),
inference(congruence,[status(thm)],[c4]) ).
cnf(c6,plain,
negate(negate(add(X2,negate(negate(X2))))) = negate(negate(add(negate(negate(X2)),X2))),
inference(congruence,[status(thm)],[c5]) ).
cnf(c7,plain,
add(X3,X2) = add(X2,X3),
inference(substitution,[status(thm)],[c2]) ).
cnf(c8,plain,
add(X3,X2) = add(X2,X3),
inference(symmetry,[status(thm)],[c7]) ).
cnf(c9,plain,
negate(add(X3,X2)) = negate(add(X2,X3)),
inference(congruence,[status(thm)],[c8]) ).
cnf(c10,plain,
add(negate(add(X3,X2)),negate(add(X2,negate(X3)))) = add(negate(add(X2,X3)),negate(add(X2,negate(X3)))),
inference(congruence,[status(thm)],[c9]) ).
cnf(c11,plain,
negate(add(negate(add(X3,X2)),negate(add(X2,negate(X3))))) = negate(add(negate(add(X2,X3)),negate(add(X2,negate(X3))))),
inference(congruence,[status(thm)],[c10]) ).
cnf(c12,axiom,
negate(add(negate(add(X2,Y2)),negate(add(X2,negate(Y2))))) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',robbins_axiom) ).
cnf(c13,plain,
negate(add(negate(add(X2,X3)),negate(add(X2,negate(X3))))) = X2,
inference(substitution,[status(thm)],[c12]) ).
cnf(c14,plain,
negate(add(negate(add(X3,X2)),negate(add(X2,negate(X3))))) = X2,
inference(transitivity,[status(thm)],[c11,c13]) ).
cnf(c15,plain,
negate(add(negate(add(c,add(X2,negate(c)))),negate(add(add(X2,negate(c)),negate(c))))) = add(X2,negate(c)),
inference(substitution,[status(thm)],[c14]) ).
cnf(c16,plain,
add(X2,negate(c)) = negate(add(negate(add(c,add(X2,negate(c)))),negate(add(add(X2,negate(c)),negate(c))))),
inference(symmetry,[status(thm)],[c15]) ).
cnf(c17,plain,
add(negate(c),X2) = add(X2,negate(c)),
inference(substitution,[status(thm)],[c2]) ).
cnf(c18,plain,
add(X2,negate(c)) = add(negate(c),X2),
inference(symmetry,[status(thm)],[c17]) ).
cnf(c19,plain,
add(c,add(X2,negate(c))) = add(c,add(negate(c),X2)),
inference(congruence,[status(thm)],[c18]) ).
cnf(c20,axiom,
add(add(X2,Y2),Z) = add(X2,add(Y2,Z)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associativity_of_add) ).
cnf(c21,plain,
add(add(c,negate(c)),X2) = add(c,add(negate(c),X2)),
inference(substitution,[status(thm)],[c20]) ).
cnf(c22,plain,
add(c,add(negate(c),X2)) = add(add(c,negate(c)),X2),
inference(symmetry,[status(thm)],[c21]) ).
cnf(c23,axiom,
add(c,negate(c)) = c,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',step) ).
cnf(c24,plain,
add(add(c,negate(c)),X2) = add(c,X2),
inference(congruence,[status(thm)],[c23]) ).
cnf(c25,plain,
add(c,X2) = add(X2,c),
inference(substitution,[status(thm)],[c2]) ).
cnf(c26,plain,
add(add(c,negate(c)),X2) = add(X2,c),
inference(transitivity,[status(thm)],[c24,c25]) ).
cnf(c27,plain,
add(c,add(negate(c),X2)) = add(X2,c),
inference(transitivity,[status(thm)],[c22,c26]) ).
cnf(c28,plain,
add(c,add(X2,negate(c))) = add(X2,c),
inference(transitivity,[status(thm)],[c19,c27]) ).
cnf(c29,plain,
negate(add(c,add(X2,negate(c)))) = negate(add(X2,c)),
inference(congruence,[status(thm)],[c28]) ).
cnf(c30,plain,
add(negate(add(c,add(X2,negate(c)))),negate(add(add(X2,negate(c)),negate(c)))) = add(negate(add(X2,c)),negate(add(add(X2,negate(c)),negate(c)))),
inference(congruence,[status(thm)],[c29]) ).
cnf(c31,plain,
negate(add(negate(add(c,add(X2,negate(c)))),negate(add(add(X2,negate(c)),negate(c))))) = negate(add(negate(add(X2,c)),negate(add(add(X2,negate(c)),negate(c))))),
inference(congruence,[status(thm)],[c30]) ).
cnf(c32,plain,
add(add(X2,negate(c)),negate(c)) = add(X2,add(negate(c),negate(c))),
inference(substitution,[status(thm)],[c20]) ).
cnf(c33,plain,
negate(add(add(X2,negate(c)),negate(c))) = negate(add(X2,add(negate(c),negate(c)))),
inference(congruence,[status(thm)],[c32]) ).
cnf(c34,plain,
add(negate(add(X2,c)),negate(add(add(X2,negate(c)),negate(c)))) = add(negate(add(X2,c)),negate(add(X2,add(negate(c),negate(c))))),
inference(congruence,[status(thm)],[c33]) ).
cnf(c35,plain,
negate(add(negate(add(X2,c)),negate(add(add(X2,negate(c)),negate(c))))) = negate(add(negate(add(X2,c)),negate(add(X2,add(negate(c),negate(c)))))),
inference(congruence,[status(thm)],[c34]) ).
cnf(c36,plain,
add(add(X3,X4),X2) = add(X2,add(X3,X4)),
inference(substitution,[status(thm)],[c2]) ).
cnf(c37,plain,
add(X3,add(X4,X2)) = add(add(X4,X2),X3),
inference(symmetry,[status(thm)],[c36]) ).
cnf(c38,plain,
add(add(X4,X2),X3) = add(X4,add(X2,X3)),
inference(substitution,[status(thm)],[c20]) ).
cnf(c39,plain,
add(X2,X3) = add(X3,X2),
inference(substitution,[status(thm)],[c2]) ).
cnf(c40,plain,
add(X4,add(X2,X3)) = add(X4,add(X3,X2)),
inference(congruence,[status(thm)],[c39]) ).
cnf(c41,plain,
add(add(X4,X2),X3) = add(X4,add(X3,X2)),
inference(transitivity,[status(thm)],[c38,c40]) ).
cnf(c42,plain,
add(X3,add(X4,X2)) = add(X4,add(X3,X2)),
inference(transitivity,[status(thm)],[c37,c41]) ).
cnf(c43,plain,
add(X2,add(negate(c),negate(c))) = add(negate(c),add(X2,negate(c))),
inference(substitution,[status(thm)],[c42]) ).
cnf(c44,plain,
negate(add(X2,add(negate(c),negate(c)))) = negate(add(negate(c),add(X2,negate(c)))),
inference(congruence,[status(thm)],[c43]) ).
cnf(c45,plain,
add(negate(add(X2,c)),negate(add(X2,add(negate(c),negate(c))))) = add(negate(add(X2,c)),negate(add(negate(c),add(X2,negate(c))))),
inference(congruence,[status(thm)],[c44]) ).
cnf(c46,plain,
negate(add(negate(add(X2,c)),negate(add(X2,add(negate(c),negate(c)))))) = negate(add(negate(add(X2,c)),negate(add(negate(c),add(X2,negate(c)))))),
inference(congruence,[status(thm)],[c45]) ).
cnf(c47,plain,
add(negate(c),X2) = add(X2,negate(c)),
inference(substitution,[status(thm)],[c2]) ).
cnf(c48,plain,
add(X2,negate(c)) = add(negate(c),X2),
inference(symmetry,[status(thm)],[c47]) ).
cnf(c49,plain,
add(negate(c),add(X2,negate(c))) = add(negate(c),add(negate(c),X2)),
inference(congruence,[status(thm)],[c48]) ).
cnf(c50,plain,
negate(add(negate(c),add(X2,negate(c)))) = negate(add(negate(c),add(negate(c),X2))),
inference(congruence,[status(thm)],[c49]) ).
cnf(c51,plain,
add(negate(add(X2,c)),negate(add(negate(c),add(X2,negate(c))))) = add(negate(add(X2,c)),negate(add(negate(c),add(negate(c),X2)))),
inference(congruence,[status(thm)],[c50]) ).
cnf(c52,plain,
negate(add(negate(add(X2,c)),negate(add(negate(c),add(X2,negate(c)))))) = negate(add(negate(add(X2,c)),negate(add(negate(c),add(negate(c),X2))))),
inference(congruence,[status(thm)],[c51]) ).
cnf(c53,plain,
add(negate(add(negate(c),add(negate(c),X2))),negate(add(X2,c))) = add(negate(add(X2,c)),negate(add(negate(c),add(negate(c),X2)))),
inference(substitution,[status(thm)],[c2]) ).
cnf(c54,plain,
add(negate(add(X2,c)),negate(add(negate(c),add(negate(c),X2)))) = add(negate(add(negate(c),add(negate(c),X2))),negate(add(X2,c))),
inference(symmetry,[status(thm)],[c53]) ).
cnf(c55,plain,
negate(add(negate(add(X2,c)),negate(add(negate(c),add(negate(c),X2))))) = negate(add(negate(add(negate(c),add(negate(c),X2))),negate(add(X2,c)))),
inference(congruence,[status(thm)],[c54]) ).
cnf(c56,plain,
add(X2,negate(X3)) = add(negate(X3),X2),
inference(substitution,[status(thm)],[c2]) ).
cnf(c57,plain,
add(negate(X3),X2) = add(X2,negate(X3)),
inference(symmetry,[status(thm)],[c56]) ).
cnf(c58,plain,
negate(add(negate(X3),X2)) = negate(add(X2,negate(X3))),
inference(congruence,[status(thm)],[c57]) ).
cnf(c59,plain,
add(negate(add(X3,X2)),negate(add(negate(X3),X2))) = add(negate(add(X3,X2)),negate(add(X2,negate(X3)))),
inference(congruence,[status(thm)],[c58]) ).
cnf(c60,plain,
negate(add(negate(add(X3,X2)),negate(add(negate(X3),X2)))) = negate(add(negate(add(X3,X2)),negate(add(X2,negate(X3))))),
inference(congruence,[status(thm)],[c59]) ).
cnf(c61,plain,
negate(add(negate(add(X3,X2)),negate(add(negate(X3),X2)))) = X2,
inference(transitivity,[status(thm)],[c60,c14]) ).
cnf(c62,plain,
negate(add(negate(add(c,negate(add(c,c)))),negate(add(negate(c),negate(add(c,c)))))) = negate(add(c,c)),
inference(substitution,[status(thm)],[c61]) ).
cnf(c63,plain,
negate(add(c,c)) = negate(add(negate(add(c,negate(add(c,c)))),negate(add(negate(c),negate(add(c,c)))))),
inference(symmetry,[status(thm)],[c62]) ).
cnf(c64,plain,
add(negate(add(c,c)),negate(c)) = add(negate(c),negate(add(c,c))),
inference(substitution,[status(thm)],[c2]) ).
cnf(c65,plain,
add(negate(c),negate(add(c,c))) = add(negate(add(c,c)),negate(c)),
inference(symmetry,[status(thm)],[c64]) ).
cnf(c66,plain,
negate(add(negate(c),negate(add(c,c)))) = negate(add(negate(add(c,c)),negate(c))),
inference(congruence,[status(thm)],[c65]) ).
cnf(c67,plain,
c = add(c,negate(c)),
inference(symmetry,[status(thm)],[c23]) ).
cnf(c68,plain,
negate(c) = negate(add(c,negate(c))),
inference(congruence,[status(thm)],[c67]) ).
cnf(c69,plain,
add(negate(add(c,c)),negate(c)) = add(negate(add(c,c)),negate(add(c,negate(c)))),
inference(congruence,[status(thm)],[c68]) ).
cnf(c70,plain,
negate(add(negate(add(c,c)),negate(c))) = negate(add(negate(add(c,c)),negate(add(c,negate(c))))),
inference(congruence,[status(thm)],[c69]) ).
cnf(c71,plain,
negate(add(negate(add(c,c)),negate(add(c,negate(c))))) = c,
inference(substitution,[status(thm)],[c12]) ).
cnf(c72,plain,
negate(add(negate(add(c,c)),negate(c))) = c,
inference(transitivity,[status(thm)],[c70,c71]) ).
cnf(c73,plain,
negate(add(negate(c),negate(add(c,c)))) = c,
inference(transitivity,[status(thm)],[c66,c72]) ).
cnf(c74,plain,
add(negate(add(c,negate(add(c,c)))),negate(add(negate(c),negate(add(c,c))))) = add(negate(add(c,negate(add(c,c)))),c),
inference(congruence,[status(thm)],[c73]) ).
cnf(c75,plain,
negate(add(negate(add(c,negate(add(c,c)))),negate(add(negate(c),negate(add(c,c)))))) = negate(add(negate(add(c,negate(add(c,c)))),c)),
inference(congruence,[status(thm)],[c74]) ).
cnf(c76,plain,
add(negate(add(c,c)),c) = add(c,negate(add(c,c))),
inference(substitution,[status(thm)],[c2]) ).
cnf(c77,plain,
add(c,negate(add(c,c))) = add(negate(add(c,c)),c),
inference(symmetry,[status(thm)],[c76]) ).
cnf(c78,plain,
negate(add(c,negate(add(c,c)))) = negate(add(negate(add(c,c)),c)),
inference(congruence,[status(thm)],[c77]) ).
cnf(c79,plain,
add(c,add(c,negate(c))) = add(c,c),
inference(substitution,[status(thm)],[c28]) ).
cnf(c80,plain,
add(c,c) = add(c,add(c,negate(c))),
inference(symmetry,[status(thm)],[c79]) ).
cnf(c81,plain,
negate(add(c,c)) = negate(add(c,add(c,negate(c)))),
inference(congruence,[status(thm)],[c80]) ).
cnf(c82,plain,
add(negate(add(c,c)),c) = add(negate(add(c,add(c,negate(c)))),c),
inference(congruence,[status(thm)],[c81]) ).
cnf(c83,plain,
negate(add(negate(add(c,c)),c)) = negate(add(negate(add(c,add(c,negate(c)))),c)),
inference(congruence,[status(thm)],[c82]) ).
cnf(c84,plain,
add(add(c,c),negate(c)) = add(c,add(c,negate(c))),
inference(substitution,[status(thm)],[c20]) ).
cnf(c85,plain,
add(c,add(c,negate(c))) = add(add(c,c),negate(c)),
inference(symmetry,[status(thm)],[c84]) ).
cnf(c86,plain,
negate(add(c,add(c,negate(c)))) = negate(add(add(c,c),negate(c))),
inference(congruence,[status(thm)],[c85]) ).
cnf(c87,plain,
add(negate(add(c,add(c,negate(c)))),c) = add(negate(add(add(c,c),negate(c))),c),
inference(congruence,[status(thm)],[c86]) ).
cnf(c88,plain,
negate(add(negate(add(c,add(c,negate(c)))),c)) = negate(add(negate(add(add(c,c),negate(c))),c)),
inference(congruence,[status(thm)],[c87]) ).
cnf(c89,plain,
c = negate(add(negate(c),negate(add(c,c)))),
inference(symmetry,[status(thm)],[c73]) ).
cnf(c90,plain,
add(negate(add(add(c,c),negate(c))),c) = add(negate(add(add(c,c),negate(c))),negate(add(negate(c),negate(add(c,c))))),
inference(congruence,[status(thm)],[c89]) ).
cnf(c91,plain,
negate(add(negate(add(add(c,c),negate(c))),c)) = negate(add(negate(add(add(c,c),negate(c))),negate(add(negate(c),negate(add(c,c)))))),
inference(congruence,[status(thm)],[c90]) ).
cnf(c92,plain,
negate(add(negate(add(add(c,c),negate(c))),negate(add(negate(c),negate(add(c,c)))))) = negate(c),
inference(substitution,[status(thm)],[c14]) ).
cnf(c93,plain,
negate(add(negate(add(add(c,c),negate(c))),c)) = negate(c),
inference(transitivity,[status(thm)],[c91,c92]) ).
cnf(c94,plain,
negate(add(negate(add(c,add(c,negate(c)))),c)) = negate(c),
inference(transitivity,[status(thm)],[c88,c93]) ).
cnf(c95,plain,
negate(add(negate(add(c,c)),c)) = negate(c),
inference(transitivity,[status(thm)],[c83,c94]) ).
cnf(c96,plain,
negate(add(c,negate(add(c,c)))) = negate(c),
inference(transitivity,[status(thm)],[c78,c95]) ).
cnf(c97,plain,
add(negate(add(c,negate(add(c,c)))),c) = add(negate(c),c),
inference(congruence,[status(thm)],[c96]) ).
cnf(c98,plain,
negate(add(negate(add(c,negate(add(c,c)))),c)) = negate(add(negate(c),c)),
inference(congruence,[status(thm)],[c97]) ).
cnf(c99,plain,
add(negate(c),c) = add(c,negate(c)),
inference(substitution,[status(thm)],[c2]) ).
cnf(c100,plain,
negate(add(negate(c),c)) = negate(add(c,negate(c))),
inference(congruence,[status(thm)],[c99]) ).
cnf(c101,plain,
negate(add(c,negate(c))) = negate(c),
inference(congruence,[status(thm)],[c23]) ).
cnf(c102,plain,
negate(add(negate(c),c)) = negate(c),
inference(transitivity,[status(thm)],[c100,c101]) ).
cnf(c103,plain,
negate(add(negate(add(c,negate(add(c,c)))),c)) = negate(c),
inference(transitivity,[status(thm)],[c98,c102]) ).
cnf(c104,plain,
negate(add(negate(add(c,negate(add(c,c)))),negate(add(negate(c),negate(add(c,c)))))) = negate(c),
inference(transitivity,[status(thm)],[c75,c103]) ).
cnf(c105,plain,
negate(add(c,c)) = negate(c),
inference(transitivity,[status(thm)],[c63,c104]) ).
cnf(c106,plain,
negate(c) = negate(add(c,c)),
inference(symmetry,[status(thm)],[c105]) ).
cnf(c107,plain,
add(negate(c),X2) = add(negate(add(c,c)),X2),
inference(congruence,[status(thm)],[c106]) ).
cnf(c108,plain,
add(negate(c),add(negate(c),X2)) = add(negate(c),add(negate(add(c,c)),X2)),
inference(congruence,[status(thm)],[c107]) ).
cnf(c109,plain,
negate(add(negate(c),add(negate(c),X2))) = negate(add(negate(c),add(negate(add(c,c)),X2))),
inference(congruence,[status(thm)],[c108]) ).
cnf(c110,plain,
add(negate(add(negate(c),add(negate(c),X2))),negate(add(X2,c))) = add(negate(add(negate(c),add(negate(add(c,c)),X2))),negate(add(X2,c))),
inference(congruence,[status(thm)],[c109]) ).
cnf(c111,plain,
negate(add(negate(add(negate(c),add(negate(c),X2))),negate(add(X2,c)))) = negate(add(negate(add(negate(c),add(negate(add(c,c)),X2))),negate(add(X2,c)))),
inference(congruence,[status(thm)],[c110]) ).
cnf(c112,plain,
c = negate(add(negate(c),negate(add(c,c)))),
inference(symmetry,[status(thm)],[c73]) ).
cnf(c113,plain,
add(X2,c) = add(X2,negate(add(negate(c),negate(add(c,c))))),
inference(congruence,[status(thm)],[c112]) ).
cnf(c114,plain,
negate(add(X2,c)) = negate(add(X2,negate(add(negate(c),negate(add(c,c)))))),
inference(congruence,[status(thm)],[c113]) ).
cnf(c115,plain,
add(negate(add(negate(c),add(negate(add(c,c)),X2))),negate(add(X2,c))) = add(negate(add(negate(c),add(negate(add(c,c)),X2))),negate(add(X2,negate(add(negate(c),negate(add(c,c))))))),
inference(congruence,[status(thm)],[c114]) ).
cnf(c116,plain,
negate(add(negate(add(negate(c),add(negate(add(c,c)),X2))),negate(add(X2,c)))) = negate(add(negate(add(negate(c),add(negate(add(c,c)),X2))),negate(add(X2,negate(add(negate(c),negate(add(c,c)))))))),
inference(congruence,[status(thm)],[c115]) ).
cnf(c117,plain,
add(add(X4,X3),X2) = add(X4,add(X3,X2)),
inference(substitution,[status(thm)],[c20]) ).
cnf(c118,plain,
add(X4,add(X3,X2)) = add(add(X4,X3),X2),
inference(symmetry,[status(thm)],[c117]) ).
cnf(c119,plain,
negate(add(X4,add(X3,X2))) = negate(add(add(X4,X3),X2)),
inference(congruence,[status(thm)],[c118]) ).
cnf(c120,plain,
add(negate(add(X4,add(X3,X2))),negate(add(X2,negate(add(X4,X3))))) = add(negate(add(add(X4,X3),X2)),negate(add(X2,negate(add(X4,X3))))),
inference(congruence,[status(thm)],[c119]) ).
cnf(c121,plain,
negate(add(negate(add(X4,add(X3,X2))),negate(add(X2,negate(add(X4,X3)))))) = negate(add(negate(add(add(X4,X3),X2)),negate(add(X2,negate(add(X4,X3)))))),
inference(congruence,[status(thm)],[c120]) ).
cnf(c122,plain,
negate(add(negate(add(add(X4,X3),X2)),negate(add(X2,negate(add(X4,X3)))))) = X2,
inference(substitution,[status(thm)],[c14]) ).
cnf(c123,plain,
negate(add(negate(add(X4,add(X3,X2))),negate(add(X2,negate(add(X4,X3)))))) = X2,
inference(transitivity,[status(thm)],[c121,c122]) ).
cnf(c124,plain,
negate(add(negate(add(negate(c),add(negate(add(c,c)),X2))),negate(add(X2,negate(add(negate(c),negate(add(c,c)))))))) = X2,
inference(substitution,[status(thm)],[c123]) ).
cnf(c125,plain,
negate(add(negate(add(negate(c),add(negate(add(c,c)),X2))),negate(add(X2,c)))) = X2,
inference(transitivity,[status(thm)],[c116,c124]) ).
cnf(c126,plain,
negate(add(negate(add(negate(c),add(negate(c),X2))),negate(add(X2,c)))) = X2,
inference(transitivity,[status(thm)],[c111,c125]) ).
cnf(c127,plain,
negate(add(negate(add(X2,c)),negate(add(negate(c),add(negate(c),X2))))) = X2,
inference(transitivity,[status(thm)],[c55,c126]) ).
cnf(c128,plain,
negate(add(negate(add(X2,c)),negate(add(negate(c),add(X2,negate(c)))))) = X2,
inference(transitivity,[status(thm)],[c52,c127]) ).
cnf(c129,plain,
negate(add(negate(add(X2,c)),negate(add(X2,add(negate(c),negate(c)))))) = X2,
inference(transitivity,[status(thm)],[c46,c128]) ).
cnf(c130,plain,
negate(add(negate(add(X2,c)),negate(add(add(X2,negate(c)),negate(c))))) = X2,
inference(transitivity,[status(thm)],[c35,c129]) ).
cnf(c131,plain,
negate(add(negate(add(c,add(X2,negate(c)))),negate(add(add(X2,negate(c)),negate(c))))) = X2,
inference(transitivity,[status(thm)],[c31,c130]) ).
cnf(c132,plain,
add(X2,negate(c)) = X2,
inference(transitivity,[status(thm)],[c16,c131]) ).
cnf(c133,plain,
add(negate(add(negate(negate(X2)),X2)),negate(c)) = negate(add(negate(negate(X2)),X2)),
inference(substitution,[status(thm)],[c132]) ).
cnf(c134,plain,
negate(add(negate(negate(X2)),X2)) = add(negate(add(negate(negate(X2)),X2)),negate(c)),
inference(symmetry,[status(thm)],[c133]) ).
cnf(c135,plain,
negate(negate(add(negate(negate(X2)),X2))) = negate(add(negate(add(negate(negate(X2)),X2)),negate(c))),
inference(congruence,[status(thm)],[c134]) ).
cnf(c136,plain,
add(negate(X2),negate(c)) = negate(X2),
inference(substitution,[status(thm)],[c132]) ).
cnf(c137,plain,
negate(X2) = add(negate(X2),negate(c)),
inference(symmetry,[status(thm)],[c136]) ).
cnf(c138,plain,
negate(negate(X2)) = negate(add(negate(X2),negate(c))),
inference(congruence,[status(thm)],[c137]) ).
cnf(c139,plain,
add(negate(X2),negate(negate(X2))) = add(negate(X2),negate(add(negate(X2),negate(c)))),
inference(congruence,[status(thm)],[c138]) ).
cnf(c140,plain,
negate(add(negate(X2),negate(negate(X2)))) = negate(add(negate(X2),negate(add(negate(X2),negate(c))))),
inference(congruence,[status(thm)],[c139]) ).
cnf(c141,plain,
X2 = add(X2,negate(c)),
inference(symmetry,[status(thm)],[c132]) ).
cnf(c142,plain,
negate(X2) = negate(add(X2,negate(c))),
inference(congruence,[status(thm)],[c141]) ).
cnf(c143,plain,
add(negate(X2),negate(add(negate(X2),negate(c)))) = add(negate(add(X2,negate(c))),negate(add(negate(X2),negate(c)))),
inference(congruence,[status(thm)],[c142]) ).
cnf(c144,plain,
negate(add(negate(X2),negate(add(negate(X2),negate(c))))) = negate(add(negate(add(X2,negate(c))),negate(add(negate(X2),negate(c))))),
inference(congruence,[status(thm)],[c143]) ).
cnf(c145,plain,
negate(add(negate(add(X2,negate(c))),negate(add(negate(X2),negate(c))))) = negate(c),
inference(substitution,[status(thm)],[c61]) ).
cnf(c146,plain,
negate(add(negate(X2),negate(add(negate(X2),negate(c))))) = negate(c),
inference(transitivity,[status(thm)],[c144,c145]) ).
cnf(c147,plain,
negate(add(negate(X2),negate(negate(X2)))) = negate(c),
inference(transitivity,[status(thm)],[c140,c146]) ).
cnf(c148,plain,
negate(c) = negate(add(negate(X2),negate(negate(X2)))),
inference(symmetry,[status(thm)],[c147]) ).
cnf(c149,plain,
add(negate(add(negate(negate(X2)),X2)),negate(c)) = add(negate(add(negate(negate(X2)),X2)),negate(add(negate(X2),negate(negate(X2))))),
inference(congruence,[status(thm)],[c148]) ).
cnf(c150,plain,
negate(add(negate(add(negate(negate(X2)),X2)),negate(c))) = negate(add(negate(add(negate(negate(X2)),X2)),negate(add(negate(X2),negate(negate(X2)))))),
inference(congruence,[status(thm)],[c149]) ).
cnf(c151,plain,
add(X3,negate(X2)) = add(negate(X2),X3),
inference(substitution,[status(thm)],[c2]) ).
cnf(c152,plain,
add(negate(X2),X3) = add(X3,negate(X2)),
inference(symmetry,[status(thm)],[c151]) ).
cnf(c153,plain,
negate(add(negate(X2),X3)) = negate(add(X3,negate(X2))),
inference(congruence,[status(thm)],[c152]) ).
cnf(c154,plain,
add(negate(add(X3,X2)),negate(add(negate(X2),X3))) = add(negate(add(X3,X2)),negate(add(X3,negate(X2)))),
inference(congruence,[status(thm)],[c153]) ).
cnf(c155,plain,
negate(add(negate(add(X3,X2)),negate(add(negate(X2),X3)))) = negate(add(negate(add(X3,X2)),negate(add(X3,negate(X2))))),
inference(congruence,[status(thm)],[c154]) ).
cnf(c156,plain,
negate(add(negate(add(X3,X2)),negate(add(X3,negate(X2))))) = X3,
inference(substitution,[status(thm)],[c12]) ).
cnf(c157,plain,
negate(add(negate(add(X3,X2)),negate(add(negate(X2),X3)))) = X3,
inference(transitivity,[status(thm)],[c155,c156]) ).
cnf(c158,plain,
negate(add(negate(add(negate(negate(X2)),X2)),negate(add(negate(X2),negate(negate(X2)))))) = negate(negate(X2)),
inference(substitution,[status(thm)],[c157]) ).
cnf(c159,plain,
negate(add(negate(add(negate(negate(X2)),X2)),negate(c))) = negate(negate(X2)),
inference(transitivity,[status(thm)],[c150,c158]) ).
cnf(c160,plain,
negate(negate(add(negate(negate(X2)),X2))) = negate(negate(X2)),
inference(transitivity,[status(thm)],[c135,c159]) ).
cnf(c161,plain,
negate(negate(add(X2,negate(negate(X2))))) = negate(negate(X2)),
inference(transitivity,[status(thm)],[c6,c160]) ).
cnf(c162,plain,
negate(negate(X2)) = negate(negate(add(X2,negate(negate(X2))))),
inference(symmetry,[status(thm)],[c161]) ).
cnf(c163,plain,
add(X2,negate(c)) = add(negate(c),X2),
inference(substitution,[status(thm)],[c2]) ).
cnf(c164,plain,
add(negate(c),X2) = add(X2,negate(c)),
inference(symmetry,[status(thm)],[c163]) ).
cnf(c165,plain,
add(negate(c),X2) = X2,
inference(transitivity,[status(thm)],[c164,c132]) ).
cnf(c166,plain,
add(negate(c),negate(add(X2,negate(negate(X2))))) = negate(add(X2,negate(negate(X2)))),
inference(substitution,[status(thm)],[c165]) ).
cnf(c167,plain,
negate(add(X2,negate(negate(X2)))) = add(negate(c),negate(add(X2,negate(negate(X2))))),
inference(symmetry,[status(thm)],[c166]) ).
cnf(c168,plain,
negate(negate(add(X2,negate(negate(X2))))) = negate(add(negate(c),negate(add(X2,negate(negate(X2)))))),
inference(congruence,[status(thm)],[c167]) ).
cnf(c169,plain,
negate(add(negate(add(X3,X2)),negate(add(X3,negate(X2))))) = X3,
inference(substitution,[status(thm)],[c12]) ).
cnf(c170,plain,
X3 = negate(add(negate(add(X3,X2)),negate(add(X3,negate(X2))))),
inference(symmetry,[status(thm)],[c169]) ).
cnf(c171,plain,
negate(X3) = negate(negate(add(negate(add(X3,X2)),negate(add(X3,negate(X2)))))),
inference(congruence,[status(thm)],[c170]) ).
cnf(c172,plain,
add(X3,negate(X3)) = add(X3,negate(negate(add(negate(add(X3,X2)),negate(add(X3,negate(X2))))))),
inference(congruence,[status(thm)],[c171]) ).
cnf(c173,plain,
negate(add(X3,negate(X3))) = negate(add(X3,negate(negate(add(negate(add(X3,X2)),negate(add(X3,negate(X2)))))))),
inference(congruence,[status(thm)],[c172]) ).
cnf(c174,plain,
negate(add(negate(add(X3,X2)),negate(add(X3,negate(X2))))) = X3,
inference(substitution,[status(thm)],[c12]) ).
cnf(c175,plain,
X3 = negate(add(negate(add(X3,X2)),negate(add(X3,negate(X2))))),
inference(symmetry,[status(thm)],[c174]) ).
cnf(c176,plain,
add(X3,negate(negate(add(negate(add(X3,X2)),negate(add(X3,negate(X2))))))) = add(negate(add(negate(add(X3,X2)),negate(add(X3,negate(X2))))),negate(negate(add(negate(add(X3,X2)),negate(add(X3,negate(X2))))))),
inference(congruence,[status(thm)],[c175]) ).
cnf(c177,plain,
negate(add(X3,negate(negate(add(negate(add(X3,X2)),negate(add(X3,negate(X2)))))))) = negate(add(negate(add(negate(add(X3,X2)),negate(add(X3,negate(X2))))),negate(negate(add(negate(add(X3,X2)),negate(add(X3,negate(X2)))))))),
inference(congruence,[status(thm)],[c176]) ).
cnf(c178,plain,
negate(add(negate(add(negate(add(X3,X2)),negate(add(X3,negate(X2))))),negate(negate(add(negate(add(X3,X2)),negate(add(X3,negate(X2)))))))) = negate(c),
inference(substitution,[status(thm)],[c147]) ).
cnf(c179,plain,
negate(add(X3,negate(negate(add(negate(add(X3,X2)),negate(add(X3,negate(X2)))))))) = negate(c),
inference(transitivity,[status(thm)],[c177,c178]) ).
cnf(c180,plain,
negate(add(X2,negate(X2))) = negate(c),
inference(transitivity,[status(thm)],[c173,c179]) ).
cnf(c181,plain,
negate(c) = negate(add(X2,negate(X2))),
inference(symmetry,[status(thm)],[c180]) ).
cnf(c182,plain,
add(negate(c),negate(add(X2,negate(negate(X2))))) = add(negate(add(X2,negate(X2))),negate(add(X2,negate(negate(X2))))),
inference(congruence,[status(thm)],[c181]) ).
cnf(c183,plain,
negate(add(negate(c),negate(add(X2,negate(negate(X2)))))) = negate(add(negate(add(X2,negate(X2))),negate(add(X2,negate(negate(X2)))))),
inference(congruence,[status(thm)],[c182]) ).
cnf(c184,plain,
negate(add(negate(add(X2,negate(X2))),negate(add(X2,negate(negate(X2)))))) = X2,
inference(substitution,[status(thm)],[c12]) ).
cnf(c185,plain,
negate(add(negate(c),negate(add(X2,negate(negate(X2)))))) = X2,
inference(transitivity,[status(thm)],[c183,c184]) ).
cnf(c186,plain,
negate(negate(add(X2,negate(negate(X2))))) = X2,
inference(transitivity,[status(thm)],[c168,c185]) ).
cnf(c187,plain,
negate(negate(X2)) = X2,
inference(transitivity,[status(thm)],[c162,c186]) ).
cnf(c188,plain,
negate(negate(add(negate(add(X3,negate(X2))),negate(add(negate(X3),negate(X2)))))) = add(negate(add(X3,negate(X2))),negate(add(negate(X3),negate(X2)))),
inference(substitution,[status(thm)],[c187]) ).
cnf(c189,plain,
add(negate(add(X3,negate(X2))),negate(add(negate(X3),negate(X2)))) = negate(negate(add(negate(add(X3,negate(X2))),negate(add(negate(X3),negate(X2)))))),
inference(symmetry,[status(thm)],[c188]) ).
cnf(c190,plain,
negate(add(negate(add(X3,negate(X2))),negate(add(negate(X3),negate(X2))))) = negate(X2),
inference(substitution,[status(thm)],[c61]) ).
cnf(c191,plain,
negate(negate(add(negate(add(X3,negate(X2))),negate(add(negate(X3),negate(X2)))))) = negate(negate(X2)),
inference(congruence,[status(thm)],[c190]) ).
cnf(c192,plain,
negate(negate(add(negate(add(X3,negate(X2))),negate(add(negate(X3),negate(X2)))))) = X2,
inference(transitivity,[status(thm)],[c191,c187]) ).
cnf(c193,plain,
add(negate(add(X3,negate(X2))),negate(add(negate(X3),negate(X2)))) = X2,
inference(transitivity,[status(thm)],[c189,c192]) ).
cnf(c194,plain,
add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))) = b,
inference(substitution,[status(thm)],[c193]) ).
cnf(c195,plain,
$false,
inference(resolution,[status(thm)],[c1,c194]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : ROB022-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06 % Command : run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.41 % Computer : n009.cluster.edu
% 0.14/0.41 % Model : x86_64 x86_64
% 0.14/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.41 % Memory : 8046.5625MB
% 0.14/0.41 % OS : Linux 6.8.0-71-generic
% 0.14/0.41 % CPULimit : 300
% 0.14/0.41 % WCLimit : 300
% 0.14/0.41 % DateTime : Sun Sep 27 23:27:45 UTC 2026
% 0.14/0.41 % CPUTime :
% 0.14/0.41 Running run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.62/1.22 Command-line arguments: --lhs-weight 1 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10 --complete-subsets --ground-joining-incomplete-limit 15 --flatten-every 2
% 5.62/1.22
% 5.62/1.22 % SZS status Unsatisfiable
% 5.62/1.22
% 5.62/1.24 % SZS output start CNFRefutation
% See solution above
% 6.38/1.36
% 6.38/1.36 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------