%------------------------------------------------------------------------------
% File : Twee---2.7
% Problem : COM004-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_twee /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 : Tue Sep 29 09:38:37 AM UTC 2026
% Result : Unsatisfiable 0.20s 0.27s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM004-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.19 % Computer : n020.cluster.edu
% 0.07/0.19 % Model : x86_64 x86_64
% 0.07/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.19 % Memory : 8046.5625MB
% 0.07/0.19 % OS : Linux 6.8.0-71-generic
% 0.07/0.19 % CPULimit : 300
% 0.07/0.19 % WCLimit : 300
% 0.07/0.19 % DateTime : Mon Sep 28 21:44:40 UTC 2026
% 0.07/0.19 % CPUTime :
% 0.07/0.19 Running run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.27 Command-line arguments: --lhs-weight 1 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10 --complete-subsets --ground-joining-incomplete-limit 15 --flatten-every 2
% 0.20/0.27
% 0.20/0.27 % SZS status Unsatisfiable
% 0.20/0.27
% 0.20/0.27 % SZS output start Proof
% 0.20/0.27 Axiom 1 (n_left_equals_left_child_of_n): n_left = left_child_of(n).
% 0.20/0.27 Axiom 2 (n_right_equals_right_child_of_n): n_right = right_child_of(n).
% 0.20/0.27 Axiom 3 (x_contradicts_not_x): contradictory(X, negate(X)) = true.
% 0.20/0.27 Axiom 4 (n_left_is_atom): failure_node(n_left, or(empty, atom)) = true.
% 0.20/0.27 Axiom 5 (n_right_is_not_atom): failure_node(n_right, or(empty, negate(atom))) = true.
% 0.20/0.27 Axiom 6 (ifeq_axiom): ifeq(X, X, Y, Z) = Y.
% 0.20/0.27 Axiom 7 (n_left_and_n_right_are_siblings): siblings(left_child_of(X), right_child_of(X)) = true.
% 0.20/0.27 Axiom 8 (make_node): ifeq(siblings(X, Y), true, ifeq(contradictory(Z, W), true, ifeq(failure_node(Y, or(V, W)), true, ifeq(failure_node(X, or(U, Z)), true, failure_node(parent_of(X, Y), or(U, V)), true), true), true), true) = true.
% 0.20/0.27
% 0.20/0.27 Goal 1 (goal_is_there_an_empty_node): failure_node(X, or(empty, empty)) = true.
% 0.20/0.27 The goal is true when:
% 0.20/0.27 X = parent_of(n_left, n_right)
% 0.20/0.27
% 0.20/0.27 Proof:
% 0.20/0.27 failure_node(parent_of(n_left, n_right), or(empty, empty))
% 0.20/0.27 = { by axiom 6 (ifeq_axiom) R->L }
% 0.20/0.27 ifeq(true, true, failure_node(parent_of(n_left, n_right), or(empty, empty)), true)
% 0.20/0.27 = { by axiom 6 (ifeq_axiom) R->L }
% 0.20/0.27 ifeq(true, true, ifeq(true, true, failure_node(parent_of(n_left, n_right), or(empty, empty)), true), true)
% 0.20/0.27 = { by axiom 3 (x_contradicts_not_x) R->L }
% 0.20/0.27 ifeq(contradictory(atom, negate(atom)), true, ifeq(true, true, failure_node(parent_of(n_left, n_right), or(empty, empty)), true), true)
% 0.20/0.27 = { by axiom 6 (ifeq_axiom) R->L }
% 0.20/0.27 ifeq(true, true, ifeq(contradictory(atom, negate(atom)), true, ifeq(true, true, failure_node(parent_of(n_left, n_right), or(empty, empty)), true), true), true)
% 0.20/0.27 = { by axiom 7 (n_left_and_n_right_are_siblings) R->L }
% 0.20/0.27 ifeq(siblings(left_child_of(n), right_child_of(n)), true, ifeq(contradictory(atom, negate(atom)), true, ifeq(true, true, failure_node(parent_of(n_left, n_right), or(empty, empty)), true), true), true)
% 0.20/0.27 = { by axiom 1 (n_left_equals_left_child_of_n) R->L }
% 0.20/0.27 ifeq(siblings(n_left, right_child_of(n)), true, ifeq(contradictory(atom, negate(atom)), true, ifeq(true, true, failure_node(parent_of(n_left, n_right), or(empty, empty)), true), true), true)
% 0.20/0.27 = { by axiom 2 (n_right_equals_right_child_of_n) R->L }
% 0.20/0.27 ifeq(siblings(n_left, n_right), true, ifeq(contradictory(atom, negate(atom)), true, ifeq(true, true, failure_node(parent_of(n_left, n_right), or(empty, empty)), true), true), true)
% 0.20/0.27 = { by axiom 5 (n_right_is_not_atom) R->L }
% 0.20/0.27 ifeq(siblings(n_left, n_right), true, ifeq(contradictory(atom, negate(atom)), true, ifeq(failure_node(n_right, or(empty, negate(atom))), true, failure_node(parent_of(n_left, n_right), or(empty, empty)), true), true), true)
% 0.20/0.27 = { by axiom 6 (ifeq_axiom) R->L }
% 0.20/0.27 ifeq(siblings(n_left, n_right), true, ifeq(contradictory(atom, negate(atom)), true, ifeq(failure_node(n_right, or(empty, negate(atom))), true, ifeq(true, true, failure_node(parent_of(n_left, n_right), or(empty, empty)), true), true), true), true)
% 0.20/0.27 = { by axiom 4 (n_left_is_atom) R->L }
% 0.20/0.27 ifeq(siblings(n_left, n_right), true, ifeq(contradictory(atom, negate(atom)), true, ifeq(failure_node(n_right, or(empty, negate(atom))), true, ifeq(failure_node(n_left, or(empty, atom)), true, failure_node(parent_of(n_left, n_right), or(empty, empty)), true), true), true), true)
% 0.20/0.27 = { by axiom 8 (make_node) }
% 0.20/0.27 true
% 0.20/0.27 % SZS output end Proof
% 0.20/0.27
% 0.20/0.27 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------