%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : COM004-1 : TPTP v9.3.1. Released v1.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 : n017.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:14:42 AM UTC 2026
% Result : Unsatisfiable 0.08s 0.37s
% Output : Proof 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 10
% Syntax : Number of clauses : 33 ( 28 unt; 0 nHn; 30 RR)
% Number of literals : 50 ( 13 equ; 19 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 14 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(make_node,axiom,
( ~ siblings(X,Y)
| ~ contradictory(P,Q)
| ~ failure_node(Y,or(D,Q))
| ~ failure_node(X,or(C,P))
| failure_node(parent_of(X,Y),or(C,D)) ),
file('theBenchmark.p',make_node) ).
cnf(x_contradicts_not_x,axiom,
contradictory(X,negate(X)),
file('theBenchmark.p',x_contradicts_not_x) ).
cnf(n_left_and_n_right_are_siblings,axiom,
siblings(left_child_of(X),right_child_of(X)),
file('theBenchmark.p',n_left_and_n_right_are_siblings) ).
cnf(n_left_is_atom,hypothesis,
failure_node(n_left,or(empty,atom)),
file('theBenchmark.p',n_left_is_atom) ).
cnf(n_right_is_not_atom,hypothesis,
failure_node(n_right,or(empty,negate(atom))),
file('theBenchmark.p',n_right_is_not_atom) ).
cnf(n_left_equals_left_child_of_n,hypothesis,
n_left = left_child_of(n),
file('theBenchmark.p',n_left_equals_left_child_of_n) ).
cnf(n_right_equals_right_child_of_n,hypothesis,
n_right = right_child_of(n),
file('theBenchmark.p',n_right_equals_right_child_of_n) ).
cnf(goal_is_there_an_empty_node,negated_conjecture,
~ failure_node(Z,or(empty,empty)),
file('theBenchmark.p',goal_is_there_an_empty_node) ).
cnf(equality_1,axiom,
Eq_x_0 = Eq_x_0,
theory(equality,[reflexivity]) ).
cnf(equality_9,axiom,
( failure_node(Eq_y_0,Eq_y_1)
| ~ failure_node(Eq_x_0,Eq_x_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(t1,plain,
~ failure_node(parent_of(left_child_of(n),right_child_of(n)),or(empty,empty)),
inference(start,[status(thm),parent(0:0)],[goal_is_there_an_empty_node]) ).
cnf(t2,plain,
( ~ failure_node(left_child_of(n),or(empty,atom))
| ~ failure_node(right_child_of(n),or(empty,negate(atom)))
| ~ contradictory(atom,negate(atom))
| ~ siblings(left_child_of(n),right_child_of(n))
| failure_node(parent_of(left_child_of(n),right_child_of(n)),or(empty,empty)) ),
inference(extension,[status(thm),parent(t1:1)],[make_node]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
siblings(left_child_of(n),right_child_of(n)),
inference(extension,[status(thm),parent(t2:2)],[n_left_and_n_right_are_siblings]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
contradictory(atom,negate(atom)),
inference(extension,[status(thm),parent(t2:3)],[x_contradicts_not_x]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t2:3]) ).
cnf(t8,plain,
( or(empty,negate(atom)) != or(empty,negate(atom))
| ~ failure_node(n_right,or(empty,negate(atom)))
| n_right != right_child_of(n)
| failure_node(right_child_of(n),or(empty,negate(atom))) ),
inference(extension,[status(thm),parent(t2:4)],[equality_9]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t2:4]) ).
cnf(t10,plain,
n_right = right_child_of(n),
inference(extension,[status(thm),parent(t8:2)],[n_right_equals_right_child_of_n]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t8:2]) ).
cnf(t12,plain,
failure_node(n_right,or(empty,negate(atom))),
inference(extension,[status(thm),parent(t8:3)],[n_right_is_not_atom]) ).
cnf(t13,plain,
$false,
inference(connection,[status(thm),parent(t12:1)],[t12:1,t8:3]) ).
cnf(t14,plain,
or(empty,negate(atom)) = or(empty,negate(atom)),
inference(extension,[status(thm),parent(t8:4)],[equality_1]) ).
cnf(t15,plain,
$false,
inference(connection,[status(thm),parent(t14:1)],[t14:1,t8:4]) ).
cnf(t16,plain,
( or(empty,atom) != or(empty,atom)
| ~ failure_node(n_left,or(empty,atom))
| n_left != left_child_of(n)
| failure_node(left_child_of(n),or(empty,atom)) ),
inference(extension,[status(thm),parent(t2:5)],[equality_9]) ).
cnf(t17,plain,
$false,
inference(connection,[status(thm),parent(t16:1)],[t16:1,t2:5]) ).
cnf(t18,plain,
n_left = left_child_of(n),
inference(extension,[status(thm),parent(t16:2)],[n_left_equals_left_child_of_n]) ).
cnf(t19,plain,
$false,
inference(connection,[status(thm),parent(t18:1)],[t18:1,t16:2]) ).
cnf(t20,plain,
failure_node(n_left,or(empty,atom)),
inference(extension,[status(thm),parent(t16:3)],[n_left_is_atom]) ).
cnf(t21,plain,
$false,
inference(connection,[status(thm),parent(t20:1)],[t20:1,t16:3]) ).
cnf(t22,plain,
or(empty,atom) = or(empty,atom),
inference(extension,[status(thm),parent(t16:4)],[equality_1]) ).
cnf(t23,plain,
$false,
inference(connection,[status(thm),parent(t22:1)],[t22:1,t16:4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM004-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.03 This is a CNF_UNS_RFO_SEQ_HRN 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.08/0.36 % Computer : n017.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Sun Sep 20 15:25:11 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.37 % SZS status Unsatisfiable for theBenchmark
% 0.08/0.37 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------