%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : PRO010+1 : 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 1.13s 1.21s
% Output : CNFRefutation 1.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(f3,axiom,
! [X0,X1,X2] :
( ( occurrence_of(X0,X2)
& occurrence_of(X0,X1) )
=> X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_02) ).
fof(f22,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_21) ).
fof(f35,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_34) ).
fof(f36,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_35) ).
fof(f49,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(f50,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)],[f49]) ).
fof(f55,plain,
! [X0,X1,X2] :
( ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1)
| X1 = X2 ),
inference(ennf_transformation,[],[f3]) ).
fof(f56,plain,
! [X0,X1,X2] :
( ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1)
| X1 = X2 ),
inference(flattening,[],[f55]) ).
fof(f80,plain,
! [X0,X1] :
( leaf(X0,X1)
<=> ( ! [X3] : ~ min_precedes(X0,X3,X1)
& ( ? [X2] : min_precedes(X2,X0,X1)
| root(X0,X1) ) ) ),
inference(ennf_transformation,[],[f22]) ).
fof(f99,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,[],[f36]) ).
fof(f100,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,[],[f50]) ).
fof(f110,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,[],[f80]) ).
fof(f111,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,[],[f110]) ).
fof(f112,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,[],[f111]) ).
fof(f113,plain,
! [X0,X1] :
( ( ~ leaf(X0,X1)
| ( ! [X5] : ~ min_precedes(X0,X5,X1)
& ( min_precedes(sK7(X0,X1),X0,X1)
| root(X0,X1) ) ) )
& ( min_precedes(X0,sK6(X0,X1),X1)
| ( ! [X2] : ~ min_precedes(X2,X0,X1)
& ~ root(X0,X1) )
| leaf(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7]),skolemize(X3,sK6(X0,X1)),skolemize(X4,sK7(X0,X1))],[f112]) ).
fof(f122,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,[],[f35]) ).
fof(f123,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,[],[f122]) ).
fof(f124,plain,
! [X0,X1] :
( ( ~ leaf_occ(X0,X1)
| ( leaf(X0,sK14(X0,X1))
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,sK14(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,[sK14]),skolemize(X3,sK14(X0,X1))],[f123]) ).
fof(f125,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| ( leaf_occ(sK17(X0),X0)
& next_subocc(sK16(X0),sK17(X0),tptp0)
& ( occurrence_of(sK17(X0),tptp2)
| occurrence_of(sK17(X0),tptp1) )
& next_subocc(sK15(X0),sK16(X0),tptp0)
& occurrence_of(sK16(X0),tptp4)
& root_occ(sK15(X0),X0)
& occurrence_of(sK15(X0),tptp3) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK15,sK16,sK17]),skolemize(X1,sK15(X0)),skolemize(X2,sK16(X0)),skolemize(X3,sK17(X0))],[f99]) ).
fof(f129,plain,
( occurrence_of(sK19,tptp0)
& ! [X1,X2] :
( sP0(X1,X2)
| ( occurrence_of(X2,tptp1)
& min_precedes(X1,sK20(X1),tptp0)
& occurrence_of(sK20(X1),tptp2) )
| ~ leaf_occ(X2,sK19) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK19,sK20]),skolemize(X0,sK19),skolemize(X3,sK20(X1))],[f102]) ).
fof(f134,plain,
! [X2,X0,X1] :
( ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1)
| X1 = X2 ),
inference(cnf_transformation,[],[f56]) ).
fof(f161,plain,
! [X0,X1,X5] :
( ~ leaf(X0,X1)
| ~ min_precedes(X0,X5,X1) ),
inference(cnf_transformation,[],[f113]) ).
fof(f189,plain,
! [X0,X1] :
( ~ leaf_occ(X0,X1)
| leaf(X0,sK14(X0,X1)) ),
inference(cnf_transformation,[],[f124]) ).
fof(f191,plain,
! [X0,X1] :
( ~ leaf_occ(X0,X1)
| occurrence_of(X1,sK14(X0,X1)) ),
inference(cnf_transformation,[],[f124]) ).
fof(f193,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| leaf_occ(sK17(X0),X0) ),
inference(cnf_transformation,[],[f125]) ).
fof(f215,plain,
occurrence_of(sK19,tptp0),
inference(cnf_transformation,[],[f129]) ).
fof(f217,plain,
! [X2,X1] :
( sP0(X1,X2)
| min_precedes(X1,sK20(X1),tptp0)
| ~ leaf_occ(X2,sK19) ),
inference(cnf_transformation,[],[f129]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X1 = X2 )
| ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1) ),
inference(cnf_transformation,[],[f134]) ).
tcf(c_83,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ leaf(X0,X2)
| ~ min_precedes(X0,X1,X2) ),
inference(cnf_transformation,[],[f161]) ).
tcf(c_109,plain,
! [X0: $i,X1: $i] :
( occurrence_of(X1,sK14(X0,X1))
| ~ leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f191]) ).
tcf(c_111,plain,
! [X0: $i,X1: $i] :
( leaf(X0,sK14(X0,X1))
| ~ leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f189]) ).
tcf(c_118,plain,
! [X0: $i] :
( leaf_occ(sK17(X0),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f193]) ).
tcf(c_135,negated_conjecture,
! [X0: $i,X1: $i] :
( sP0(X1,X0)
| min_precedes(X1,sK20(X1),tptp0)
| ~ leaf_occ(X0,sK19) ),
inference(cnf_transformation,[],[f217]) ).
tcf(c_137,negated_conjecture,
occurrence_of(sK19,tptp0),
inference(cnf_transformation,[],[f215]) ).
tcf(c_6584,negated_conjecture,
occurrence_of(sK19,tptp0),
inference(demodulation,[status(thm)],[c_137]) ).
tcf(c_6586,negated_conjecture,
! [X0: $i,X1: $i] :
( sP0(X1,X0)
| min_precedes(X1,sK20(X1),tptp0)
| ~ leaf_occ(X0,sK19) ),
inference(demodulation,[status(thm)],[c_135]) ).
tcf(c_8221,plain,
! [X0: $i,X1: $i] :
( sP0(X0,X1)
| ~ leaf_occ(X1,sK19)
| ~ leaf(X0,tptp0) ),
inference(superposition,[status(thm)],[c_6586,c_83]) ).
tcf(c_8272,plain,
! [X0: $i] :
( sP0(X0,sK17(sK19))
| ~ occurrence_of(sK19,tptp0)
| ~ leaf(X0,tptp0) ),
inference(superposition,[status(thm)],[c_118,c_8221]) ).
tcf(c_8273,plain,
! [X0: $i] :
( sP0(X0,sK17(sK19))
| ~ leaf(X0,tptp0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_8272,c_6584]) ).
tcf(c_8512,plain,
( leaf_occ(sK17(sK19),sK19)
| ~ occurrence_of(sK19,tptp0) ),
inference(instantiation,[status(thm)],[c_118]) ).
tcf(c_9600,plain,
! [X0: $i] :
( ( X0 = tptp0 )
| ~ occurrence_of(sK19,X0) ),
inference(superposition,[status(thm)],[c_6584,c_53]) ).
tcf(c_9756,plain,
! [X0: $i] :
( ( sK14(X0,sK19) = tptp0 )
| ~ leaf_occ(X0,sK19) ),
inference(superposition,[status(thm)],[c_109,c_9600]) ).
tcf(c_9849,plain,
( ( sK14(sK17(sK19),sK19) = tptp0 )
| ~ occurrence_of(sK19,tptp0) ),
inference(superposition,[status(thm)],[c_118,c_9756]) ).
tcf(c_9850,plain,
sK14(sK17(sK19),sK19) = tptp0,
inference(forward_subsumption_resolution,[status(thm)],[c_9849,c_6584]) ).
tcf(c_9851,plain,
( leaf(sK17(sK19),tptp0)
| ~ leaf_occ(sK17(sK19),sK19) ),
inference(superposition,[status(thm)],[c_9850,c_111]) ).
fof(f101,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(f102,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,[],[f100,f101]) ).
fof(f126,plain,
! [X1,X2] :
( ~ sP0(X1,X2)
| ( occurrence_of(X2,tptp2)
& ? [X4] :
( min_precedes(X1,X4,tptp0)
& occurrence_of(X4,tptp1) ) ) ),
inference(nnf_transformation,[],[f101]) ).
fof(f127,plain,
! [X0,X1] :
( ~ sP0(X0,X1)
| ( occurrence_of(X1,tptp2)
& ? [X2] :
( min_precedes(X0,X2,tptp0)
& occurrence_of(X2,tptp1) ) ) ),
inference(rectify,[],[f126]) ).
fof(f128,plain,
! [X0,X1] :
( ~ sP0(X0,X1)
| ( occurrence_of(X1,tptp2)
& min_precedes(X0,sK18(X0),tptp0)
& occurrence_of(sK18(X0),tptp1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK18]),skolemize(X2,sK18(X0))],[f127]) ).
fof(f213,plain,
! [X0,X1] :
( ~ sP0(X0,X1)
| min_precedes(X0,sK18(X0),tptp0) ),
inference(cnf_transformation,[],[f128]) ).
tcf(c_132,plain,
! [X0: $i,X1: $i] :
( min_precedes(X0,sK18(X0),tptp0)
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f213]) ).
tcf(c_8546,plain,
! [X0: $i] :
( min_precedes(X0,sK18(X0),tptp0)
| ~ leaf(X0,tptp0) ),
inference(superposition,[status(thm)],[c_8273,c_132]) ).
tcf(c_8975,plain,
! [X0: $i] : ~ leaf(X0,tptp0),
inference(forward_subsumption_resolution,[status(thm)],[c_8546,c_83]) ).
tcf(c_9853,plain,
~ leaf_occ(sK17(sK19),sK19),
inference(forward_subsumption_resolution,[status(thm)],[c_9851,c_8975]) ).
tcf(c_9854,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_9853,c_8512,c_137]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PRO010+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.38 % Computer : n010.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Thu Sep 24 06:28:00 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 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.12/0.43
% 0.12/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.43
% 0.12/0.43 % Detected problem language: tptp
% 0.12/0.45 % Proving...
% 1.13/1.21 % SZS status Started for theBenchmark.p
% 1.13/1.21 % SZS status Theorem for theBenchmark.p
% 1.13/1.21
% 1.13/1.21 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.13/1.21
% 1.13/1.21 % ------ iProver source info
% 1.13/1.21
% 1.13/1.21 % git: date: 2026-07-19 20:42:38 +0200
% 1.13/1.21 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.13/1.21 % git: non_committed_changes: false
% 1.13/1.21
% 1.13/1.21 % ------ Parsing...
% 1.13/1.21 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.13/1.21
% 1.13/1.21 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 3 0s sf_e pe_s pe_e %
% 1.13/1.21
% 1.13/1.21 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.13/1.21
% 1.13/1.21 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.13/1.21 % ------ Proving...
% 1.13/1.21 % ------ Problem Properties
% 1.13/1.21
% 1.13/1.21 %
% 1.13/1.21 % clauses 88
% 1.13/1.21 % conjectures 4
% 1.13/1.21 % EPR 46
% 1.13/1.21 % Horn 73
% 1.13/1.21 % unary 13
% 1.13/1.21 % binary 44
% 1.13/1.21 % lits 212
% 1.13/1.21 % lits eq 9
% 1.13/1.21 % fd_pure 0
% 1.13/1.21 % fd_pseudo 0
% 1.13/1.21 % fd_cond 0
% 1.13/1.21 % fd_pseudo_cond 3
% 1.13/1.21 % AC symbols 0
% 1.13/1.21
% 1.13/1.21 % ------ Schedule dynamic 5 is on
% 1.13/1.21
% 1.13/1.21 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.13/1.21
% 1.13/1.21
% 1.13/1.21 % ------
% 1.13/1.21 % Current options:
% 1.13/1.21 % ------
% 1.13/1.21
% 1.13/1.21
% 1.13/1.21 %
% 1.13/1.21
% 1.13/1.21 % ------ Proving...
% 1.13/1.21 %
% 1.13/1.21
% 1.13/1.21 % SZS status Theorem for theBenchmark.p
% 1.13/1.21
% 1.13/1.21 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.13/1.21
% 1.13/1.21
%------------------------------------------------------------------------------