%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN326-1 : TPTP v9.3.1. Released v1.2.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 : n003.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 09:10:03 AM UTC 2026
% Result : Unsatisfiable 0.12s 0.37s
% Output : Proof 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 4
% Syntax : Number of clauses : 13 ( 7 unt; 2 nHn; 11 RR)
% Number of literals : 19 ( 0 equ; 7 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 0 con; 1-1 aty)
% Number of variables : 9 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause2,negated_conjecture,
( f(X,X)
| g(y(X)) ),
file('theBenchmark.p',clause2) ).
cnf(clause3,negated_conjecture,
( f(X,X)
| ~ h(X) ),
file('theBenchmark.p',clause3) ).
cnf(clause5,negated_conjecture,
( h(z(X))
| ~ g(X) ),
file('theBenchmark.p',clause5) ).
cnf(clause7,negated_conjecture,
~ f(z(X),z(X)),
file('theBenchmark.p',clause7) ).
cnf(t1,plain,
~ f(z(y(z(U_39))),z(y(z(U_39)))),
inference(start,[status(thm),parent(0:0)],[clause7]) ).
cnf(t2,plain,
( ~ h(z(y(z(U_39))))
| f(z(y(z(U_39))),z(y(z(U_39)))) ),
inference(extension,[status(thm),parent(t1:1)],[clause3]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
( ~ g(y(z(U_39)))
| h(z(y(z(U_39)))) ),
inference(extension,[status(thm),parent(t2:2)],[clause5]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
( f(z(U_39),z(U_39))
| g(y(z(U_39))) ),
inference(extension,[status(thm),parent(t4:2)],[clause2]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
cnf(t8,plain,
~ f(z(U_39),z(U_39)),
inference(extension,[status(thm),parent(t6:2)],[clause7]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t6:2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN326-1 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.03 This is a CNF_UNS_RFO_NEQ_NHN problem
% 0.00/0.03 % Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.34 % Computer : n003.cluster.edu
% 0.09/0.34 % Model : x86_64 x86_64
% 0.09/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.34 % Memory : 8046.5625MB
% 0.09/0.34 % OS : Linux 6.8.0-71-generic
% 0.09/0.34 % CPULimit : 300
% 0.09/0.34 % WCLimit : 300
% 0.09/0.34 % DateTime : Sun Sep 20 06:30:14 UTC 2026
% 0.09/0.34 % CPUTime :
% 0.12/0.37 % SZS status Unsatisfiable for theBenchmark
% 0.12/0.37 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------