%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : MGT003+1 : 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 : n020.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:16 PM UTC 2026
% Result : Theorem 1.79s 11.34s
% Output : CNFRefutation 1.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 55 ( 15 unt; 0 def)
% Number of atoms : 255 ( 0 equ)
% Maximal formula atoms : 10 ( 4 avg)
% Number of connectives : 357 ( 157 ~; 151 |; 43 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 8 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 : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 137 ( 0 sgn 125 !; 12 ?; 43 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1,X2] :
( reorganization_free(X0,X1,X2)
=> ( reorganization_free(X0,X2,X2)
& reorganization_free(X0,X1,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp4) ).
fof(f2,axiom,
! [X0,X1] :
( organization(X0,X1)
=> ? [X2] : inertia(X0,X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp5) ).
fof(f3,axiom,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( ( greater(X5,X4)
& survival_chance(X1,X7,X3)
& survival_chance(X0,X6,X2)
& inertia(X1,X5,X3)
& inertia(X0,X4,X2)
& reorganization_free(X1,X3,X3)
& reorganization_free(X0,X2,X2)
& organization(X1,X3)
& organization(X0,X2) )
=> greater(X7,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_FOL) ).
fof(f4,axiom,
! [X0,X1,X2,X3,X4] :
( ( greater(X4,X3)
& inertia(X0,X2,X4)
& inertia(X0,X1,X3)
& reorganization_free(X0,X3,X4)
& organization(X0,X4)
& organization(X0,X3) )
=> greater(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_FOL) ).
fof(f5,conjecture,
! [X0,X1,X2,X3,X4] :
( ( greater(X4,X3)
& survival_chance(X0,X2,X4)
& survival_chance(X0,X1,X3)
& reorganization_free(X0,X3,X4)
& organization(X0,X4)
& organization(X0,X3) )
=> greater(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_FOL) ).
fof(f6,negated_conjecture,
~ ! [X0,X1,X2,X3,X4] :
( ( greater(X4,X3)
& survival_chance(X0,X2,X4)
& survival_chance(X0,X1,X3)
& reorganization_free(X0,X3,X4)
& organization(X0,X4)
& organization(X0,X3) )
=> greater(X2,X1) ),
inference(negated_conjecture,[status(cth)],[f5]) ).
fof(f7,plain,
! [X0,X1,X2] :
( ~ reorganization_free(X0,X1,X2)
| ( reorganization_free(X0,X2,X2)
& reorganization_free(X0,X1,X1) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f8,plain,
! [X0,X1] :
( ~ organization(X0,X1)
| ? [X2] : inertia(X0,X2,X1) ),
inference(ennf_transformation,[],[f2]) ).
fof(f9,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( ~ greater(X5,X4)
| ~ survival_chance(X1,X7,X3)
| ~ survival_chance(X0,X6,X2)
| ~ inertia(X1,X5,X3)
| ~ inertia(X0,X4,X2)
| ~ reorganization_free(X1,X3,X3)
| ~ reorganization_free(X0,X2,X2)
| ~ organization(X1,X3)
| ~ organization(X0,X2)
| greater(X7,X6) ),
inference(ennf_transformation,[],[f3]) ).
fof(f10,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( ~ greater(X5,X4)
| ~ survival_chance(X1,X7,X3)
| ~ survival_chance(X0,X6,X2)
| ~ inertia(X1,X5,X3)
| ~ inertia(X0,X4,X2)
| ~ reorganization_free(X1,X3,X3)
| ~ reorganization_free(X0,X2,X2)
| ~ organization(X1,X3)
| ~ organization(X0,X2)
| greater(X7,X6) ),
inference(flattening,[],[f9]) ).
fof(f11,plain,
! [X0,X1,X2,X3,X4] :
( ~ greater(X4,X3)
| ~ inertia(X0,X2,X4)
| ~ inertia(X0,X1,X3)
| ~ reorganization_free(X0,X3,X4)
| ~ organization(X0,X4)
| ~ organization(X0,X3)
| greater(X2,X1) ),
inference(ennf_transformation,[],[f4]) ).
fof(f12,plain,
! [X0,X1,X2,X3,X4] :
( ~ greater(X4,X3)
| ~ inertia(X0,X2,X4)
| ~ inertia(X0,X1,X3)
| ~ reorganization_free(X0,X3,X4)
| ~ organization(X0,X4)
| ~ organization(X0,X3)
| greater(X2,X1) ),
inference(flattening,[],[f11]) ).
fof(f13,plain,
? [X0,X1,X2,X3,X4] :
( greater(X4,X3)
& survival_chance(X0,X2,X4)
& survival_chance(X0,X1,X3)
& reorganization_free(X0,X3,X4)
& organization(X0,X4)
& organization(X0,X3)
& ~ greater(X2,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f14,plain,
? [X0,X1,X2,X3,X4] :
( greater(X4,X3)
& survival_chance(X0,X2,X4)
& survival_chance(X0,X1,X3)
& reorganization_free(X0,X3,X4)
& organization(X0,X4)
& organization(X0,X3)
& ~ greater(X2,X1) ),
inference(flattening,[],[f13]) ).
fof(f15,plain,
! [X0,X1] :
( ~ organization(X0,X1)
| inertia(X0,sK0(X0,X1),X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f8]) ).
fof(f16,plain,
( greater(sK5,sK4)
& survival_chance(sK1,sK3,sK5)
& survival_chance(sK1,sK2,sK4)
& reorganization_free(sK1,sK4,sK5)
& organization(sK1,sK5)
& organization(sK1,sK4)
& ~ greater(sK3,sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4,sK5]),skolemize(X0,sK1),skolemize(X1,sK2),skolemize(X2,sK3),skolemize(X3,sK4),skolemize(X4,sK5)],[f14]) ).
fof(f17,plain,
! [X2,X0,X1] :
( ~ reorganization_free(X0,X1,X2)
| reorganization_free(X0,X2,X2) ),
inference(cnf_transformation,[],[f7]) ).
fof(f18,plain,
! [X2,X0,X1] :
( ~ reorganization_free(X0,X1,X2)
| reorganization_free(X0,X1,X1) ),
inference(cnf_transformation,[],[f7]) ).
fof(f19,plain,
! [X0,X1] :
( ~ organization(X0,X1)
| inertia(X0,sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f15]) ).
fof(f20,plain,
! [X2,X3,X0,X1,X6,X7,X4,X5] :
( ~ greater(X5,X4)
| ~ survival_chance(X1,X7,X3)
| ~ survival_chance(X0,X6,X2)
| ~ inertia(X1,X5,X3)
| ~ inertia(X0,X4,X2)
| ~ reorganization_free(X1,X3,X3)
| ~ reorganization_free(X0,X2,X2)
| ~ organization(X1,X3)
| ~ organization(X0,X2)
| greater(X7,X6) ),
inference(cnf_transformation,[],[f10]) ).
fof(f21,plain,
! [X2,X3,X0,X1,X4] :
( ~ greater(X4,X3)
| ~ inertia(X0,X2,X4)
| ~ inertia(X0,X1,X3)
| ~ reorganization_free(X0,X3,X4)
| ~ organization(X0,X4)
| ~ organization(X0,X3)
| greater(X2,X1) ),
inference(cnf_transformation,[],[f12]) ).
fof(f22,plain,
greater(sK5,sK4),
inference(cnf_transformation,[],[f16]) ).
fof(f23,plain,
survival_chance(sK1,sK3,sK5),
inference(cnf_transformation,[],[f16]) ).
fof(f24,plain,
survival_chance(sK1,sK2,sK4),
inference(cnf_transformation,[],[f16]) ).
fof(f25,plain,
reorganization_free(sK1,sK4,sK5),
inference(cnf_transformation,[],[f16]) ).
fof(f26,plain,
organization(sK1,sK5),
inference(cnf_transformation,[],[f16]) ).
fof(f27,plain,
organization(sK1,sK4),
inference(cnf_transformation,[],[f16]) ).
fof(f28,plain,
~ greater(sK3,sK2),
inference(cnf_transformation,[],[f16]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i,X2: $i] :
( reorganization_free(X0,X1,X1)
| ~ reorganization_free(X0,X1,X2) ),
inference(cnf_transformation,[],[f18]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i,X2: $i] :
( reorganization_free(X0,X2,X2)
| ~ reorganization_free(X0,X1,X2) ),
inference(cnf_transformation,[],[f17]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i] :
( inertia(X0,sK0(X0,X1),X1)
| ~ organization(X0,X1) ),
inference(cnf_transformation,[],[f19]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i,X6: $i,X7: $i] :
( greater(X7,X6)
| ~ greater(X5,X4)
| ~ organization(X2,X3)
| ~ organization(X0,X1)
| ~ survival_chance(X2,X7,X3)
| ~ survival_chance(X0,X6,X1)
| ~ inertia(X2,X5,X3)
| ~ inertia(X0,X4,X1)
| ~ reorganization_free(X2,X3,X3)
| ~ reorganization_free(X0,X1,X1) ),
inference(cnf_transformation,[],[f20]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( greater(X4,X3)
| ~ greater(X2,X1)
| ~ organization(X0,X2)
| ~ organization(X0,X1)
| ~ inertia(X0,X4,X2)
| ~ inertia(X0,X3,X1)
| ~ reorganization_free(X0,X1,X2) ),
inference(cnf_transformation,[],[f21]) ).
tcf(c_54,negated_conjecture,
~ greater(sK3,sK2),
inference(cnf_transformation,[],[f28]) ).
tcf(c_55,negated_conjecture,
organization(sK1,sK4),
inference(cnf_transformation,[],[f27]) ).
tcf(c_56,negated_conjecture,
organization(sK1,sK5),
inference(cnf_transformation,[],[f26]) ).
tcf(c_57,negated_conjecture,
reorganization_free(sK1,sK4,sK5),
inference(cnf_transformation,[],[f25]) ).
tcf(c_58,negated_conjecture,
survival_chance(sK1,sK2,sK4),
inference(cnf_transformation,[],[f24]) ).
tcf(c_59,negated_conjecture,
survival_chance(sK1,sK3,sK5),
inference(cnf_transformation,[],[f23]) ).
tcf(c_60,negated_conjecture,
greater(sK5,sK4),
inference(cnf_transformation,[],[f22]) ).
tcf(c_129,plain,
( reorganization_free(sK1,sK4,sK4)
| ~ reorganization_free(sK1,sK4,sK5) ),
inference(instantiation,[status(thm)],[c_49]) ).
tcf(c_130,plain,
( reorganization_free(sK1,sK5,sK5)
| ~ reorganization_free(sK1,sK4,sK5) ),
inference(instantiation,[status(thm)],[c_50]) ).
tcf(c_131,plain,
( inertia(sK1,sK0(sK1,sK4),sK4)
| ~ organization(sK1,sK4) ),
inference(instantiation,[status(thm)],[c_51]) ).
tcf(c_132,plain,
( inertia(sK1,sK0(sK1,sK5),sK5)
| ~ organization(sK1,sK5) ),
inference(instantiation,[status(thm)],[c_51]) ).
tcf(c_133,plain,
! [X0: $i,X1: $i,X2: $i] :
( greater(X0,X2)
| ~ organization(sK1,sK4)
| ~ greater(X1,sK4)
| ~ organization(sK1,X1)
| ~ inertia(sK1,X2,sK4)
| ~ reorganization_free(sK1,sK4,X1)
| ~ inertia(sK1,X0,X1) ),
inference(instantiation,[status(thm)],[c_53]) ).
tcf(c_137,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] :
( greater(X3,X5)
| ~ organization(sK1,sK4)
| ~ greater(X2,X4)
| ~ organization(X0,X1)
| ~ reorganization_free(sK1,sK4,sK4)
| ~ survival_chance(sK1,X5,sK4)
| ~ inertia(sK1,X4,sK4)
| ~ survival_chance(X0,X3,X1)
| ~ inertia(X0,X2,X1)
| ~ reorganization_free(X0,X1,X1) ),
inference(instantiation,[status(thm)],[c_52]) ).
tcf(c_145,plain,
! [X0: $i,X1: $i] :
( greater(X0,X1)
| ~ greater(sK5,sK4)
| ~ organization(sK1,sK5)
| ~ organization(sK1,sK4)
| ~ reorganization_free(sK1,sK4,sK5)
| ~ inertia(sK1,X1,sK4)
| ~ inertia(sK1,X0,sK5) ),
inference(instantiation,[status(thm)],[c_133]) ).
tcf(c_152,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( greater(X2,X3)
| ~ organization(sK1,sK5)
| ~ organization(sK1,sK4)
| ~ greater(X0,X1)
| ~ reorganization_free(sK1,sK5,sK5)
| ~ reorganization_free(sK1,sK4,sK4)
| ~ survival_chance(sK1,X3,sK4)
| ~ survival_chance(sK1,X2,sK5)
| ~ inertia(sK1,X1,sK4)
| ~ inertia(sK1,X0,sK5) ),
inference(instantiation,[status(thm)],[c_137]) ).
tcf(c_155,plain,
! [X0: $i] :
( greater(sK0(sK1,sK5),X0)
| ~ greater(sK5,sK4)
| ~ organization(sK1,sK5)
| ~ organization(sK1,sK4)
| ~ reorganization_free(sK1,sK4,sK5)
| ~ inertia(sK1,X0,sK4)
| ~ inertia(sK1,sK0(sK1,sK5),sK5) ),
inference(instantiation,[status(thm)],[c_145]) ).
tcf(c_159,plain,
! [X0: $i,X1: $i,X2: $i] :
( greater(X1,X2)
| ~ organization(sK1,sK5)
| ~ organization(sK1,sK4)
| ~ reorganization_free(sK1,sK5,sK5)
| ~ reorganization_free(sK1,sK4,sK4)
| ~ survival_chance(sK1,X2,sK4)
| ~ survival_chance(sK1,X1,sK5)
| ~ inertia(sK1,X0,sK4)
| ~ greater(sK0(sK1,sK5),X0)
| ~ inertia(sK1,sK0(sK1,sK5),sK5) ),
inference(instantiation,[status(thm)],[c_152]) ).
tcf(c_165,plain,
! [X0: $i,X1: $i] :
( greater(X0,X1)
| ~ organization(sK1,sK5)
| ~ organization(sK1,sK4)
| ~ reorganization_free(sK1,sK5,sK5)
| ~ reorganization_free(sK1,sK4,sK4)
| ~ survival_chance(sK1,X1,sK4)
| ~ survival_chance(sK1,X0,sK5)
| ~ inertia(sK1,sK0(sK1,sK5),sK5)
| ~ inertia(sK1,sK0(sK1,sK4),sK4)
| ~ greater(sK0(sK1,sK5),sK0(sK1,sK4)) ),
inference(instantiation,[status(thm)],[c_159]) ).
tcf(c_169,plain,
! [X0: $i] :
( greater(sK3,X0)
| ~ organization(sK1,sK5)
| ~ organization(sK1,sK4)
| ~ survival_chance(sK1,sK3,sK5)
| ~ reorganization_free(sK1,sK5,sK5)
| ~ reorganization_free(sK1,sK4,sK4)
| ~ survival_chance(sK1,X0,sK4)
| ~ inertia(sK1,sK0(sK1,sK5),sK5)
| ~ inertia(sK1,sK0(sK1,sK4),sK4)
| ~ greater(sK0(sK1,sK5),sK0(sK1,sK4)) ),
inference(instantiation,[status(thm)],[c_165]) ).
tcf(c_171,plain,
( greater(sK3,sK2)
| ~ organization(sK1,sK5)
| ~ organization(sK1,sK4)
| ~ survival_chance(sK1,sK2,sK4)
| ~ survival_chance(sK1,sK3,sK5)
| ~ reorganization_free(sK1,sK5,sK5)
| ~ reorganization_free(sK1,sK4,sK4)
| ~ inertia(sK1,sK0(sK1,sK5),sK5)
| ~ inertia(sK1,sK0(sK1,sK4),sK4)
| ~ greater(sK0(sK1,sK5),sK0(sK1,sK4)) ),
inference(instantiation,[status(thm)],[c_169]) ).
tcf(c_172,plain,
( greater(sK0(sK1,sK5),sK0(sK1,sK4))
| ~ greater(sK5,sK4)
| ~ organization(sK1,sK5)
| ~ organization(sK1,sK4)
| ~ reorganization_free(sK1,sK4,sK5)
| ~ inertia(sK1,sK0(sK1,sK5),sK5)
| ~ inertia(sK1,sK0(sK1,sK4),sK4) ),
inference(instantiation,[status(thm)],[c_155]) ).
tcf(c_173,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_172,c_171,c_132,c_131,c_130,c_129,c_54,c_57,c_58,c_59,c_55,c_56,c_60]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT003+1 : 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/10.43 % Computer : n020.cluster.edu
% 0.09/10.43 % Model : x86_64 x86_64
% 0.09/10.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/10.43 % Memory : 8046.5625MB
% 0.09/10.43 % OS : Linux 6.8.0-71-generic
% 0.09/10.43 % CPULimit : 300
% 0.09/10.43 % WCLimit : 300
% 0.09/10.43 % DateTime : Thu Sep 24 00:56:45 UTC 2026
% 0.09/10.44 % CPUTime :
% 0.09/10.44 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/10.48 Running first-order theorem proving
% 0.09/10.48 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/10.49
% 0.09/10.49 % ======== iProver multi-core TPTP/SMT =========
% 0.09/10.49
% 0.09/10.49 % Detected problem language: tptp
% 0.15/10.50 % Proving...
% 1.79/11.34 % SZS status Started for theBenchmark.p
% 1.79/11.34 % SZS status Theorem for theBenchmark.p
% 1.79/11.34
% 1.79/11.34 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.79/11.34
% 1.79/11.34 % ------ iProver source info
% 1.79/11.34
% 1.79/11.34 % git: date: 2026-07-19 20:42:38 +0200
% 1.79/11.34 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.79/11.34 % git: non_committed_changes: false
% 1.79/11.34
% 1.79/11.34 % ------ Parsing...
% 1.79/11.34 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.79/11.34
% 1.79/11.34 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.79/11.34
% 1.79/11.34 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.79/11.34 % ------ Proving...
% 1.79/11.34 % ------ Problem Properties
% 1.79/11.34
% 1.79/11.34 %
% 1.79/11.34 % clauses 12
% 1.79/11.34 % conjectures 7
% 1.79/11.34 % EPR 11
% 1.79/11.34 % Horn 12
% 1.79/11.34 % unary 7
% 1.79/11.34 % binary 3
% 1.79/11.34 % lits 30
% 1.79/11.34 % lits eq 0
% 1.79/11.34 % fd_pure 0
% 1.79/11.34 % fd_pseudo 0
% 1.79/11.34 % fd_cond 0
% 1.79/11.34 % fd_pseudo_cond 0
% 1.79/11.34 % AC symbols 0
% 1.79/11.34
% 1.79/11.34 % ------ Schedule dynamic 5 is on
% 1.79/11.34
% 1.79/11.34 % ------ no equalities: superposition off
% 1.79/11.34
% 1.79/11.34 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.79/11.34
% 1.79/11.34
% 1.79/11.34 % ------
% 1.79/11.34 % Current options:
% 1.79/11.34 % ------
% 1.79/11.34
% 1.79/11.34
% 1.79/11.34 %
% 1.79/11.34
% 1.79/11.34 % ------ Proving...
% 1.79/11.34 %
% 1.79/11.34
% 1.79/11.34 % SZS status Theorem for theBenchmark.p
% 1.79/11.34
% 1.79/11.34 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.79/11.35
% 1.79/11.35
%------------------------------------------------------------------------------