%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : MGT041+2 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n018.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:12:53 PM UTC 2026
% Result : Theorem 0.46s 1.28s
% Output : CNFRefutation 0.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 37 ( 11 unt; 0 def)
% Number of atoms : 94 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 111 ( 54 ~; 40 |; 15 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 9 ( 8 usr; 3 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 43 ( 0 sgn 37 !; 6 ?; 11 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
~ ( number_of_routines(X0,X1,high)
& number_of_routines(X0,X1,low) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_not_high_and_low) ).
fof(f2,axiom,
! [X0,X1] :
( ( founding_time(X0,X1)
& efficient_producer(X0)
& organisation_at_time(X0,X1) )
=> has_elaborated_routines(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a14) ).
fof(f3,axiom,
! [X0,X1] :
( ( founding_time(X0,X1)
& first_mover(X0)
& organisation_at_time(X0,X1) )
=> number_of_routines(X0,X1,low) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a15) ).
fof(f4,axiom,
? [X0,X1] :
( ~ has_elaborated_routines(X0,X1)
& number_of_routines(X0,X1,high)
& founding_time(X0,X1)
& organisation_at_time(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a16) ).
fof(f5,conjecture,
? [X0,X1] :
( ~ efficient_producer(X0)
& ~ first_mover(X0)
& organisation_at_time(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_t10) ).
fof(f6,negated_conjecture,
~ ? [X0,X1] :
( ~ efficient_producer(X0)
& ~ first_mover(X0)
& organisation_at_time(X0,X1) ),
inference(negated_conjecture,[status(cth)],[f5]) ).
fof(f7,plain,
! [X0,X1] :
( ~ number_of_routines(X0,X1,high)
| ~ number_of_routines(X0,X1,low) ),
inference(ennf_transformation,[],[f1]) ).
fof(f8,plain,
! [X0,X1] :
( ~ founding_time(X0,X1)
| ~ efficient_producer(X0)
| ~ organisation_at_time(X0,X1)
| has_elaborated_routines(X0,X1) ),
inference(ennf_transformation,[],[f2]) ).
fof(f9,plain,
! [X0,X1] :
( ~ founding_time(X0,X1)
| ~ efficient_producer(X0)
| ~ organisation_at_time(X0,X1)
| has_elaborated_routines(X0,X1) ),
inference(flattening,[],[f8]) ).
fof(f10,plain,
! [X0,X1] :
( ~ founding_time(X0,X1)
| ~ first_mover(X0)
| ~ organisation_at_time(X0,X1)
| number_of_routines(X0,X1,low) ),
inference(ennf_transformation,[],[f3]) ).
fof(f11,plain,
! [X0,X1] :
( ~ founding_time(X0,X1)
| ~ first_mover(X0)
| ~ organisation_at_time(X0,X1)
| number_of_routines(X0,X1,low) ),
inference(flattening,[],[f10]) ).
fof(f12,plain,
! [X0,X1] :
( efficient_producer(X0)
| first_mover(X0)
| ~ organisation_at_time(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f13,plain,
( ~ has_elaborated_routines(sK0,sK1)
& number_of_routines(sK0,sK1,high)
& founding_time(sK0,sK1)
& organisation_at_time(sK0,sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f4]) ).
fof(f14,plain,
! [X0,X1] :
( ~ number_of_routines(X0,X1,high)
| ~ number_of_routines(X0,X1,low) ),
inference(cnf_transformation,[],[f7]) ).
fof(f15,plain,
! [X0,X1] :
( ~ founding_time(X0,X1)
| ~ efficient_producer(X0)
| ~ organisation_at_time(X0,X1)
| has_elaborated_routines(X0,X1) ),
inference(cnf_transformation,[],[f9]) ).
fof(f16,plain,
! [X0,X1] :
( ~ founding_time(X0,X1)
| ~ first_mover(X0)
| ~ organisation_at_time(X0,X1)
| number_of_routines(X0,X1,low) ),
inference(cnf_transformation,[],[f11]) ).
fof(f17,plain,
~ has_elaborated_routines(sK0,sK1),
inference(cnf_transformation,[],[f13]) ).
fof(f18,plain,
number_of_routines(sK0,sK1,high),
inference(cnf_transformation,[],[f13]) ).
fof(f19,plain,
founding_time(sK0,sK1),
inference(cnf_transformation,[],[f13]) ).
fof(f20,plain,
organisation_at_time(sK0,sK1),
inference(cnf_transformation,[],[f13]) ).
fof(f21,plain,
! [X0,X1] :
( efficient_producer(X0)
| first_mover(X0)
| ~ organisation_at_time(X0,X1) ),
inference(cnf_transformation,[],[f12]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i] :
( ~ number_of_routines(X0,X1,high)
| ~ number_of_routines(X0,X1,low) ),
inference(cnf_transformation,[],[f14]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i] :
( has_elaborated_routines(X0,X1)
| ~ efficient_producer(X0)
| ~ founding_time(X0,X1)
| ~ organisation_at_time(X0,X1) ),
inference(cnf_transformation,[],[f15]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i] :
( number_of_routines(X0,X1,low)
| ~ first_mover(X0)
| ~ founding_time(X0,X1)
| ~ organisation_at_time(X0,X1) ),
inference(cnf_transformation,[],[f16]) ).
tcf(c_52,plain,
organisation_at_time(sK0,sK1),
inference(cnf_transformation,[],[f20]) ).
tcf(c_53,plain,
founding_time(sK0,sK1),
inference(cnf_transformation,[],[f19]) ).
tcf(c_54,plain,
number_of_routines(sK0,sK1,high),
inference(cnf_transformation,[],[f18]) ).
tcf(c_55,plain,
~ has_elaborated_routines(sK0,sK1),
inference(cnf_transformation,[],[f17]) ).
tcf(c_56,negated_conjecture,
! [X0: $i,X1: $i] :
( first_mover(X0)
| efficient_producer(X0)
| ~ organisation_at_time(X0,X1) ),
inference(cnf_transformation,[],[f21]) ).
tcf(c_95,plain,
( ~ efficient_producer(sK0)
| ~ founding_time(sK0,sK1)
| ~ organisation_at_time(sK0,sK1) ),
inference(resolution,[status(thm)],[c_50,c_55]) ).
tcf(c_96,plain,
~ efficient_producer(sK0),
inference(global_subsumption_just,[status(thm)],[c_95,c_53,c_52,c_95]) ).
tcf(c_102,plain,
! [X0: $i] :
( first_mover(sK0)
| ~ organisation_at_time(sK0,X0) ),
inference(resolution,[status(thm)],[c_56,c_96]) ).
tcf(c_112,plain,
( number_of_routines(sK0,sK1,low)
| ~ first_mover(sK0)
| ~ organisation_at_time(sK0,sK1) ),
inference(resolution,[status(thm)],[c_51,c_53]) ).
tcf(c_123,plain,
first_mover(sK0),
inference(resolution,[status(thm)],[c_52,c_102]) ).
tcf(c_139,plain,
! [X0_iProver_number_of_routines_1: iProver_number_of_routines_1,X0_iProver_number_of_routines_2: iProver_number_of_routines_2] :
( ~ number_of_routines(X0_iProver_number_of_routines_1,X0_iProver_number_of_routines_2,high)
| ~ number_of_routines(X0_iProver_number_of_routines_1,X0_iProver_number_of_routines_2,low) ),
inference(subtyping,[status(esa)],[c_49]) ).
tcf(c_141,plain,
( ~ number_of_routines(sK0,sK1,high)
| ~ number_of_routines(sK0,sK1,low) ),
inference(instantiation,[status(thm)],[c_139]) ).
tcf(c_142,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_141,c_123,c_112,c_54,c_52]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT041+2 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.36 % Computer : n018.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Thu Sep 24 01:12:18 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/0.41 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.09/0.42
% 0.09/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.42
% 0.09/0.42 % Detected problem language: tptp
% 0.09/0.44 % Proving...
% 0.46/1.28 % SZS status Started for theBenchmark.p
% 0.46/1.28 % SZS status Theorem for theBenchmark.p
% 0.46/1.28
% 0.46/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.46/1.28
% 0.46/1.28 % ------ iProver source info
% 0.46/1.28
% 0.46/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 0.46/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.46/1.28 % git: non_committed_changes: false
% 0.46/1.28
% 0.46/1.28 % ------ Parsing...
% 0.46/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Option_epr_non_horn_non_eq
% 0.46/1.28 %
% 0.46/1.28
% 0.46/1.28 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sf_s rm: 0 0s sf_e pe_s pe_e %
% 0.46/1.28
% 0.46/1.28 % ------ Preprocessing...% ------ preprocesses with Option_epr_horn
% 0.46/1.28 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.46/1.28 % ------ Proving...
% 0.46/1.28 % ------ Problem Properties
% 0.46/1.28
% 0.46/1.28 %
% 0.46/1.28 % clauses 3
% 0.46/1.28 % conjectures 0
% 0.46/1.28 % EPR 3
% 0.46/1.28 % Horn 3
% 0.46/1.28 % unary 2
% 0.46/1.28 % binary 1
% 0.46/1.28 % lits 4
% 0.46/1.28 % lits eq 0
% 0.46/1.28 % fd_pure 0
% 0.46/1.28 % fd_pseudo 0
% 0.46/1.28 % fd_cond 0
% 0.46/1.28 % fd_pseudo_cond 0
% 0.46/1.28 % AC symbols 0
% 0.46/1.28
% 0.46/1.28 % ------ Schedule EPR Horn non eq is on
% 0.46/1.28
% 0.46/1.28 % ------ no conjectures: strip conj schedule
% 0.46/1.28
% 0.46/1.28 % ------ no equalities: superposition off
% 0.46/1.28
% 0.46/1.28 % ------ Option_epr_horn stripped conjectures Time Limit: Unbounded
% 0.46/1.28
% 0.46/1.28
% 0.46/1.28 % ------
% 0.46/1.28 % Current options:
% 0.46/1.28 % ------
% 0.46/1.28
% 0.46/1.28
% 0.46/1.28 %
% 0.46/1.28
% 0.46/1.28 % ------ Proving...
% 0.46/1.28 %
% 0.46/1.28
% 0.46/1.28 % SZS status Theorem for theBenchmark.p
% 0.46/1.28
% 0.46/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.46/1.28
% 0.46/1.28
%------------------------------------------------------------------------------