TSTP Solution File: MGT008+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : MGT008+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n001.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 : Thu Aug 31 09:14:07 EDT 2023
% Result : Theorem 1.75s 1.16s
% Output : CNFRefutation 1.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 65 ( 25 unt; 0 def)
% Number of atoms : 387 ( 0 equ)
% Maximal formula atoms : 24 ( 5 avg)
% Number of connectives : 526 ( 204 ~; 195 |; 117 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 9 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 209 ( 0 sgn; 122 !; 30 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( organization(X0,X1)
=> ? [X2] : inertia(X0,X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp5) ).
fof(f2,axiom,
! [X0,X3,X4,X5,X6,X7,X8,X9,X10] :
( ( greater(X6,X5)
& inertia(X3,X8,X10)
& inertia(X0,X7,X9)
& size(X3,X6,X10)
& size(X0,X5,X9)
& class(X3,X4,X10)
& class(X0,X4,X9)
& organization(X3,X10)
& organization(X0,X9) )
=> greater(X8,X7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a5_FOL) ).
fof(f3,axiom,
! [X0,X3,X9,X10,X7,X8,X11,X12] :
( ( greater(X8,X7)
& survival_chance(X3,X12,X10)
& survival_chance(X0,X11,X9)
& inertia(X3,X8,X10)
& inertia(X0,X7,X9)
& reorganization_free(X3,X10,X10)
& reorganization_free(X0,X9,X9)
& organization(X3,X10)
& organization(X0,X9) )
=> greater(X12,X11) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_FOL) ).
fof(f4,conjecture,
! [X0,X3,X4,X11,X12,X5,X6,X9,X10] :
( ( greater(X6,X5)
& size(X3,X6,X10)
& size(X0,X5,X9)
& survival_chance(X3,X12,X10)
& survival_chance(X0,X11,X9)
& class(X3,X4,X10)
& class(X0,X4,X9)
& reorganization_free(X3,X10,X10)
& reorganization_free(X0,X9,X9)
& organization(X3,X10)
& organization(X0,X9) )
=> greater(X12,X11) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_FOL) ).
fof(f5,negated_conjecture,
~ ! [X0,X3,X4,X11,X12,X5,X6,X9,X10] :
( ( greater(X6,X5)
& size(X3,X6,X10)
& size(X0,X5,X9)
& survival_chance(X3,X12,X10)
& survival_chance(X0,X11,X9)
& class(X3,X4,X10)
& class(X0,X4,X9)
& reorganization_free(X3,X10,X10)
& reorganization_free(X0,X9,X9)
& organization(X3,X10)
& organization(X0,X9) )
=> greater(X12,X11) ),
inference(negated_conjecture,[],[f4]) ).
fof(f6,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( ( greater(X4,X3)
& inertia(X1,X6,X8)
& inertia(X0,X5,X7)
& size(X1,X4,X8)
& size(X0,X3,X7)
& class(X1,X2,X8)
& class(X0,X2,X7)
& organization(X1,X8)
& organization(X0,X7) )
=> greater(X6,X5) ),
inference(rectify,[],[f2]) ).
fof(f7,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(f8,plain,
~ ! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( ( greater(X6,X5)
& size(X1,X6,X8)
& size(X0,X5,X7)
& survival_chance(X1,X4,X8)
& survival_chance(X0,X3,X7)
& class(X1,X2,X8)
& class(X0,X2,X7)
& reorganization_free(X1,X8,X8)
& reorganization_free(X0,X7,X7)
& organization(X1,X8)
& organization(X0,X7) )
=> greater(X4,X3) ),
inference(rectify,[],[f5]) ).
fof(f9,plain,
! [X0,X1] :
( ? [X2] : inertia(X0,X2,X1)
| ~ organization(X0,X1) ),
inference(ennf_transformation,[],[f1]) ).
fof(f10,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( greater(X6,X5)
| ~ greater(X4,X3)
| ~ inertia(X1,X6,X8)
| ~ inertia(X0,X5,X7)
| ~ size(X1,X4,X8)
| ~ size(X0,X3,X7)
| ~ class(X1,X2,X8)
| ~ class(X0,X2,X7)
| ~ organization(X1,X8)
| ~ organization(X0,X7) ),
inference(ennf_transformation,[],[f6]) ).
fof(f11,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( greater(X6,X5)
| ~ greater(X4,X3)
| ~ inertia(X1,X6,X8)
| ~ inertia(X0,X5,X7)
| ~ size(X1,X4,X8)
| ~ size(X0,X3,X7)
| ~ class(X1,X2,X8)
| ~ class(X0,X2,X7)
| ~ organization(X1,X8)
| ~ organization(X0,X7) ),
inference(flattening,[],[f10]) ).
fof(f12,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,[],[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(flattening,[],[f12]) ).
fof(f14,plain,
? [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( ~ greater(X4,X3)
& greater(X6,X5)
& size(X1,X6,X8)
& size(X0,X5,X7)
& survival_chance(X1,X4,X8)
& survival_chance(X0,X3,X7)
& class(X1,X2,X8)
& class(X0,X2,X7)
& reorganization_free(X1,X8,X8)
& reorganization_free(X0,X7,X7)
& organization(X1,X8)
& organization(X0,X7) ),
inference(ennf_transformation,[],[f8]) ).
fof(f15,plain,
? [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( ~ greater(X4,X3)
& greater(X6,X5)
& size(X1,X6,X8)
& size(X0,X5,X7)
& survival_chance(X1,X4,X8)
& survival_chance(X0,X3,X7)
& class(X1,X2,X8)
& class(X0,X2,X7)
& reorganization_free(X1,X8,X8)
& reorganization_free(X0,X7,X7)
& organization(X1,X8)
& organization(X0,X7) ),
inference(flattening,[],[f14]) ).
fof(f16,plain,
! [X0,X1] :
( ? [X2] : inertia(X0,X2,X1)
=> inertia(X0,sK0(X0,X1),X1) ),
introduced(choice_axiom,[]) ).
fof(f17,plain,
! [X0,X1] :
( inertia(X0,sK0(X0,X1),X1)
| ~ organization(X0,X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f9,f16]) ).
fof(f18,plain,
( ? [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( ~ greater(X4,X3)
& greater(X6,X5)
& size(X1,X6,X8)
& size(X0,X5,X7)
& survival_chance(X1,X4,X8)
& survival_chance(X0,X3,X7)
& class(X1,X2,X8)
& class(X0,X2,X7)
& reorganization_free(X1,X8,X8)
& reorganization_free(X0,X7,X7)
& organization(X1,X8)
& organization(X0,X7) )
=> ( ~ greater(sK5,sK4)
& greater(sK7,sK6)
& size(sK2,sK7,sK9)
& size(sK1,sK6,sK8)
& survival_chance(sK2,sK5,sK9)
& survival_chance(sK1,sK4,sK8)
& class(sK2,sK3,sK9)
& class(sK1,sK3,sK8)
& reorganization_free(sK2,sK9,sK9)
& reorganization_free(sK1,sK8,sK8)
& organization(sK2,sK9)
& organization(sK1,sK8) ) ),
introduced(choice_axiom,[]) ).
fof(f19,plain,
( ~ greater(sK5,sK4)
& greater(sK7,sK6)
& size(sK2,sK7,sK9)
& size(sK1,sK6,sK8)
& survival_chance(sK2,sK5,sK9)
& survival_chance(sK1,sK4,sK8)
& class(sK2,sK3,sK9)
& class(sK1,sK3,sK8)
& reorganization_free(sK2,sK9,sK9)
& reorganization_free(sK1,sK8,sK8)
& organization(sK2,sK9)
& organization(sK1,sK8) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4,sK5,sK6,sK7,sK8,sK9])],[f15,f18]) ).
fof(f20,plain,
! [X0,X1] :
( inertia(X0,sK0(X0,X1),X1)
| ~ organization(X0,X1) ),
inference(cnf_transformation,[],[f17]) ).
fof(f21,plain,
! [X2,X3,X0,X1,X8,X6,X7,X4,X5] :
( greater(X6,X5)
| ~ greater(X4,X3)
| ~ inertia(X1,X6,X8)
| ~ inertia(X0,X5,X7)
| ~ size(X1,X4,X8)
| ~ size(X0,X3,X7)
| ~ class(X1,X2,X8)
| ~ class(X0,X2,X7)
| ~ organization(X1,X8)
| ~ organization(X0,X7) ),
inference(cnf_transformation,[],[f11]) ).
fof(f22,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,[],[f13]) ).
fof(f23,plain,
organization(sK1,sK8),
inference(cnf_transformation,[],[f19]) ).
fof(f24,plain,
organization(sK2,sK9),
inference(cnf_transformation,[],[f19]) ).
fof(f25,plain,
reorganization_free(sK1,sK8,sK8),
inference(cnf_transformation,[],[f19]) ).
fof(f26,plain,
reorganization_free(sK2,sK9,sK9),
inference(cnf_transformation,[],[f19]) ).
fof(f27,plain,
class(sK1,sK3,sK8),
inference(cnf_transformation,[],[f19]) ).
fof(f28,plain,
class(sK2,sK3,sK9),
inference(cnf_transformation,[],[f19]) ).
fof(f29,plain,
survival_chance(sK1,sK4,sK8),
inference(cnf_transformation,[],[f19]) ).
fof(f30,plain,
survival_chance(sK2,sK5,sK9),
inference(cnf_transformation,[],[f19]) ).
fof(f31,plain,
size(sK1,sK6,sK8),
inference(cnf_transformation,[],[f19]) ).
fof(f32,plain,
size(sK2,sK7,sK9),
inference(cnf_transformation,[],[f19]) ).
fof(f33,plain,
greater(sK7,sK6),
inference(cnf_transformation,[],[f19]) ).
fof(f34,plain,
~ greater(sK5,sK4),
inference(cnf_transformation,[],[f19]) ).
cnf(c_49,plain,
( ~ organization(X0,X1)
| inertia(X0,sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f20]) ).
cnf(c_50,plain,
( ~ inertia(X0,X1,X2)
| ~ inertia(X3,X4,X5)
| ~ size(X0,X6,X2)
| ~ size(X3,X7,X5)
| ~ class(X0,X8,X2)
| ~ class(X3,X8,X5)
| ~ organization(X0,X2)
| ~ organization(X3,X5)
| ~ greater(X7,X6)
| greater(X4,X1) ),
inference(cnf_transformation,[],[f21]) ).
cnf(c_51,plain,
( ~ inertia(X0,X1,X2)
| ~ inertia(X3,X4,X5)
| ~ survival_chance(X0,X6,X2)
| ~ survival_chance(X3,X7,X5)
| ~ reorganization_free(X0,X2,X2)
| ~ reorganization_free(X3,X5,X5)
| ~ organization(X0,X2)
| ~ organization(X3,X5)
| ~ greater(X4,X1)
| greater(X7,X6) ),
inference(cnf_transformation,[],[f22]) ).
cnf(c_52,negated_conjecture,
~ greater(sK5,sK4),
inference(cnf_transformation,[],[f34]) ).
cnf(c_53,negated_conjecture,
greater(sK7,sK6),
inference(cnf_transformation,[],[f33]) ).
cnf(c_54,negated_conjecture,
size(sK2,sK7,sK9),
inference(cnf_transformation,[],[f32]) ).
cnf(c_55,negated_conjecture,
size(sK1,sK6,sK8),
inference(cnf_transformation,[],[f31]) ).
cnf(c_56,negated_conjecture,
survival_chance(sK2,sK5,sK9),
inference(cnf_transformation,[],[f30]) ).
cnf(c_57,negated_conjecture,
survival_chance(sK1,sK4,sK8),
inference(cnf_transformation,[],[f29]) ).
cnf(c_58,negated_conjecture,
class(sK2,sK3,sK9),
inference(cnf_transformation,[],[f28]) ).
cnf(c_59,negated_conjecture,
class(sK1,sK3,sK8),
inference(cnf_transformation,[],[f27]) ).
cnf(c_60,negated_conjecture,
reorganization_free(sK2,sK9,sK9),
inference(cnf_transformation,[],[f26]) ).
cnf(c_61,negated_conjecture,
reorganization_free(sK1,sK8,sK8),
inference(cnf_transformation,[],[f25]) ).
cnf(c_62,negated_conjecture,
organization(sK2,sK9),
inference(cnf_transformation,[],[f24]) ).
cnf(c_63,negated_conjecture,
organization(sK1,sK8),
inference(cnf_transformation,[],[f23]) ).
cnf(c_133,plain,
( ~ organization(sK2,sK9)
| inertia(sK2,sK0(sK2,sK9),sK9) ),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_134,plain,
( ~ organization(sK1,sK8)
| inertia(sK1,sK0(sK1,sK8),sK8) ),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_136,plain,
( ~ inertia(X0,X1,X2)
| ~ size(X0,X3,X2)
| ~ class(X0,X4,X2)
| ~ inertia(sK1,X5,sK8)
| ~ size(sK1,X6,sK8)
| ~ class(sK1,X4,sK8)
| ~ organization(X0,X2)
| ~ greater(X3,X6)
| ~ organization(sK1,sK8)
| greater(X1,X5) ),
inference(instantiation,[status(thm)],[c_50]) ).
cnf(c_138,plain,
( ~ inertia(X0,X1,X2)
| ~ survival_chance(X0,X3,X2)
| ~ reorganization_free(X0,X2,X2)
| ~ inertia(sK1,X4,sK8)
| ~ survival_chance(sK1,X5,sK8)
| ~ reorganization_free(sK1,sK8,sK8)
| ~ organization(X0,X2)
| ~ greater(X1,X4)
| ~ organization(sK1,sK8)
| greater(X3,X5) ),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_141,plain,
( ~ inertia(sK2,X0,sK9)
| ~ inertia(sK1,X1,sK8)
| ~ survival_chance(sK2,X2,sK9)
| ~ survival_chance(sK1,X3,sK8)
| ~ reorganization_free(sK2,sK9,sK9)
| ~ reorganization_free(sK1,sK8,sK8)
| ~ greater(X0,X1)
| ~ organization(sK2,sK9)
| ~ organization(sK1,sK8)
| greater(X2,X3) ),
inference(instantiation,[status(thm)],[c_138]) ).
cnf(c_145,plain,
( ~ inertia(sK2,X0,sK9)
| ~ inertia(sK1,X1,sK8)
| ~ size(sK2,X2,sK9)
| ~ size(sK1,X3,sK8)
| ~ class(sK2,X4,sK9)
| ~ class(sK1,X4,sK8)
| ~ greater(X2,X3)
| ~ organization(sK2,sK9)
| ~ organization(sK1,sK8)
| greater(X0,X1) ),
inference(instantiation,[status(thm)],[c_136]) ).
cnf(c_161,plain,
( ~ inertia(sK2,sK0(sK2,sK9),sK9)
| ~ inertia(sK1,X0,sK8)
| ~ size(sK2,X1,sK9)
| ~ size(sK1,X2,sK8)
| ~ class(sK2,X3,sK9)
| ~ class(sK1,X3,sK8)
| ~ greater(X1,X2)
| ~ organization(sK2,sK9)
| ~ organization(sK1,sK8)
| greater(sK0(sK2,sK9),X0) ),
inference(instantiation,[status(thm)],[c_145]) ).
cnf(c_165,plain,
( ~ inertia(sK2,sK0(sK2,sK9),sK9)
| ~ greater(sK0(sK2,sK9),X0)
| ~ inertia(sK1,X0,sK8)
| ~ survival_chance(sK2,X1,sK9)
| ~ survival_chance(sK1,X2,sK8)
| ~ reorganization_free(sK2,sK9,sK9)
| ~ reorganization_free(sK1,sK8,sK8)
| ~ organization(sK2,sK9)
| ~ organization(sK1,sK8)
| greater(X1,X2) ),
inference(instantiation,[status(thm)],[c_141]) ).
cnf(c_188,plain,
( ~ greater(sK0(sK2,sK9),sK0(sK1,sK8))
| ~ inertia(sK2,sK0(sK2,sK9),sK9)
| ~ inertia(sK1,sK0(sK1,sK8),sK8)
| ~ survival_chance(sK2,X0,sK9)
| ~ survival_chance(sK1,X1,sK8)
| ~ reorganization_free(sK2,sK9,sK9)
| ~ reorganization_free(sK1,sK8,sK8)
| ~ organization(sK2,sK9)
| ~ organization(sK1,sK8)
| greater(X0,X1) ),
inference(instantiation,[status(thm)],[c_165]) ).
cnf(c_209,plain,
( ~ greater(sK0(sK2,sK9),sK0(sK1,sK8))
| ~ inertia(sK2,sK0(sK2,sK9),sK9)
| ~ inertia(sK1,sK0(sK1,sK8),sK8)
| ~ survival_chance(sK1,X0,sK8)
| ~ survival_chance(sK2,sK5,sK9)
| ~ reorganization_free(sK2,sK9,sK9)
| ~ reorganization_free(sK1,sK8,sK8)
| ~ organization(sK2,sK9)
| ~ organization(sK1,sK8)
| greater(sK5,X0) ),
inference(instantiation,[status(thm)],[c_188]) ).
cnf(c_223,plain,
( ~ greater(sK0(sK2,sK9),sK0(sK1,sK8))
| ~ inertia(sK2,sK0(sK2,sK9),sK9)
| ~ inertia(sK1,sK0(sK1,sK8),sK8)
| ~ survival_chance(sK2,sK5,sK9)
| ~ survival_chance(sK1,sK4,sK8)
| ~ reorganization_free(sK2,sK9,sK9)
| ~ reorganization_free(sK1,sK8,sK8)
| ~ organization(sK2,sK9)
| ~ organization(sK1,sK8)
| greater(sK5,sK4) ),
inference(instantiation,[status(thm)],[c_209]) ).
cnf(c_236,plain,
( ~ inertia(sK2,sK0(sK2,sK9),sK9)
| ~ inertia(sK1,sK0(sK1,sK8),sK8)
| ~ size(sK2,X0,sK9)
| ~ size(sK1,X1,sK8)
| ~ class(sK2,X2,sK9)
| ~ class(sK1,X2,sK8)
| ~ greater(X0,X1)
| ~ organization(sK2,sK9)
| ~ organization(sK1,sK8)
| greater(sK0(sK2,sK9),sK0(sK1,sK8)) ),
inference(instantiation,[status(thm)],[c_161]) ).
cnf(c_293,plain,
( ~ inertia(sK2,sK0(sK2,sK9),sK9)
| ~ inertia(sK1,sK0(sK1,sK8),sK8)
| ~ size(sK1,X0,sK8)
| ~ class(sK2,X1,sK9)
| ~ class(sK1,X1,sK8)
| ~ size(sK2,sK7,sK9)
| ~ greater(sK7,X0)
| ~ organization(sK2,sK9)
| ~ organization(sK1,sK8)
| greater(sK0(sK2,sK9),sK0(sK1,sK8)) ),
inference(instantiation,[status(thm)],[c_236]) ).
cnf(c_356,plain,
( ~ inertia(sK2,sK0(sK2,sK9),sK9)
| ~ inertia(sK1,sK0(sK1,sK8),sK8)
| ~ class(sK2,X0,sK9)
| ~ class(sK1,X0,sK8)
| ~ size(sK2,sK7,sK9)
| ~ size(sK1,sK6,sK8)
| ~ organization(sK2,sK9)
| ~ organization(sK1,sK8)
| ~ greater(sK7,sK6)
| greater(sK0(sK2,sK9),sK0(sK1,sK8)) ),
inference(instantiation,[status(thm)],[c_293]) ).
cnf(c_361,plain,
( ~ inertia(sK2,sK0(sK2,sK9),sK9)
| ~ inertia(sK1,sK0(sK1,sK8),sK8)
| ~ size(sK2,sK7,sK9)
| ~ size(sK1,sK6,sK8)
| ~ class(sK2,sK3,sK9)
| ~ class(sK1,sK3,sK8)
| ~ organization(sK2,sK9)
| ~ organization(sK1,sK8)
| ~ greater(sK7,sK6)
| greater(sK0(sK2,sK9),sK0(sK1,sK8)) ),
inference(instantiation,[status(thm)],[c_356]) ).
cnf(c_362,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_361,c_223,c_134,c_133,c_52,c_54,c_55,c_56,c_57,c_58,c_59,c_60,c_61,c_53,c_62,c_63]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : MGT008+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.16/0.35 % Computer : n001.cluster.edu
% 0.16/0.35 % Model : x86_64 x86_64
% 0.16/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.35 % Memory : 8042.1875MB
% 0.16/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.35 % CPULimit : 300
% 0.16/0.35 % WCLimit : 300
% 0.16/0.35 % DateTime : Mon Aug 28 06:41:20 EDT 2023
% 0.16/0.35 % CPUTime :
% 0.21/0.47 Running first-order theorem proving
% 0.21/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.75/1.16 % SZS status Started for theBenchmark.p
% 1.75/1.16 % SZS status Theorem for theBenchmark.p
% 1.75/1.16
% 1.75/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.75/1.16
% 1.75/1.16 ------ iProver source info
% 1.75/1.16
% 1.75/1.16 git: date: 2023-05-31 18:12:56 +0000
% 1.75/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.75/1.16 git: non_committed_changes: false
% 1.75/1.16 git: last_make_outside_of_git: false
% 1.75/1.16
% 1.75/1.16 ------ Parsing...
% 1.75/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.75/1.16
% 1.75/1.16 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 1.75/1.16
% 1.75/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.75/1.16 ------ Proving...
% 1.75/1.16 ------ Problem Properties
% 1.75/1.16
% 1.75/1.16
% 1.75/1.16 clauses 15
% 1.75/1.16 conjectures 12
% 1.75/1.16 EPR 14
% 1.75/1.16 Horn 15
% 1.75/1.16 unary 12
% 1.75/1.16 binary 1
% 1.75/1.16 lits 34
% 1.75/1.16 lits eq 0
% 1.75/1.16 fd_pure 0
% 1.75/1.16 fd_pseudo 0
% 1.75/1.16 fd_cond 0
% 1.75/1.16 fd_pseudo_cond 0
% 1.75/1.16 AC symbols 0
% 1.75/1.16
% 1.75/1.16 ------ Schedule dynamic 5 is on
% 1.75/1.16
% 1.75/1.16 ------ no equalities: superposition off
% 1.75/1.16
% 1.75/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.75/1.16
% 1.75/1.16
% 1.75/1.16 ------
% 1.75/1.16 Current options:
% 1.75/1.16 ------
% 1.75/1.16
% 1.75/1.16
% 1.75/1.16
% 1.75/1.16
% 1.75/1.16 ------ Proving...
% 1.75/1.16
% 1.75/1.16
% 1.75/1.16 % SZS status Theorem for theBenchmark.p
% 1.75/1.16
% 1.75/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.75/1.16
% 1.75/1.16
%------------------------------------------------------------------------------