%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : FLD017-3 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n020.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 : Thu Sep 24 08:38:50 AM UTC 2026
% Result : Unsatisfiable 0.15s 0.44s
% Output : Proof 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 7
% Syntax : Number of clauses : 20 ( 14 unt; 0 nHn; 20 RR)
% Number of literals : 30 ( 0 equ; 12 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 10 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity_addition_2,axiom,
( ~ sum(X,V,W)
| ~ sum(Y,Z,V)
| ~ sum(X,Y,U)
| sum(U,Z,W) ),
file('FLD002-0.ax',associativity_addition_2) ).
cnf(existence_of_identity_addition,axiom,
( ~ defined(X)
| sum(additive_identity,X,X) ),
file('FLD002-0.ax',existence_of_identity_addition) ).
cnf(commutativity_addition,axiom,
( ~ sum(X,Y,Z)
| sum(Y,X,Z) ),
file('FLD002-0.ax',commutativity_addition) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('theBenchmark.p',b_is_defined) ).
cnf(sum_5,negated_conjecture,
sum(additive_identity,a,x),
file('theBenchmark.p',sum_5) ).
cnf(sum_6,negated_conjecture,
sum(a,b,c),
file('theBenchmark.p',sum_6) ).
cnf(not_sum_7,negated_conjecture,
~ sum(x,b,c),
file('theBenchmark.p',not_sum_7) ).
cnf(t1,plain,
~ sum(x,b,c),
inference(start,[status(thm),parent(0:0)],[not_sum_7]) ).
cnf(t2,plain,
( ~ sum(a,additive_identity,x)
| ~ sum(additive_identity,b,b)
| ~ sum(a,b,c)
| sum(x,b,c) ),
inference(extension,[status(thm),parent(t1:1)],[associativity_addition_2]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
sum(a,b,c),
inference(extension,[status(thm),parent(t2:2)],[sum_6]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
( ~ defined(b)
| sum(additive_identity,b,b) ),
inference(extension,[status(thm),parent(t2:3)],[existence_of_identity_addition]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t2:3]) ).
cnf(t8,plain,
defined(b),
inference(extension,[status(thm),parent(t6:2)],[b_is_defined]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t6:2]) ).
cnf(t10,plain,
( ~ sum(additive_identity,a,x)
| sum(a,additive_identity,x) ),
inference(extension,[status(thm),parent(t2:4)],[commutativity_addition]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t2:4]) ).
cnf(t12,plain,
sum(additive_identity,a,x),
inference(extension,[status(thm),parent(t10:2)],[sum_5]) ).
cnf(t13,plain,
$false,
inference(connection,[status(thm),parent(t12:1)],[t12:1,t10:2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : FLD017-3 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.03 This is a CNF_UNS_RFO_NEQ_NHN problem
% 0.00/0.04 % Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.36 % Computer : n020.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Sun Sep 20 18:52:02 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.15/0.44 % SZS status Unsatisfiable for theBenchmark
% 0.15/0.44 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------