%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : ROB010-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n005.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:35 PM UTC 2026
% Result : Unsatisfiable 2.57s 0.79s
% Output : CNFRefutation 2.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of clauses : 12 ( 12 unt; 0 nHn; 8 RR)
% Number of literals : 12 ( 11 equ; 5 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 : 8 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(t0,axiom,
add(X1,X2) = add(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(t8,plain,
add(X1,X2) = add(X2,X1),
inference(orient,[status(thm)],[t0]) ).
cnf(t1,axiom,
negate(add(a,negate(b))) = c,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(t16,plain,
negate(add(a,negate(b))) = c,
inference(orient,[status(thm)],[t1]) ).
cnf(t3,axiom,
negate(add(negate(add(X1,X2)),negate(add(X1,negate(X2))))) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(t4,plain,
negate(add(negate(add(X1,X2)),negate(add(X1,negate(X2))))) = X1,
inference(orient,[status(thm)],[t3]) ).
cnf(goal_0,negated_conjecture,
negate(add(c,negate(add(b,a)))) != a,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(g0_0,plain,
negate(add(c,negate(add(b,a)))) != negate(add(c,negate(add(a,b)))),
inference(rw,[status(thm)],[goal_0,t8]) ).
cnf(g0_1,plain,
negate(add(c,negate(add(b,a)))) != negate(add(negate(add(a,b)),c)),
inference(rw,[status(thm)],[g0_0,t8]) ).
cnf(g0_2,plain,
negate(add(c,negate(add(b,a)))) != negate(add(negate(add(a,b)),negate(add(a,negate(b))))),
inference(rw,[status(thm)],[g0_1,t16]) ).
cnf(g0_3,plain,
negate(add(c,negate(add(b,a)))) != a,
inference(rw,[status(thm)],[g0_2,t4]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ROB010-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/0.36 % Computer : n005.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Thu Sep 24 08:26:02 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 2.57/0.79 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.57/0.79 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------