%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : ROB030-1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n018.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 : Fri Sep 25 02:39:37 PM UTC 2026
% Result : Unsatisfiable 4.94s 1.20s
% Output : CNFRefutation 4.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of clauses : 18 ( 18 unt; 0 nHn; 10 RR)
% Number of literals : 18 ( 17 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 16 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(eg0,negated_conjecture,
negate(add(A,B)) != negate(B),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(t3,plain,
eq(negate(add(X1,X2)),negate(X2)) = efalse,
inference(equality_encoding,[status(esa)],[eg0]) ).
cnf(t22,plain,
eq(negate(add(X1,X2)),negate(X2)) = efalse,
inference(orient,[status(thm)],[t3]) ).
cnf(t2,axiom,
add(X1,X2) = add(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(t10,plain,
add(X1,X2) = add(X2,X1),
inference(orient,[status(thm)],[t2]) ).
cnf(t26,plain,
efalse = eq(negate(add(X1,X2)),negate(X1)),
inference(cp,[status(thm)],[t22,t10]) ).
cnf(t38,plain,
eq(negate(add(X1,X2)),negate(X1)) = efalse,
inference(orient,[status(thm)],[t26]) ).
cnf(t0,axiom,
add(c,d) = d,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(t50,plain,
add(d,c) = d,
inference(step,[status(thm)],[t0,t10]) ).
cnf(t18,plain,
add(d,c) = d,
inference(orient,[status(thm)],[t50]) ).
cnf(t41,plain,
efalse = eq(negate(d),negate(d)),
inference(cp,[status(thm)],[t38,t18]) ).
cnf(t1,plain,
eq(X1,X1) = etrue,
introduced(definition) ).
cnf(t21,plain,
eq(X1,X1) = etrue,
inference(orient,[status(thm)],[t1]) ).
cnf(t51,plain,
efalse = etrue,
inference(step,[status(thm)],[t41,t21]) ).
cnf(t43,plain,
efalse = etrue,
inference(orient,[status(thm)],[t51]) ).
cnf(goal_0,negated_conjecture,
etrue != efalse,
introduced(definition) ).
cnf(g0_0,plain,
etrue != etrue,
inference(rw,[status(thm)],[goal_0,t43]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ROB030-1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/0.37 % Computer : n018.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Thu Sep 24 08:31:49 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 4.94/1.20 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.94/1.20 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------