TSTP Solution File: MGT003+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : MGT003+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n005.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri May 3 02:43:16 EDT 2024
% Result : Theorem 1.97s 1.20s
% Output : CNFRefutation 1.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 61 ( 15 unt; 0 def)
% Number of atoms : 297 ( 0 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 396 ( 160 ~; 151 |; 73 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% 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 : 169 ( 2 sgn 104 !; 19 ?)
% 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,X3] :
( organization(X0,X3)
=> ? [X4] : inertia(X0,X4,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp5) ).
fof(f3,axiom,
! [X0,X5,X1,X2,X6,X7,X8,X9] :
( ( greater(X7,X6)
& survival_chance(X5,X9,X2)
& survival_chance(X0,X8,X1)
& inertia(X5,X7,X2)
& inertia(X0,X6,X1)
& reorganization_free(X5,X2,X2)
& reorganization_free(X0,X1,X1)
& organization(X5,X2)
& organization(X0,X1) )
=> greater(X9,X8) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_FOL) ).
fof(f4,axiom,
! [X0,X6,X7,X1,X2] :
( ( greater(X2,X1)
& inertia(X0,X7,X2)
& inertia(X0,X6,X1)
& reorganization_free(X0,X1,X2)
& organization(X0,X2)
& organization(X0,X1) )
=> greater(X7,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_FOL) ).
fof(f5,conjecture,
! [X0,X8,X9,X1,X2] :
( ( greater(X2,X1)
& survival_chance(X0,X9,X2)
& survival_chance(X0,X8,X1)
& reorganization_free(X0,X1,X2)
& organization(X0,X2)
& organization(X0,X1) )
=> greater(X9,X8) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_FOL) ).
fof(f6,negated_conjecture,
~ ! [X0,X8,X9,X1,X2] :
( ( greater(X2,X1)
& survival_chance(X0,X9,X2)
& survival_chance(X0,X8,X1)
& reorganization_free(X0,X1,X2)
& organization(X0,X2)
& organization(X0,X1) )
=> greater(X9,X8) ),
inference(negated_conjecture,[],[f5]) ).
fof(f7,plain,
! [X0,X1] :
( organization(X0,X1)
=> ? [X2] : inertia(X0,X2,X1) ),
inference(rectify,[],[f2]) ).
fof(f8,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(rectify,[],[f3]) ).
fof(f9,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(rectify,[],[f4]) ).
fof(f10,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(rectify,[],[f6]) ).
fof(f11,plain,
! [X0,X1,X2] :
( ( reorganization_free(X0,X2,X2)
& reorganization_free(X0,X1,X1) )
| ~ reorganization_free(X0,X1,X2) ),
inference(ennf_transformation,[],[f1]) ).
fof(f12,plain,
! [X0,X1] :
( ? [X2] : inertia(X0,X2,X1)
| ~ organization(X0,X1) ),
inference(ennf_transformation,[],[f7]) ).
fof(f13,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( greater(X7,X6)
| ~ 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) ),
inference(ennf_transformation,[],[f8]) ).
fof(f14,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( greater(X7,X6)
| ~ 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) ),
inference(flattening,[],[f13]) ).
fof(f15,plain,
! [X0,X1,X2,X3,X4] :
( greater(X2,X1)
| ~ greater(X4,X3)
| ~ inertia(X0,X2,X4)
| ~ inertia(X0,X1,X3)
| ~ reorganization_free(X0,X3,X4)
| ~ organization(X0,X4)
| ~ organization(X0,X3) ),
inference(ennf_transformation,[],[f9]) ).
fof(f16,plain,
! [X0,X1,X2,X3,X4] :
( greater(X2,X1)
| ~ greater(X4,X3)
| ~ inertia(X0,X2,X4)
| ~ inertia(X0,X1,X3)
| ~ reorganization_free(X0,X3,X4)
| ~ organization(X0,X4)
| ~ organization(X0,X3) ),
inference(flattening,[],[f15]) ).
fof(f17,plain,
? [X0,X1,X2,X3,X4] :
( ~ greater(X2,X1)
& greater(X4,X3)
& survival_chance(X0,X2,X4)
& survival_chance(X0,X1,X3)
& reorganization_free(X0,X3,X4)
& organization(X0,X4)
& organization(X0,X3) ),
inference(ennf_transformation,[],[f10]) ).
fof(f18,plain,
? [X0,X1,X2,X3,X4] :
( ~ greater(X2,X1)
& greater(X4,X3)
& survival_chance(X0,X2,X4)
& survival_chance(X0,X1,X3)
& reorganization_free(X0,X3,X4)
& organization(X0,X4)
& organization(X0,X3) ),
inference(flattening,[],[f17]) ).
fof(f19,plain,
! [X0,X1] :
( ? [X2] : inertia(X0,X2,X1)
=> inertia(X0,sK0(X0,X1),X1) ),
introduced(choice_axiom,[]) ).
fof(f20,plain,
! [X0,X1] :
( inertia(X0,sK0(X0,X1),X1)
| ~ organization(X0,X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f12,f19]) ).
fof(f21,plain,
( ? [X0,X1,X2,X3,X4] :
( ~ greater(X2,X1)
& 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(sK3,sK2)
& greater(sK5,sK4)
& survival_chance(sK1,sK3,sK5)
& survival_chance(sK1,sK2,sK4)
& reorganization_free(sK1,sK4,sK5)
& organization(sK1,sK5)
& organization(sK1,sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f22,plain,
( ~ greater(sK3,sK2)
& greater(sK5,sK4)
& survival_chance(sK1,sK3,sK5)
& survival_chance(sK1,sK2,sK4)
& reorganization_free(sK1,sK4,sK5)
& organization(sK1,sK5)
& organization(sK1,sK4) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4,sK5])],[f18,f21]) ).
fof(f23,plain,
! [X2,X0,X1] :
( reorganization_free(X0,X1,X1)
| ~ reorganization_free(X0,X1,X2) ),
inference(cnf_transformation,[],[f11]) ).
fof(f24,plain,
! [X2,X0,X1] :
( reorganization_free(X0,X2,X2)
| ~ reorganization_free(X0,X1,X2) ),
inference(cnf_transformation,[],[f11]) ).
fof(f25,plain,
! [X0,X1] :
( inertia(X0,sK0(X0,X1),X1)
| ~ organization(X0,X1) ),
inference(cnf_transformation,[],[f20]) ).
fof(f26,plain,
! [X2,X3,X0,X1,X6,X7,X4,X5] :
( greater(X7,X6)
| ~ 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) ),
inference(cnf_transformation,[],[f14]) ).
fof(f27,plain,
! [X2,X3,X0,X1,X4] :
( greater(X2,X1)
| ~ greater(X4,X3)
| ~ inertia(X0,X2,X4)
| ~ inertia(X0,X1,X3)
| ~ reorganization_free(X0,X3,X4)
| ~ organization(X0,X4)
| ~ organization(X0,X3) ),
inference(cnf_transformation,[],[f16]) ).
fof(f28,plain,
organization(sK1,sK4),
inference(cnf_transformation,[],[f22]) ).
fof(f29,plain,
organization(sK1,sK5),
inference(cnf_transformation,[],[f22]) ).
fof(f30,plain,
reorganization_free(sK1,sK4,sK5),
inference(cnf_transformation,[],[f22]) ).
fof(f31,plain,
survival_chance(sK1,sK2,sK4),
inference(cnf_transformation,[],[f22]) ).
fof(f32,plain,
survival_chance(sK1,sK3,sK5),
inference(cnf_transformation,[],[f22]) ).
fof(f33,plain,
greater(sK5,sK4),
inference(cnf_transformation,[],[f22]) ).
fof(f34,plain,
~ greater(sK3,sK2),
inference(cnf_transformation,[],[f22]) ).
cnf(c_49,plain,
( ~ reorganization_free(X0,X1,X2)
| reorganization_free(X0,X2,X2) ),
inference(cnf_transformation,[],[f24]) ).
cnf(c_50,plain,
( ~ reorganization_free(X0,X1,X2)
| reorganization_free(X0,X1,X1) ),
inference(cnf_transformation,[],[f23]) ).
cnf(c_51,plain,
( ~ organization(X0,X1)
| inertia(X0,sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f25]) ).
cnf(c_52,plain,
( ~ reorganization_free(X0,X1,X1)
| ~ reorganization_free(X2,X3,X3)
| ~ inertia(X0,X4,X1)
| ~ inertia(X2,X5,X3)
| ~ survival_chance(X0,X6,X1)
| ~ survival_chance(X2,X7,X3)
| ~ organization(X0,X1)
| ~ organization(X2,X3)
| ~ greater(X5,X4)
| greater(X7,X6) ),
inference(cnf_transformation,[],[f26]) ).
cnf(c_53,plain,
( ~ reorganization_free(X0,X1,X2)
| ~ inertia(X0,X3,X2)
| ~ inertia(X0,X4,X1)
| ~ organization(X0,X1)
| ~ organization(X0,X2)
| ~ greater(X2,X1)
| greater(X3,X4) ),
inference(cnf_transformation,[],[f27]) ).
cnf(c_54,negated_conjecture,
~ greater(sK3,sK2),
inference(cnf_transformation,[],[f34]) ).
cnf(c_55,negated_conjecture,
greater(sK5,sK4),
inference(cnf_transformation,[],[f33]) ).
cnf(c_56,negated_conjecture,
survival_chance(sK1,sK3,sK5),
inference(cnf_transformation,[],[f32]) ).
cnf(c_57,negated_conjecture,
survival_chance(sK1,sK2,sK4),
inference(cnf_transformation,[],[f31]) ).
cnf(c_58,negated_conjecture,
reorganization_free(sK1,sK4,sK5),
inference(cnf_transformation,[],[f30]) ).
cnf(c_59,negated_conjecture,
organization(sK1,sK5),
inference(cnf_transformation,[],[f29]) ).
cnf(c_60,negated_conjecture,
organization(sK1,sK4),
inference(cnf_transformation,[],[f28]) ).
cnf(c_129,plain,
( ~ reorganization_free(sK1,sK4,sK5)
| reorganization_free(sK1,sK5,sK5) ),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_130,plain,
( ~ reorganization_free(sK1,sK4,sK5)
| reorganization_free(sK1,sK4,sK4) ),
inference(instantiation,[status(thm)],[c_50]) ).
cnf(c_131,plain,
( ~ organization(sK1,sK5)
| inertia(sK1,sK0(sK1,sK5),sK5) ),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_132,plain,
( ~ organization(sK1,sK4)
| inertia(sK1,sK0(sK1,sK4),sK4) ),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_135,plain,
( ~ inertia(sK1,X0,X1)
| ~ reorganization_free(sK1,sK4,X1)
| ~ inertia(sK1,X2,sK4)
| ~ organization(sK1,X1)
| ~ greater(X1,sK4)
| ~ organization(sK1,sK4)
| greater(X0,X2) ),
inference(instantiation,[status(thm)],[c_53]) ).
cnf(c_138,plain,
( ~ reorganization_free(X0,X1,X1)
| ~ inertia(X0,X2,X1)
| ~ survival_chance(X0,X3,X1)
| ~ inertia(sK1,X4,sK4)
| ~ survival_chance(sK1,X5,sK4)
| ~ reorganization_free(sK1,sK4,sK4)
| ~ organization(X0,X1)
| ~ greater(X2,X4)
| ~ organization(sK1,sK4)
| greater(X3,X5) ),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_147,plain,
( ~ inertia(sK1,X0,sK5)
| ~ inertia(sK1,X1,sK4)
| ~ reorganization_free(sK1,sK4,sK5)
| ~ organization(sK1,sK5)
| ~ organization(sK1,sK4)
| ~ greater(sK5,sK4)
| greater(X0,X1) ),
inference(instantiation,[status(thm)],[c_135]) ).
cnf(c_153,plain,
( ~ inertia(sK1,sK0(sK1,sK4),sK4)
| ~ greater(X0,sK0(sK1,sK4))
| ~ reorganization_free(X1,X2,X2)
| ~ inertia(X1,X0,X2)
| ~ survival_chance(X1,X3,X2)
| ~ survival_chance(sK1,X4,sK4)
| ~ reorganization_free(sK1,sK4,sK4)
| ~ organization(X1,X2)
| ~ organization(sK1,sK4)
| greater(X3,X4) ),
inference(instantiation,[status(thm)],[c_138]) ).
cnf(c_155,plain,
( ~ inertia(sK1,sK0(sK1,sK5),sK5)
| ~ inertia(sK1,X0,sK4)
| ~ reorganization_free(sK1,sK4,sK5)
| ~ organization(sK1,sK5)
| ~ organization(sK1,sK4)
| ~ greater(sK5,sK4)
| greater(sK0(sK1,sK5),X0) ),
inference(instantiation,[status(thm)],[c_147]) ).
cnf(c_161,plain,
( ~ inertia(sK1,sK0(sK1,sK4),sK4)
| ~ greater(X0,sK0(sK1,sK4))
| ~ reorganization_free(X1,X2,X2)
| ~ inertia(X1,X0,X2)
| ~ survival_chance(X1,X3,X2)
| ~ reorganization_free(sK1,sK4,sK4)
| ~ survival_chance(sK1,sK2,sK4)
| ~ organization(X1,X2)
| ~ organization(sK1,sK4)
| greater(X3,sK2) ),
inference(instantiation,[status(thm)],[c_153]) ).
cnf(c_163,plain,
( ~ inertia(sK1,sK0(sK1,sK4),sK4)
| ~ greater(X0,sK0(sK1,sK4))
| ~ reorganization_free(X1,X2,X2)
| ~ inertia(X1,X0,X2)
| ~ survival_chance(X1,sK3,X2)
| ~ reorganization_free(sK1,sK4,sK4)
| ~ survival_chance(sK1,sK2,sK4)
| ~ organization(X1,X2)
| ~ organization(sK1,sK4)
| greater(sK3,sK2) ),
inference(instantiation,[status(thm)],[c_161]) ).
cnf(c_169,plain,
( ~ inertia(sK1,sK0(sK1,sK4),sK4)
| ~ greater(X0,sK0(sK1,sK4))
| ~ inertia(sK1,X0,sK5)
| ~ reorganization_free(sK1,sK5,sK5)
| ~ reorganization_free(sK1,sK4,sK4)
| ~ survival_chance(sK1,sK3,sK5)
| ~ survival_chance(sK1,sK2,sK4)
| ~ organization(sK1,sK5)
| ~ organization(sK1,sK4)
| greater(sK3,sK2) ),
inference(instantiation,[status(thm)],[c_163]) ).
cnf(c_177,plain,
( ~ greater(sK0(sK1,sK5),sK0(sK1,sK4))
| ~ inertia(sK1,sK0(sK1,sK5),sK5)
| ~ inertia(sK1,sK0(sK1,sK4),sK4)
| ~ reorganization_free(sK1,sK5,sK5)
| ~ reorganization_free(sK1,sK4,sK4)
| ~ survival_chance(sK1,sK3,sK5)
| ~ survival_chance(sK1,sK2,sK4)
| ~ organization(sK1,sK5)
| ~ organization(sK1,sK4)
| greater(sK3,sK2) ),
inference(instantiation,[status(thm)],[c_169]) ).
cnf(c_180,plain,
( ~ inertia(sK1,sK0(sK1,sK5),sK5)
| ~ inertia(sK1,sK0(sK1,sK4),sK4)
| ~ reorganization_free(sK1,sK4,sK5)
| ~ organization(sK1,sK5)
| ~ organization(sK1,sK4)
| ~ greater(sK5,sK4)
| greater(sK0(sK1,sK5),sK0(sK1,sK4)) ),
inference(instantiation,[status(thm)],[c_155]) ).
cnf(c_181,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_180,c_177,c_132,c_131,c_130,c_129,c_54,c_56,c_57,c_58,c_55,c_59,c_60]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : MGT003+1 : TPTP v8.1.2. Released v2.0.0.
% 0.11/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n005.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu May 2 22:51:41 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.48 Running first-order theorem proving
% 0.19/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.97/1.20 % SZS status Started for theBenchmark.p
% 1.97/1.20 % SZS status Theorem for theBenchmark.p
% 1.97/1.20
% 1.97/1.20 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.97/1.20
% 1.97/1.20 ------ iProver source info
% 1.97/1.20
% 1.97/1.20 git: date: 2024-05-02 19:28:25 +0000
% 1.97/1.20 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 1.97/1.20 git: non_committed_changes: false
% 1.97/1.20
% 1.97/1.20 ------ Parsing...
% 1.97/1.20 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.97/1.20
% 1.97/1.20 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 1.97/1.20
% 1.97/1.20 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.97/1.20 ------ Proving...
% 1.97/1.20 ------ Problem Properties
% 1.97/1.20
% 1.97/1.20
% 1.97/1.20 clauses 12
% 1.97/1.20 conjectures 7
% 1.97/1.20 EPR 11
% 1.97/1.20 Horn 12
% 1.97/1.20 unary 7
% 1.97/1.20 binary 3
% 1.97/1.20 lits 30
% 1.97/1.20 lits eq 0
% 1.97/1.20 fd_pure 0
% 1.97/1.20 fd_pseudo 0
% 1.97/1.20 fd_cond 0
% 1.97/1.20 fd_pseudo_cond 0
% 1.97/1.20 AC symbols 0
% 1.97/1.20
% 1.97/1.20 ------ Schedule dynamic 5 is on
% 1.97/1.20
% 1.97/1.20 ------ no equalities: superposition off
% 1.97/1.20
% 1.97/1.20 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.97/1.20
% 1.97/1.20
% 1.97/1.20 ------
% 1.97/1.20 Current options:
% 1.97/1.20 ------
% 1.97/1.20
% 1.97/1.20
% 1.97/1.20
% 1.97/1.20
% 1.97/1.20 ------ Proving...
% 1.97/1.20
% 1.97/1.20
% 1.97/1.20 % SZS status Theorem for theBenchmark.p
% 1.97/1.20
% 1.97/1.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.97/1.20
% 1.97/1.20
%------------------------------------------------------------------------------