%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : COM004-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n013.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 01:04:15 PM UTC 2026
% Result : Unsatisfiable 1.73s 11.31s
% Output : CNFRefutation 1.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 26 ( 17 unt; 1 def)
% Number of atoms : 55 ( 7 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 55 ( 29 ~; 26 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 2 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 41 ( 0 sgn 41 !; 0 ?; 32 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X3,X0,X1,X4,X5] :
( ~ siblings(X0,X1)
| ~ contradictory(X4,X5)
| ~ failure_node(X1,or(X3,X5))
| ~ failure_node(X0,or(X2,X4))
| failure_node(parent_of(X0,X1),or(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',make_node) ).
fof(f3,axiom,
! [X0] : contradictory(X0,negate(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x_contradicts_not_x) ).
fof(f4,axiom,
! [X0] : siblings(left_child_of(X0),right_child_of(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',n_left_and_n_right_are_siblings) ).
fof(f5,axiom,
failure_node(n_left,or(empty,atom)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',n_left_is_atom) ).
fof(f6,axiom,
failure_node(n_right,or(empty,negate(atom))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',n_right_is_not_atom) ).
fof(f7,axiom,
n_left = left_child_of(n),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',n_left_equals_left_child_of_n) ).
fof(f8,axiom,
n_right = right_child_of(n),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',n_right_equals_right_child_of_n) ).
fof(f9,negated_conjecture,
! [X0] : ~ failure_node(X0,or(empty,empty)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal_is_there_an_empty_node) ).
tcf(c_58,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] :
( failure_node(parent_of(X0,X3),or(X1,X4))
| ~ siblings(X0,X3)
| ~ contradictory(X2,X5)
| ~ failure_node(X3,or(X4,X5))
| ~ failure_node(X0,or(X1,X2)) ),
inference(cnf_transformation,[],[f1]) ).
tcf(c_60,plain,
! [X0: $i] : contradictory(X0,negate(X0)),
inference(cnf_transformation,[],[f3]) ).
tcf(c_61,plain,
! [X0: $i] : siblings(left_child_of(X0),right_child_of(X0)),
inference(cnf_transformation,[],[f4]) ).
tcf(c_62,plain,
failure_node(n_left,or(empty,atom)),
inference(cnf_transformation,[],[f5]) ).
tcf(c_63,plain,
failure_node(n_right,or(empty,negate(atom))),
inference(cnf_transformation,[],[f6]) ).
tcf(c_64,plain,
left_child_of(n) = n_left,
inference(cnf_transformation,[],[f7]) ).
tcf(c_65,plain,
right_child_of(n) = n_right,
inference(cnf_transformation,[],[f8]) ).
tcf(c_66,negated_conjecture,
! [X0: $i] : ~ failure_node(X0,or(empty,empty)),
inference(cnf_transformation,[],[f9]) ).
tcf(c_112,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i,X6: $i] :
( failure_node(parent_of(X1,X2),or(X3,X5))
| ~ contradictory(X4,X6)
| ~ failure_node(X2,or(X5,X6))
| ~ failure_node(X1,or(X3,X4))
| ( right_child_of(X0) != X2 )
| ( left_child_of(X0) != X1 ) ),
inference(resolution_lifted,[status(thm)],[c_58,c_61]) ).
tcf(c_113,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( failure_node(parent_of(left_child_of(X0),right_child_of(X0)),or(X1,X3))
| ~ contradictory(X2,X4)
| ~ failure_node(right_child_of(X0),or(X3,X4))
| ~ failure_node(left_child_of(X0),or(X1,X2)) ),
inference(unflattening,[status(thm)],[c_112]) ).
tcf(c_225,definition,
iPr_def_10 = or(empty,empty),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_226,negated_conjecture,
! [X0: $i] : ~ failure_node(X0,iPr_def_10),
inference(demodulation,[status(thm)],[c_66,c_225]) ).
tcf(c_395,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( failure_node(parent_of(left_child_of(n),right_child_of(n)),or(X2,X0))
| ~ contradictory(X3,X1)
| ~ failure_node(n_left,or(X2,X3))
| ~ failure_node(right_child_of(n),or(X0,X1)) ),
inference(superposition,[status(thm)],[c_64,c_113]) ).
tcf(c_397,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( failure_node(parent_of(n_left,n_right),or(X0,X2))
| ~ contradictory(X1,X3)
| ~ failure_node(n_right,or(X2,X3))
| ~ failure_node(n_left,or(X0,X1)) ),
inference(light_normalisation,[status(thm)],[c_395,c_64,c_65]) ).
tcf(c_411,plain,
! [X0: $i,X1: $i] :
( failure_node(parent_of(n_left,n_right),or(empty,X0))
| ~ contradictory(atom,X1)
| ~ failure_node(n_right,or(X0,X1)) ),
inference(superposition,[status(thm)],[c_62,c_397]) ).
tcf(c_423,plain,
( failure_node(parent_of(n_left,n_right),or(empty,empty))
| ~ contradictory(atom,negate(atom)) ),
inference(superposition,[status(thm)],[c_63,c_411]) ).
tcf(c_425,plain,
( failure_node(parent_of(n_left,n_right),iPr_def_10)
| ~ contradictory(atom,negate(atom)) ),
inference(light_normalisation,[status(thm)],[c_423,c_225]) ).
tcf(c_426,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_425,c_226,c_60]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM004-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/10.39 % Computer : n013.cluster.edu
% 0.10/10.39 % Model : x86_64 x86_64
% 0.10/10.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/10.39 % Memory : 8046.5625MB
% 0.10/10.39 % OS : Linux 6.8.0-71-generic
% 0.10/10.39 % CPULimit : 300
% 0.10/10.39 % WCLimit : 300
% 0.10/10.39 % DateTime : Fri Sep 25 07:43:47 UTC 2026
% 0.14/10.40 % CPUTime :
% 0.14/10.40 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/10.44 Running first-order theorem proving
% 0.14/10.44 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/10.45
% 0.14/10.45 % ======== iProver multi-core TPTP/SMT =========
% 0.14/10.45
% 0.14/10.45 % Detected problem language: tptp
% 0.14/10.46 % Proving...
% 1.73/11.31 % SZS status Started for theBenchmark.p
% 1.73/11.31 % SZS status Unsatisfiable for theBenchmark.p
% 1.73/11.31
% 1.73/11.31 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.73/11.31
% 1.73/11.31 % ------ iProver source info
% 1.73/11.31
% 1.73/11.31 % git: date: 2026-07-19 20:42:38 +0200
% 1.73/11.31 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.73/11.31 % git: non_committed_changes: false
% 1.73/11.31
% 1.73/11.31 % ------ Parsing...% successful
% 1.73/11.31
% 1.73/11.31
% 1.73/11.31 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.73/11.31
% 1.73/11.31 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e %
% 1.73/11.31
% 1.73/11.31 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.73/11.31
% 1.73/11.31 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.73/11.31 % ------ Proving...
% 1.73/11.31 % ------ Problem Properties
% 1.73/11.31
% 1.73/11.31 %
% 1.73/11.31 % clauses 9
% 1.73/11.31 % conjectures 1
% 1.73/11.31 % EPR 1
% 1.73/11.31 % Horn 9
% 1.73/11.31 % unary 8
% 1.73/11.31 % binary 0
% 1.73/11.31 % lits 12
% 1.73/11.31 % lits eq 3
% 1.73/11.31 % fd_pure 0
% 1.73/11.31 % fd_pseudo 0
% 1.73/11.31 % fd_cond 0
% 1.73/11.31 % fd_pseudo_cond 0
% 1.73/11.31 % AC symbols 0
% 1.73/11.31
% 1.73/11.31 % ------ Schedule dynamic 5 is on
% 1.73/11.31
% 1.73/11.31 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.73/11.31
% 1.73/11.31
% 1.73/11.31 % ------
% 1.73/11.31 % Current options:
% 1.73/11.31 % ------
% 1.73/11.31
% 1.73/11.31
% 1.73/11.31 %
% 1.73/11.31
% 1.73/11.31 % ------ Proving...
% 1.73/11.31 %
% 1.73/11.31
% 1.73/11.31 % SZS status Unsatisfiable for theBenchmark.p
% 1.73/11.31
% 1.73/11.31 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.73/11.31
% 1.73/11.31
%------------------------------------------------------------------------------