%------------------------------------------------------------------------------
% File : Twee---2.7
% Problem : ROB013-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n006.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:11 PM UTC 2026
% Result : Unsatisfiable 0.18s 0.46s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of clauses : 15 ( 15 unt; 0 nHn; 13 RR)
% Number of literals : 15 ( 14 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 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 : 4 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c1,negated_conjecture,
negate(add(c,negate(add(negate(b),a)))) != a,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_result) ).
cnf(c2,axiom,
add(X,Y) = add(Y,X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_of_add) ).
cnf(c3,plain,
add(negate(b),a) = add(a,negate(b)),
inference(substitution,[status(thm)],[c2]) ).
cnf(c4,plain,
negate(add(negate(b),a)) = negate(add(a,negate(b))),
inference(congruence,[status(thm)],[c3]) ).
cnf(c5,plain,
add(c,negate(add(negate(b),a))) = add(c,negate(add(a,negate(b)))),
inference(congruence,[status(thm)],[c4]) ).
cnf(c6,plain,
negate(add(c,negate(add(negate(b),a)))) = negate(add(c,negate(add(a,negate(b))))),
inference(congruence,[status(thm)],[c5]) ).
cnf(c7,axiom,
negate(add(a,b)) = c,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',step) ).
cnf(c8,plain,
c = negate(add(a,b)),
inference(symmetry,[status(thm)],[c7]) ).
cnf(c9,plain,
add(c,negate(add(a,negate(b)))) = add(negate(add(a,b)),negate(add(a,negate(b)))),
inference(congruence,[status(thm)],[c8]) ).
cnf(c10,plain,
negate(add(c,negate(add(a,negate(b))))) = negate(add(negate(add(a,b)),negate(add(a,negate(b))))),
inference(congruence,[status(thm)],[c9]) ).
cnf(c11,axiom,
negate(add(negate(add(X2,Y2)),negate(add(X2,negate(Y2))))) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',robbins_axiom) ).
cnf(c12,plain,
negate(add(negate(add(a,b)),negate(add(a,negate(b))))) = a,
inference(substitution,[status(thm)],[c11]) ).
cnf(c13,plain,
negate(add(c,negate(add(a,negate(b))))) = a,
inference(transitivity,[status(thm)],[c10,c12]) ).
cnf(c14,plain,
negate(add(c,negate(add(negate(b),a)))) = a,
inference(transitivity,[status(thm)],[c6,c13]) ).
cnf(c15,plain,
$false,
inference(resolution,[status(thm)],[c1,c14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ROB013-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.39 % Computer : n006.cluster.edu
% 0.10/0.39 % Model : x86_64 x86_64
% 0.10/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.39 % Memory : 8046.5625MB
% 0.10/0.39 % OS : Linux 6.8.0-71-generic
% 0.10/0.39 % CPULimit : 300
% 0.10/0.39 % WCLimit : 300
% 0.10/0.39 % DateTime : Sun Sep 27 23:26:26 UTC 2026
% 0.10/0.39 % CPUTime :
% 0.10/0.39 Running run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.46 Command-line arguments: --lhs-weight 9 --flip-ordering --complete-subsets --normalise-queue-percent 10 --cp-renormalise-threshold 10
% 0.18/0.46
% 0.18/0.46 % SZS status Unsatisfiable
% 0.18/0.46
% 0.18/0.46 % SZS output start CNFRefutation
% See solution above
% 0.18/0.47
% 0.18/0.47 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------