%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : PRO011+2 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n016.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:36 PM UTC 2026
% Result : Theorem 0.79s 1.28s
% Output : CNFRefutation 0.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 32 ( 4 unt; 1 def)
% Number of atoms : 137 ( 0 equ)
% Maximal formula atoms : 10 ( 4 avg)
% Number of connectives : 145 ( 40 ~; 39 |; 58 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 86 ( 0 sgn 63 !; 23 ?; 19 :)
% Comments :
%------------------------------------------------------------------------------
fof(f22,axiom,
! [X0,X1,X2] :
( ( leaf_occ(X1,X0)
& occurrence_of(X0,X2) )
=> ~ ? [X3] : min_precedes(X1,X3,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_21) ).
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/sandbox/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)
& subactivity_occurrence(X4,X0)
& occurrence_of(X4,tptp1) ) )
& ( occurrence_of(X2,tptp1)
=> ~ ? [X3] :
( min_precedes(X1,X3,tptp0)
& subactivity_occurrence(X3,X0)
& occurrence_of(X3,tptp2) ) )
& leaf_occ(X2,X0) ) ),
file('/export/starexec/sandbox/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)
& subactivity_occurrence(X4,X0)
& occurrence_of(X4,tptp1) ) )
& ( occurrence_of(X2,tptp1)
=> ~ ? [X3] :
( min_precedes(X1,X3,tptp0)
& subactivity_occurrence(X3,X0)
& occurrence_of(X3,tptp2) ) )
& leaf_occ(X2,X0) ) ),
inference(negated_conjecture,[status(cth)],[f46]) ).
fof(f48,plain,
? [X0] :
( occurrence_of(X0,tptp0)
& ! [X1,X2] :
( ( occurrence_of(X2,tptp2)
& ? [X4] :
( min_precedes(X1,X4,tptp0)
& subactivity_occurrence(X4,X0)
& occurrence_of(X4,tptp1) ) )
| ( occurrence_of(X2,tptp1)
& ? [X3] :
( min_precedes(X1,X3,tptp0)
& subactivity_occurrence(X3,X0)
& occurrence_of(X3,tptp2) ) )
| ~ leaf_occ(X2,X0) ) ),
inference(ennf_transformation,[],[f47]) ).
fof(f49,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(f52,plain,
! [X0,X1,X2] :
( ~ leaf_occ(X1,X0)
| ~ occurrence_of(X0,X2)
| ! [X3] : ~ min_precedes(X1,X3,X2) ),
inference(ennf_transformation,[],[f22]) ).
fof(f53,plain,
! [X0,X1,X2] :
( ~ leaf_occ(X1,X0)
| ~ occurrence_of(X0,X2)
| ! [X3] : ~ min_precedes(X1,X3,X2) ),
inference(flattening,[],[f52]) ).
fof(f86,plain,
( occurrence_of(sK2,tptp0)
& ! [X1,X2] :
( sP0(sK2,X1,X2)
| ( occurrence_of(X2,tptp1)
& min_precedes(X1,sK3(X1),tptp0)
& subactivity_occurrence(sK3(X1),sK2)
& occurrence_of(sK3(X1),tptp2) )
| ~ leaf_occ(X2,sK2) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3]),skolemize(X0,sK2),skolemize(X3,sK3(X1))],[f82]) ).
fof(f87,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| ( leaf_occ(sK6(X0),X0)
& next_subocc(sK5(X0),sK6(X0),tptp0)
& ( occurrence_of(sK6(X0),tptp2)
| occurrence_of(sK6(X0),tptp1) )
& next_subocc(sK4(X0),sK5(X0),tptp0)
& occurrence_of(sK5(X0),tptp4)
& root_occ(sK4(X0),X0)
& occurrence_of(sK4(X0),tptp3) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5,sK6]),skolemize(X1,sK4(X0)),skolemize(X2,sK5(X0)),skolemize(X3,sK6(X0))],[f49]) ).
fof(f108,plain,
occurrence_of(sK2,tptp0),
inference(cnf_transformation,[],[f86]) ).
fof(f110,plain,
! [X2,X1] :
( sP0(sK2,X1,X2)
| min_precedes(X1,sK3(X1),tptp0)
| ~ leaf_occ(X2,sK2) ),
inference(cnf_transformation,[],[f86]) ).
fof(f115,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| leaf_occ(sK6(X0),X0) ),
inference(cnf_transformation,[],[f87]) ).
fof(f130,plain,
! [X2,X3,X0,X1] :
( ~ leaf_occ(X1,X0)
| ~ occurrence_of(X0,X2)
| ~ min_precedes(X1,X3,X2) ),
inference(cnf_transformation,[],[f53]) ).
tcf(c_55,negated_conjecture,
! [X0: $i,X1: $i] :
( sP0(sK2,X1,X0)
| min_precedes(X1,sK3(X1),tptp0)
| ~ leaf_occ(X0,sK2) ),
inference(cnf_transformation,[],[f110]) ).
tcf(c_57,negated_conjecture,
occurrence_of(sK2,tptp0),
inference(cnf_transformation,[],[f108]) ).
tcf(c_66,plain,
! [X0: $i] :
( leaf_occ(sK6(X0),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f115]) ).
tcf(c_75,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ~ leaf_occ(X0,X3)
| ~ occurrence_of(X3,X2)
| ~ min_precedes(X0,X1,X2) ),
inference(cnf_transformation,[],[f130]) ).
fof(f81,definition,
! [X0,X1,X2] :
( ~ sP0(X0,X1,X2)
| ( occurrence_of(X2,tptp2)
& ? [X4] :
( min_precedes(X1,X4,tptp0)
& subactivity_occurrence(X4,X0)
& occurrence_of(X4,tptp1) ) ) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f82,plain,
? [X0] :
( occurrence_of(X0,tptp0)
& ! [X1,X2] :
( sP0(X0,X1,X2)
| ( occurrence_of(X2,tptp1)
& ? [X3] :
( min_precedes(X1,X3,tptp0)
& subactivity_occurrence(X3,X0)
& occurrence_of(X3,tptp2) ) )
| ~ leaf_occ(X2,X0) ) ),
inference(definition_folding,[],[f48,f81]) ).
fof(f83,plain,
! [X0,X1,X2] :
( ~ sP0(X0,X1,X2)
| ( occurrence_of(X2,tptp2)
& ? [X4] :
( min_precedes(X1,X4,tptp0)
& subactivity_occurrence(X4,X0)
& occurrence_of(X4,tptp1) ) ) ),
inference(nnf_transformation,[],[f81]) ).
fof(f84,plain,
! [X0,X1,X2] :
( ~ sP0(X0,X1,X2)
| ( occurrence_of(X2,tptp2)
& ? [X3] :
( min_precedes(X1,X3,tptp0)
& subactivity_occurrence(X3,X0)
& occurrence_of(X3,tptp1) ) ) ),
inference(rectify,[],[f83]) ).
fof(f85,plain,
! [X0,X1,X2] :
( ~ sP0(X0,X1,X2)
| ( occurrence_of(X2,tptp2)
& min_precedes(X1,sK1(X0,X1),tptp0)
& subactivity_occurrence(sK1(X0,X1),X0)
& occurrence_of(sK1(X0,X1),tptp1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X3,sK1(X0,X1))],[f84]) ).
fof(f105,plain,
! [X2,X0,X1] :
( ~ sP0(X0,X1,X2)
| min_precedes(X1,sK1(X0,X1),tptp0) ),
inference(cnf_transformation,[],[f85]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i,X2: $i] :
( min_precedes(X1,sK1(X0,X1),tptp0)
| ~ sP0(X0,X1,X2) ),
inference(cnf_transformation,[],[f105]) ).
tcf(c_3884,plain,
! [X0: $i,X1: $i] :
( min_precedes(X1,sK3(X1),tptp0)
| min_precedes(X1,sK1(sK2,X1),tptp0)
| ~ leaf_occ(X0,sK2) ),
inference(superposition,[status(thm)],[c_55,c_51]) ).
tcf(c_4322,plain,
! [X0: $i] :
( min_precedes(X0,sK3(X0),tptp0)
| min_precedes(X0,sK1(sK2,X0),tptp0)
| ~ occurrence_of(sK2,tptp0) ),
inference(superposition,[status(thm)],[c_66,c_3884]) ).
tcf(c_4323,plain,
! [X0: $i] :
( min_precedes(X0,sK3(X0),tptp0)
| min_precedes(X0,sK1(sK2,X0),tptp0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_4322,c_57]) ).
tcf(c_4479,plain,
! [X0: $i,X1: $i] :
( min_precedes(X0,sK3(X0),tptp0)
| ~ occurrence_of(X1,tptp0)
| ~ leaf_occ(X0,X1) ),
inference(superposition,[status(thm)],[c_4323,c_75]) ).
tcf(c_6706,plain,
! [X0: $i,X1: $i] :
( ~ occurrence_of(X1,tptp0)
| ~ leaf_occ(X0,X1) ),
inference(forward_subsumption_resolution,[status(thm)],[c_4479,c_75]) ).
tcf(c_6713,plain,
! [X0: $i] : ~ occurrence_of(X0,tptp0),
inference(backward_subsumption_resolution,[status(thm)],[c_66,c_6706]) ).
tcf(c_6714,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_57,c_6713]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PRO011+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.37 % Computer : n016.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Thu Sep 24 06:34:28 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/0.41 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/0.42
% 0.14/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.42
% 0.14/0.42 % Detected problem language: tptp
% 0.14/0.44 % Proving...
% 0.79/1.28 % SZS status Started for theBenchmark.p
% 0.79/1.28 % SZS status Theorem for theBenchmark.p
% 0.79/1.28
% 0.79/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.79/1.28
% 0.79/1.28 % ------ iProver source info
% 0.79/1.28
% 0.79/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 0.79/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.79/1.28 % git: non_committed_changes: false
% 0.79/1.28
% 0.79/1.28 % ------ Parsing...
% 0.79/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.79/1.28
% 0.79/1.28 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 0.79/1.28
% 0.79/1.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.79/1.28
% 0.79/1.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.79/1.28 % ------ Proving...
% 0.79/1.28 % ------ Problem Properties
% 0.79/1.28
% 0.79/1.28 %
% 0.79/1.28 % clauses 73
% 0.79/1.28 % conjectures 5
% 0.79/1.28 % EPR 40
% 0.79/1.28 % Horn 62
% 0.79/1.28 % unary 13
% 0.79/1.28 % binary 38
% 0.79/1.28 % lits 165
% 0.79/1.28 % lits eq 10
% 0.79/1.28 % fd_pure 0
% 0.79/1.28 % fd_pseudo 0
% 0.79/1.28 % fd_cond 0
% 0.79/1.28 % fd_pseudo_cond 4
% 0.79/1.28 % AC symbols 0
% 0.79/1.28
% 0.79/1.28 % ------ Schedule dynamic 5 is on
% 0.79/1.28
% 0.79/1.28 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.79/1.28
% 0.79/1.28
% 0.79/1.28 % ------
% 0.79/1.28 % Current options:
% 0.79/1.28 % ------
% 0.79/1.28
% 0.79/1.28
% 0.79/1.28 %
% 0.79/1.28
% 0.79/1.28 % ------ Proving...
% 0.79/1.28 %
% 0.79/1.28
% 0.79/1.28 % SZS status Theorem for theBenchmark.p
% 0.79/1.28
% 0.79/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.79/1.28
% 0.79/1.28
%------------------------------------------------------------------------------