%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : MGT041-2 : TPTP v9.3.1. Released v2.4.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:12:53 PM UTC 2026
% Result : Unsatisfiable 0.72s 1.10s
% Output : CNFRefutation 0.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of formulae : 24 ( 11 unt; 0 def)
% Number of atoms : 49 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 56 ( 31 ~; 25 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 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 : 19 ( 0 sgn 19 !; 0 ?; 11 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( ~ number_of_routines(X0,X1,high)
| ~ number_of_routines(X0,X1,low) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_not_high_and_low_1) ).
fof(f2,axiom,
! [X0,X1] :
( has_elaborated_routines(X0,X1)
| ~ founding_time(X0,X1)
| ~ efficient_producer(X0)
| ~ organisation_at_time(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a14_2) ).
fof(f3,axiom,
! [X0,X1] :
( number_of_routines(X0,X1,low)
| ~ founding_time(X0,X1)
| ~ first_mover(X0)
| ~ organisation_at_time(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a15_3) ).
fof(f4,axiom,
organisation_at_time(sk1,sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a16_4) ).
fof(f5,axiom,
founding_time(sk1,sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a16_5) ).
fof(f6,axiom,
number_of_routines(sk1,sk2,high),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a16_6) ).
fof(f7,axiom,
~ has_elaborated_routines(sk1,sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a16_7) ).
fof(f8,negated_conjecture,
! [X0,X1] :
( efficient_producer(X0)
| first_mover(X0)
| ~ organisation_at_time(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_t10_8) ).
tcf(c_57,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,[],[f2]) ).
tcf(c_58,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,[],[f3]) ).
tcf(c_59,plain,
organisation_at_time(sk1,sk2),
inference(cnf_transformation,[],[f4]) ).
tcf(c_60,plain,
founding_time(sk1,sk2),
inference(cnf_transformation,[],[f5]) ).
tcf(c_61,plain,
number_of_routines(sk1,sk2,high),
inference(cnf_transformation,[],[f6]) ).
tcf(c_62,plain,
~ has_elaborated_routines(sk1,sk2),
inference(cnf_transformation,[],[f7]) ).
tcf(c_63,negated_conjecture,
! [X0: $i,X1: $i] :
( first_mover(X0)
| efficient_producer(X0)
| ~ organisation_at_time(X0,X1) ),
inference(cnf_transformation,[],[f8]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i] :
( ~ number_of_routines(X0,X1,high)
| ~ number_of_routines(X0,X1,low) ),
inference(cnf_transformation,[],[f1]) ).
tcf(c_103,plain,
( ~ efficient_producer(sk1)
| ~ founding_time(sk1,sk2)
| ~ organisation_at_time(sk1,sk2) ),
inference(resolution,[status(thm)],[c_57,c_62]) ).
tcf(c_104,plain,
~ efficient_producer(sk1),
inference(global_subsumption_just,[status(thm)],[c_103,c_60,c_59,c_103]) ).
tcf(c_110,plain,
! [X0: $i] :
( first_mover(sk1)
| ~ organisation_at_time(sk1,X0) ),
inference(resolution,[status(thm)],[c_63,c_104]) ).
tcf(c_120,plain,
( number_of_routines(sk1,sk2,low)
| ~ first_mover(sk1)
| ~ organisation_at_time(sk1,sk2) ),
inference(resolution,[status(thm)],[c_58,c_60]) ).
tcf(c_131,plain,
first_mover(sk1),
inference(resolution,[status(thm)],[c_59,c_110]) ).
tcf(c_147,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_64]) ).
tcf(c_148,plain,
( ~ number_of_routines(sk1,sk2,high)
| ~ number_of_routines(sk1,sk2,low) ),
inference(instantiation,[status(thm)],[c_147]) ).
tcf(c_149,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_148,c_131,c_120,c_61,c_59]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT041-2 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.36 % Computer : n016.cluster.edu
% 0.12/0.36 % Model : x86_64 x86_64
% 0.12/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.36 % Memory : 8046.5625MB
% 0.12/0.36 % OS : Linux 6.8.0-71-generic
% 0.12/0.36 % CPULimit : 300
% 0.12/0.36 % WCLimit : 300
% 0.12/0.36 % DateTime : Thu Sep 24 01:15:11 UTC 2026
% 0.12/0.36 % CPUTime :
% 0.12/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.39 Running EPR theorem proving
% 0.12/0.39 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s epr_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.41
% 0.12/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.41
% 0.12/0.41 % Detected problem language: tptp
% 0.12/0.42 % Proving...
% 0.72/1.10 % SZS status Started for theBenchmark.p
% 0.72/1.10 % SZS status Unsatisfiable for theBenchmark.p
% 0.72/1.10
% 0.72/1.10 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.72/1.10
% 0.72/1.10 % ------ iProver source info
% 0.72/1.10
% 0.72/1.10 % git: date: 2026-07-19 20:42:38 +0200
% 0.72/1.10 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.72/1.10 % git: non_committed_changes: false
% 0.72/1.10
% 0.72/1.10 % ------ Parsing...% successful
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Option_epr_non_horn_non_eq
% 0.72/1.10 %
% 0.72/1.10
% 0.72/1.10 % ------ 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.72/1.10
% 0.72/1.10 % ------ Preprocessing...% ------ preprocesses with Option_epr_horn
% 0.72/1.10 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.72/1.10 % ------ Proving...
% 0.72/1.10 % ------ Problem Properties
% 0.72/1.10
% 0.72/1.10 %
% 0.72/1.10 % clauses 3
% 0.72/1.10 % conjectures 0
% 0.72/1.10 % EPR 3
% 0.72/1.10 % Horn 3
% 0.72/1.10 % unary 2
% 0.72/1.10 % binary 1
% 0.72/1.10 % lits 4
% 0.72/1.10 % lits eq 0
% 0.72/1.10 % fd_pure 0
% 0.72/1.10 % fd_pseudo 0
% 0.72/1.10 % fd_cond 0
% 0.72/1.10 % fd_pseudo_cond 0
% 0.72/1.10 % AC symbols 0
% 0.72/1.10
% 0.72/1.10 % ------ Schedule EPR Horn non eq is on
% 0.72/1.10
% 0.72/1.10 % ------ no conjectures: strip conj schedule
% 0.72/1.10
% 0.72/1.10 % ------ no equalities: superposition off
% 0.72/1.10
% 0.72/1.10 % ------ Option_epr_horn stripped conjectures Time Limit: Unbounded
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 % ------
% 0.72/1.10 % Current options:
% 0.72/1.10 % ------
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 %
% 0.72/1.10
% 0.72/1.10 % ------ Proving...
% 0.72/1.10 %
% 0.72/1.10
% 0.72/1.10 % SZS status Unsatisfiable for theBenchmark.p
% 0.72/1.10
% 0.72/1.10 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.72/1.10
% 0.72/1.10
%------------------------------------------------------------------------------