%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : PRO010+4 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n010.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 02:31:35 PM UTC 2026
% Result : Theorem 4.13s 1.26s
% Output : CNFRefutation 4.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 6
% Syntax : Number of formulae : 56 ( 7 unt; 1 def)
% Number of atoms : 218 ( 9 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 242 ( 80 ~; 80 |; 71 &)
% ( 3 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 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 : 11 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-2 aty)
% Number of variables : 134 ( 0 sgn 100 !; 34 ?; 25 :)
% Comments :
%------------------------------------------------------------------------------
fof(f9,axiom,
! [X0,X1,X2] :
( ( occurrence_of(X0,X2)
& occurrence_of(X0,X1) )
=> X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_08) ).
fof(f16,axiom,
! [X0,X1] :
( leaf(X0,X1)
<=> ( ~ ? [X3] : min_precedes(X0,X3,X1)
& ( ? [X2] : min_precedes(X2,X0,X1)
| root(X0,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_15) ).
fof(f19,axiom,
! [X0,X1] :
( leaf_occ(X0,X1)
<=> ? [X2] :
( leaf(X0,X2)
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_18) ).
fof(f33,axiom,
! [X0] :
( occurrence_of(X0,tptp0)
=> ? [X1,X2,X3] :
( leaf_occ(X3,X0)
& next_subocc(X2,X3,tptp0)
& ( occurrence_of(X3,tptp2)
| occurrence_of(X3,tptp1) )
& next_subocc(X1,X2,tptp0)
& occurrence_of(X2,tptp4)
& root_occ(X1,X0)
& occurrence_of(X1,tptp3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_32) ).
fof(f46,conjecture,
! [X0] :
( occurrence_of(X0,tptp0)
=> ? [X1,X2] :
( ( occurrence_of(X2,tptp2)
=> ~ ? [X4] :
( min_precedes(X1,X4,tptp0)
& occurrence_of(X4,tptp1) ) )
& ( occurrence_of(X2,tptp1)
=> ~ ? [X3] :
( min_precedes(X1,X3,tptp0)
& occurrence_of(X3,tptp2) ) )
& leaf_occ(X2,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f47,negated_conjecture,
~ ! [X0] :
( occurrence_of(X0,tptp0)
=> ? [X1,X2] :
( ( occurrence_of(X2,tptp2)
=> ~ ? [X4] :
( min_precedes(X1,X4,tptp0)
& occurrence_of(X4,tptp1) ) )
& ( occurrence_of(X2,tptp1)
=> ~ ? [X3] :
( min_precedes(X1,X3,tptp0)
& occurrence_of(X3,tptp2) ) )
& leaf_occ(X2,X0) ) ),
inference(negated_conjecture,[status(cth)],[f46]) ).
fof(f67,plain,
! [X0,X1,X2] :
( ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1)
| X1 = X2 ),
inference(ennf_transformation,[],[f9]) ).
fof(f68,plain,
! [X0,X1,X2] :
( ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1)
| X1 = X2 ),
inference(flattening,[],[f67]) ).
fof(f77,plain,
! [X0,X1] :
( leaf(X0,X1)
<=> ( ! [X3] : ~ min_precedes(X0,X3,X1)
& ( ? [X2] : min_precedes(X2,X0,X1)
| root(X0,X1) ) ) ),
inference(ennf_transformation,[],[f16]) ).
fof(f96,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| ? [X1,X2,X3] :
( leaf_occ(X3,X0)
& next_subocc(X2,X3,tptp0)
& ( occurrence_of(X3,tptp2)
| occurrence_of(X3,tptp1) )
& next_subocc(X1,X2,tptp0)
& occurrence_of(X2,tptp4)
& root_occ(X1,X0)
& occurrence_of(X1,tptp3) ) ),
inference(ennf_transformation,[],[f33]) ).
fof(f97,plain,
? [X0] :
( occurrence_of(X0,tptp0)
& ! [X1,X2] :
( ( occurrence_of(X2,tptp2)
& ? [X4] :
( min_precedes(X1,X4,tptp0)
& occurrence_of(X4,tptp1) ) )
| ( occurrence_of(X2,tptp1)
& ? [X3] :
( min_precedes(X1,X3,tptp0)
& occurrence_of(X3,tptp2) ) )
| ~ leaf_occ(X2,X0) ) ),
inference(ennf_transformation,[],[f47]) ).
fof(f106,plain,
! [X0,X1] :
( ( ~ leaf(X0,X1)
| ( ! [X3] : ~ min_precedes(X0,X3,X1)
& ( ? [X2] : min_precedes(X2,X0,X1)
| root(X0,X1) ) ) )
& ( ? [X3] : min_precedes(X0,X3,X1)
| ( ! [X2] : ~ min_precedes(X2,X0,X1)
& ~ root(X0,X1) )
| leaf(X0,X1) ) ),
inference(nnf_transformation,[],[f77]) ).
fof(f107,plain,
! [X0,X1] :
( ( ~ leaf(X0,X1)
| ( ! [X3] : ~ min_precedes(X0,X3,X1)
& ( ? [X2] : min_precedes(X2,X0,X1)
| root(X0,X1) ) ) )
& ( ? [X3] : min_precedes(X0,X3,X1)
| ( ! [X2] : ~ min_precedes(X2,X0,X1)
& ~ root(X0,X1) )
| leaf(X0,X1) ) ),
inference(flattening,[],[f106]) ).
fof(f108,plain,
! [X0,X1] :
( ( ~ leaf(X0,X1)
| ( ! [X5] : ~ min_precedes(X0,X5,X1)
& ( ? [X4] : min_precedes(X4,X0,X1)
| root(X0,X1) ) ) )
& ( ? [X3] : min_precedes(X0,X3,X1)
| ( ! [X2] : ~ min_precedes(X2,X0,X1)
& ~ root(X0,X1) )
| leaf(X0,X1) ) ),
inference(rectify,[],[f107]) ).
fof(f109,plain,
! [X0,X1] :
( ( ~ leaf(X0,X1)
| ( ! [X5] : ~ min_precedes(X0,X5,X1)
& ( min_precedes(sK8(X0,X1),X0,X1)
| root(X0,X1) ) ) )
& ( min_precedes(X0,sK7(X0,X1),X1)
| ( ! [X2] : ~ min_precedes(X2,X0,X1)
& ~ root(X0,X1) )
| leaf(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7,sK8]),skolemize(X3,sK7(X0,X1)),skolemize(X4,sK8(X0,X1))],[f108]) ).
fof(f111,plain,
! [X0,X1] :
( ( ~ leaf_occ(X0,X1)
| ? [X2] :
( leaf(X0,X2)
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,X2) ) )
& ( ! [X2] :
( ~ leaf(X0,X2)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,X2) )
| leaf_occ(X0,X1) ) ),
inference(nnf_transformation,[],[f19]) ).
fof(f112,plain,
! [X0,X1] :
( ( ~ leaf_occ(X0,X1)
| ? [X3] :
( leaf(X0,X3)
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,X3) ) )
& ( ! [X2] :
( ~ leaf(X0,X2)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,X2) )
| leaf_occ(X0,X1) ) ),
inference(rectify,[],[f111]) ).
fof(f113,plain,
! [X0,X1] :
( ( ~ leaf_occ(X0,X1)
| ( leaf(X0,sK9(X0,X1))
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,sK9(X0,X1)) ) )
& ( ! [X2] :
( ~ leaf(X0,X2)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,X2) )
| leaf_occ(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9]),skolemize(X3,sK9(X0,X1))],[f112]) ).
fof(f124,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| ( leaf_occ(sK15(X0),X0)
& next_subocc(sK14(X0),sK15(X0),tptp0)
& ( occurrence_of(sK15(X0),tptp2)
| occurrence_of(sK15(X0),tptp1) )
& next_subocc(sK13(X0),sK14(X0),tptp0)
& occurrence_of(sK14(X0),tptp4)
& root_occ(sK13(X0),X0)
& occurrence_of(sK13(X0),tptp3) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK13,sK14,sK15]),skolemize(X1,sK13(X0)),skolemize(X2,sK14(X0)),skolemize(X3,sK15(X0))],[f96]) ).
fof(f128,plain,
( occurrence_of(sK17,tptp0)
& ! [X1,X2] :
( sP0(X1,X2)
| ( occurrence_of(X2,tptp1)
& min_precedes(X1,sK18(X1),tptp0)
& occurrence_of(sK18(X1),tptp2) )
| ~ leaf_occ(X2,sK17) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK17,sK18]),skolemize(X0,sK17),skolemize(X3,sK18(X1))],[f99]) ).
fof(f141,plain,
! [X2,X0,X1] :
( ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1)
| X1 = X2 ),
inference(cnf_transformation,[],[f68]) ).
fof(f150,plain,
! [X0,X1,X5] :
( ~ leaf(X0,X1)
| ~ min_precedes(X0,X5,X1) ),
inference(cnf_transformation,[],[f109]) ).
fof(f157,plain,
! [X0,X1] :
( ~ leaf_occ(X0,X1)
| leaf(X0,sK9(X0,X1)) ),
inference(cnf_transformation,[],[f113]) ).
fof(f159,plain,
! [X0,X1] :
( ~ leaf_occ(X0,X1)
| occurrence_of(X1,sK9(X0,X1)) ),
inference(cnf_transformation,[],[f113]) ).
fof(f184,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| leaf_occ(sK15(X0),X0) ),
inference(cnf_transformation,[],[f124]) ).
fof(f205,plain,
occurrence_of(sK17,tptp0),
inference(cnf_transformation,[],[f128]) ).
fof(f207,plain,
! [X2,X1] :
( sP0(X1,X2)
| min_precedes(X1,sK18(X1),tptp0)
| ~ leaf_occ(X2,sK17) ),
inference(cnf_transformation,[],[f128]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X1 = X2 )
| ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1) ),
inference(cnf_transformation,[],[f141]) ).
tcf(c_73,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ leaf(X0,X2)
| ~ min_precedes(X0,X1,X2) ),
inference(cnf_transformation,[],[f150]) ).
tcf(c_78,plain,
! [X0: $i,X1: $i] :
( occurrence_of(X1,sK9(X0,X1))
| ~ leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f159]) ).
tcf(c_80,plain,
! [X0: $i,X1: $i] :
( leaf(X0,sK9(X0,X1))
| ~ leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f157]) ).
tcf(c_110,plain,
! [X0: $i] :
( leaf_occ(sK15(X0),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f184]) ).
tcf(c_126,negated_conjecture,
! [X0: $i,X1: $i] :
( sP0(X1,X0)
| min_precedes(X1,sK18(X1),tptp0)
| ~ leaf_occ(X0,sK17) ),
inference(cnf_transformation,[],[f207]) ).
tcf(c_128,negated_conjecture,
occurrence_of(sK17,tptp0),
inference(cnf_transformation,[],[f205]) ).
tcf(c_4324,negated_conjecture,
occurrence_of(sK17,tptp0),
inference(demodulation,[status(thm)],[c_128]) ).
tcf(c_4326,negated_conjecture,
! [X0: $i,X1: $i] :
( sP0(X1,X0)
| min_precedes(X1,sK18(X1),tptp0)
| ~ leaf_occ(X0,sK17) ),
inference(demodulation,[status(thm)],[c_126]) ).
tcf(c_5654,plain,
! [X0: $i,X1: $i] :
( sP0(X1,X0)
| ~ leaf(X1,tptp0)
| ~ leaf_occ(X0,sK17) ),
inference(superposition,[status(thm)],[c_4326,c_73]) ).
tcf(c_5741,plain,
! [X0: $i] :
( sP0(X0,sK15(sK17))
| ~ occurrence_of(sK17,tptp0)
| ~ leaf(X0,tptp0) ),
inference(superposition,[status(thm)],[c_110,c_5654]) ).
tcf(c_5742,plain,
! [X0: $i] :
( sP0(X0,sK15(sK17))
| ~ leaf(X0,tptp0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_5741,c_4324]) ).
tcf(c_6052,plain,
( leaf_occ(sK15(sK17),sK17)
| ~ occurrence_of(sK17,tptp0) ),
inference(instantiation,[status(thm)],[c_110]) ).
tcf(c_6847,plain,
! [X0: $i] :
( ( X0 = tptp0 )
| ~ occurrence_of(sK17,X0) ),
inference(superposition,[status(thm)],[c_4324,c_61]) ).
tcf(c_7099,plain,
! [X0: $i] :
( ( sK9(X0,sK17) = tptp0 )
| ~ leaf_occ(X0,sK17) ),
inference(superposition,[status(thm)],[c_78,c_6847]) ).
tcf(c_7173,plain,
( ( sK9(sK15(sK17),sK17) = tptp0 )
| ~ occurrence_of(sK17,tptp0) ),
inference(superposition,[status(thm)],[c_110,c_7099]) ).
tcf(c_7174,plain,
sK9(sK15(sK17),sK17) = tptp0,
inference(forward_subsumption_resolution,[status(thm)],[c_7173,c_4324]) ).
tcf(c_7175,plain,
( leaf(sK15(sK17),tptp0)
| ~ leaf_occ(sK15(sK17),sK17) ),
inference(superposition,[status(thm)],[c_7174,c_80]) ).
fof(f98,definition,
! [X1,X2] :
( ~ sP0(X1,X2)
| ( occurrence_of(X2,tptp2)
& ? [X4] :
( min_precedes(X1,X4,tptp0)
& occurrence_of(X4,tptp1) ) ) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f99,plain,
? [X0] :
( occurrence_of(X0,tptp0)
& ! [X1,X2] :
( sP0(X1,X2)
| ( occurrence_of(X2,tptp1)
& ? [X3] :
( min_precedes(X1,X3,tptp0)
& occurrence_of(X3,tptp2) ) )
| ~ leaf_occ(X2,X0) ) ),
inference(definition_folding,[],[f97,f98]) ).
fof(f125,plain,
! [X1,X2] :
( ~ sP0(X1,X2)
| ( occurrence_of(X2,tptp2)
& ? [X4] :
( min_precedes(X1,X4,tptp0)
& occurrence_of(X4,tptp1) ) ) ),
inference(nnf_transformation,[],[f98]) ).
fof(f126,plain,
! [X0,X1] :
( ~ sP0(X0,X1)
| ( occurrence_of(X1,tptp2)
& ? [X2] :
( min_precedes(X0,X2,tptp0)
& occurrence_of(X2,tptp1) ) ) ),
inference(rectify,[],[f125]) ).
fof(f127,plain,
! [X0,X1] :
( ~ sP0(X0,X1)
| ( occurrence_of(X1,tptp2)
& min_precedes(X0,sK16(X0),tptp0)
& occurrence_of(sK16(X0),tptp1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK16]),skolemize(X2,sK16(X0))],[f126]) ).
fof(f203,plain,
! [X0,X1] :
( ~ sP0(X0,X1)
| min_precedes(X0,sK16(X0),tptp0) ),
inference(cnf_transformation,[],[f127]) ).
tcf(c_123,plain,
! [X0: $i,X1: $i] :
( min_precedes(X0,sK16(X0),tptp0)
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f203]) ).
tcf(c_6021,plain,
! [X0: $i] :
( min_precedes(X0,sK16(X0),tptp0)
| ~ leaf(X0,tptp0) ),
inference(superposition,[status(thm)],[c_5742,c_123]) ).
tcf(c_6416,plain,
! [X0: $i] : ~ leaf(X0,tptp0),
inference(forward_subsumption_resolution,[status(thm)],[c_6021,c_73]) ).
tcf(c_7177,plain,
~ leaf_occ(sK15(sK17),sK17),
inference(forward_subsumption_resolution,[status(thm)],[c_7175,c_6416]) ).
tcf(c_7178,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_7177,c_6052,c_128]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PRO010+4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.35 % Computer : n010.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Thu Sep 24 06:29:44 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.10/0.35 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.38 Running first-order theorem proving
% 0.13/0.38 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.39
% 0.13/0.39 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.39
% 0.13/0.39 % Detected problem language: tptp
% 0.13/0.40 % Proving...
% 4.13/1.26 % SZS status Started for theBenchmark.p
% 4.13/1.26 % SZS status Theorem for theBenchmark.p
% 4.13/1.26
% 4.13/1.26 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.13/1.26
% 4.13/1.26 % ------ iProver source info
% 4.13/1.26
% 4.13/1.26 % git: date: 2026-07-19 20:42:38 +0200
% 4.13/1.26 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.13/1.26 % git: non_committed_changes: false
% 4.13/1.26
% 4.13/1.26 % ------ Parsing...
% 4.13/1.26 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.13/1.26
% 4.13/1.26 % ------ 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 %
% 4.13/1.26
% 4.13/1.26 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.13/1.26
% 4.13/1.26 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.13/1.26 % ------ Proving...
% 4.13/1.26 % ------ Problem Properties
% 4.13/1.26
% 4.13/1.26 %
% 4.13/1.26 % clauses 79
% 4.13/1.26 % conjectures 4
% 4.13/1.26 % EPR 47
% 4.13/1.26 % Horn 62
% 4.13/1.26 % unary 12
% 4.13/1.26 % binary 37
% 4.13/1.26 % lits 195
% 4.13/1.26 % lits eq 12
% 4.13/1.26 % fd_pure 0
% 4.13/1.26 % fd_pseudo 0
% 4.13/1.26 % fd_cond 0
% 4.13/1.26 % fd_pseudo_cond 6
% 4.13/1.26 % AC symbols 0
% 4.13/1.26
% 4.13/1.26 % ------ Schedule dynamic 5 is on
% 4.13/1.26
% 4.13/1.26 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.13/1.26
% 4.13/1.26
% 4.13/1.26 % ------
% 4.13/1.26 % Current options:
% 4.13/1.26 % ------
% 4.13/1.26
% 4.13/1.26
% 4.13/1.26 %
% 4.13/1.26
% 4.13/1.26 % ------ Proving...
% 4.13/1.26 %
% 4.13/1.26
% 4.13/1.26 % SZS status Theorem for theBenchmark.p
% 4.13/1.26
% 4.13/1.26 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.13/1.26
% 4.13/1.26
%------------------------------------------------------------------------------