%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : MGT009+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n002.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:19 PM UTC 2026
% Result : Theorem 1.82s 1.29s
% Output : CNFRefutation 1.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of formulae : 61 ( 25 unt; 0 def)
% Number of atoms : 341 ( 0 equ)
% Maximal formula atoms : 12 ( 5 avg)
% Number of connectives : 489 ( 209 ~; 203 |; 69 &)
% ( 3 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 9 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 : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 179 ( 0 sgn 159 !; 20 ?; 57 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( organization(X0,X1)
=> ? [X2] : inertia(X0,X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp5) ).
fof(f2,axiom,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( ( inertia(X1,X7,X3)
& inertia(X0,X6,X2)
& reproducibility(X1,X5,X3)
& reproducibility(X0,X4,X2)
& reorganization_free(X1,X3,X3)
& reorganization_free(X0,X2,X2)
& organization(X1,X3)
& organization(X0,X2) )
=> ( greater(X5,X4)
<=> greater(X7,X6) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a3_FOL) ).
fof(f3,axiom,
! [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) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a5_FOL) ).
fof(f4,conjecture,
! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( ( greater(X6,X5)
& size(X1,X6,X8)
& size(X0,X5,X7)
& reproducibility(X1,X4,X8)
& reproducibility(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) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t9_FOL) ).
fof(f5,negated_conjecture,
~ ! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( ( greater(X6,X5)
& size(X1,X6,X8)
& size(X0,X5,X7)
& reproducibility(X1,X4,X8)
& reproducibility(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(negated_conjecture,[status(cth)],[f4]) ).
fof(f6,plain,
! [X0,X1] :
( ~ organization(X0,X1)
| ? [X2] : inertia(X0,X2,X1) ),
inference(ennf_transformation,[],[f1]) ).
fof(f7,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( ~ inertia(X1,X7,X3)
| ~ inertia(X0,X6,X2)
| ~ reproducibility(X1,X5,X3)
| ~ reproducibility(X0,X4,X2)
| ~ reorganization_free(X1,X3,X3)
| ~ reorganization_free(X0,X2,X2)
| ~ organization(X1,X3)
| ~ organization(X0,X2)
| ( greater(X5,X4)
<=> greater(X7,X6) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f8,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( ~ inertia(X1,X7,X3)
| ~ inertia(X0,X6,X2)
| ~ reproducibility(X1,X5,X3)
| ~ reproducibility(X0,X4,X2)
| ~ reorganization_free(X1,X3,X3)
| ~ reorganization_free(X0,X2,X2)
| ~ organization(X1,X3)
| ~ organization(X0,X2)
| ( greater(X5,X4)
<=> greater(X7,X6) ) ),
inference(flattening,[],[f7]) ).
fof(f9,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(ennf_transformation,[],[f3]) ).
fof(f10,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(flattening,[],[f9]) ).
fof(f11,plain,
? [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( greater(X6,X5)
& size(X1,X6,X8)
& size(X0,X5,X7)
& reproducibility(X1,X4,X8)
& reproducibility(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(ennf_transformation,[],[f5]) ).
fof(f12,plain,
? [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( greater(X6,X5)
& size(X1,X6,X8)
& size(X0,X5,X7)
& reproducibility(X1,X4,X8)
& reproducibility(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(flattening,[],[f11]) ).
fof(f13,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))],[f6]) ).
fof(f14,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( ~ inertia(X1,X7,X3)
| ~ inertia(X0,X6,X2)
| ~ reproducibility(X1,X5,X3)
| ~ reproducibility(X0,X4,X2)
| ~ reorganization_free(X1,X3,X3)
| ~ reorganization_free(X0,X2,X2)
| ~ organization(X1,X3)
| ~ organization(X0,X2)
| ( ( ~ greater(X5,X4)
| greater(X7,X6) )
& ( ~ greater(X7,X6)
| greater(X5,X4) ) ) ),
inference(nnf_transformation,[],[f8]) ).
fof(f15,plain,
( greater(sK7,sK6)
& size(sK2,sK7,sK9)
& size(sK1,sK6,sK8)
& reproducibility(sK2,sK5,sK9)
& reproducibility(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)
& ~ greater(sK5,sK4) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4,sK5,sK6,sK7,sK8,sK9]),skolemize(X0,sK1),skolemize(X1,sK2),skolemize(X2,sK3),skolemize(X3,sK4),skolemize(X4,sK5),skolemize(X5,sK6),skolemize(X6,sK7),skolemize(X7,sK8),skolemize(X8,sK9)],[f12]) ).
fof(f16,plain,
! [X0,X1] :
( ~ organization(X0,X1)
| inertia(X0,sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f13]) ).
fof(f18,plain,
! [X2,X3,X0,X1,X6,X7,X4,X5] :
( ~ inertia(X1,X7,X3)
| ~ inertia(X0,X6,X2)
| ~ reproducibility(X1,X5,X3)
| ~ reproducibility(X0,X4,X2)
| ~ reorganization_free(X1,X3,X3)
| ~ reorganization_free(X0,X2,X2)
| ~ organization(X1,X3)
| ~ organization(X0,X2)
| ~ greater(X7,X6)
| greater(X5,X4) ),
inference(cnf_transformation,[],[f14]) ).
fof(f19,plain,
! [X2,X3,X0,X1,X8,X6,X7,X4,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)
| greater(X6,X5) ),
inference(cnf_transformation,[],[f10]) ).
fof(f20,plain,
greater(sK7,sK6),
inference(cnf_transformation,[],[f15]) ).
fof(f21,plain,
size(sK2,sK7,sK9),
inference(cnf_transformation,[],[f15]) ).
fof(f22,plain,
size(sK1,sK6,sK8),
inference(cnf_transformation,[],[f15]) ).
fof(f23,plain,
reproducibility(sK2,sK5,sK9),
inference(cnf_transformation,[],[f15]) ).
fof(f24,plain,
reproducibility(sK1,sK4,sK8),
inference(cnf_transformation,[],[f15]) ).
fof(f25,plain,
class(sK2,sK3,sK9),
inference(cnf_transformation,[],[f15]) ).
fof(f26,plain,
class(sK1,sK3,sK8),
inference(cnf_transformation,[],[f15]) ).
fof(f27,plain,
reorganization_free(sK2,sK9,sK9),
inference(cnf_transformation,[],[f15]) ).
fof(f28,plain,
reorganization_free(sK1,sK8,sK8),
inference(cnf_transformation,[],[f15]) ).
fof(f29,plain,
organization(sK2,sK9),
inference(cnf_transformation,[],[f15]) ).
fof(f30,plain,
organization(sK1,sK8),
inference(cnf_transformation,[],[f15]) ).
fof(f31,plain,
~ greater(sK5,sK4),
inference(cnf_transformation,[],[f15]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i] :
( inertia(X0,sK0(X0,X1),X1)
| ~ organization(X0,X1) ),
inference(cnf_transformation,[],[f16]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i,X6: $i,X7: $i] :
( greater(X7,X6)
| ~ greater(X4,X1)
| ~ organization(X3,X5)
| ~ organization(X0,X2)
| ~ reproducibility(X3,X7,X5)
| ~ reproducibility(X0,X6,X2)
| ~ reorganization_free(X3,X5,X5)
| ~ reorganization_free(X0,X2,X2)
| ~ inertia(X3,X4,X5)
| ~ inertia(X0,X1,X2) ),
inference(cnf_transformation,[],[f18]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i,X6: $i,X7: $i,X8: $i] :
( greater(X4,X1)
| ~ greater(X8,X7)
| ~ organization(X3,X5)
| ~ organization(X0,X2)
| ~ size(X3,X8,X5)
| ~ size(X0,X7,X2)
| ~ class(X3,X6,X5)
| ~ class(X0,X6,X2)
| ~ inertia(X3,X4,X5)
| ~ inertia(X0,X1,X2) ),
inference(cnf_transformation,[],[f19]) ).
tcf(c_53,negated_conjecture,
~ greater(sK5,sK4),
inference(cnf_transformation,[],[f31]) ).
tcf(c_54,negated_conjecture,
organization(sK1,sK8),
inference(cnf_transformation,[],[f30]) ).
tcf(c_55,negated_conjecture,
organization(sK2,sK9),
inference(cnf_transformation,[],[f29]) ).
tcf(c_56,negated_conjecture,
reorganization_free(sK1,sK8,sK8),
inference(cnf_transformation,[],[f28]) ).
tcf(c_57,negated_conjecture,
reorganization_free(sK2,sK9,sK9),
inference(cnf_transformation,[],[f27]) ).
tcf(c_58,negated_conjecture,
class(sK1,sK3,sK8),
inference(cnf_transformation,[],[f26]) ).
tcf(c_59,negated_conjecture,
class(sK2,sK3,sK9),
inference(cnf_transformation,[],[f25]) ).
tcf(c_60,negated_conjecture,
reproducibility(sK1,sK4,sK8),
inference(cnf_transformation,[],[f24]) ).
tcf(c_61,negated_conjecture,
reproducibility(sK2,sK5,sK9),
inference(cnf_transformation,[],[f23]) ).
tcf(c_62,negated_conjecture,
size(sK1,sK6,sK8),
inference(cnf_transformation,[],[f22]) ).
tcf(c_63,negated_conjecture,
size(sK2,sK7,sK9),
inference(cnf_transformation,[],[f21]) ).
tcf(c_64,negated_conjecture,
greater(sK7,sK6),
inference(cnf_transformation,[],[f20]) ).
tcf(c_166,plain,
( inertia(sK1,sK0(sK1,sK8),sK8)
| ~ organization(sK1,sK8) ),
inference(instantiation,[status(thm)],[c_49]) ).
tcf(c_167,plain,
( inertia(sK2,sK0(sK2,sK9),sK9)
| ~ organization(sK2,sK9) ),
inference(instantiation,[status(thm)],[c_49]) ).
tcf(c_168,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] :
( greater(X3,X5)
| ~ organization(sK1,sK8)
| ~ greater(X1,X4)
| ~ organization(X0,X2)
| ~ reorganization_free(sK1,sK8,sK8)
| ~ reproducibility(sK1,X5,sK8)
| ~ inertia(sK1,X4,sK8)
| ~ reproducibility(X0,X3,X2)
| ~ reorganization_free(X0,X2,X2)
| ~ inertia(X0,X1,X2) ),
inference(instantiation,[status(thm)],[c_50]) ).
tcf(c_172,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i,X6: $i] :
( greater(X1,X5)
| ~ organization(sK1,sK8)
| ~ greater(X4,X6)
| ~ organization(X0,X2)
| ~ size(sK1,X6,sK8)
| ~ class(sK1,X3,sK8)
| ~ inertia(sK1,X5,sK8)
| ~ size(X0,X4,X2)
| ~ class(X0,X3,X2)
| ~ inertia(X0,X1,X2) ),
inference(instantiation,[status(thm)],[c_52]) ).
tcf(c_175,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( greater(X3,X2)
| ~ organization(sK2,sK9)
| ~ organization(sK1,sK8)
| ~ greater(X1,X0)
| ~ reorganization_free(sK2,sK9,sK9)
| ~ reorganization_free(sK1,sK8,sK8)
| ~ reproducibility(sK2,X3,sK9)
| ~ reproducibility(sK1,X2,sK8)
| ~ inertia(sK2,X1,sK9)
| ~ inertia(sK1,X0,sK8) ),
inference(instantiation,[status(thm)],[c_168]) ).
tcf(c_183,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( greater(X1,X0)
| ~ organization(sK2,sK9)
| ~ organization(sK1,sK8)
| ~ greater(X4,X3)
| ~ size(sK2,X4,sK9)
| ~ size(sK1,X3,sK8)
| ~ class(sK2,X2,sK9)
| ~ class(sK1,X2,sK8)
| ~ inertia(sK2,X1,sK9)
| ~ inertia(sK1,X0,sK8) ),
inference(instantiation,[status(thm)],[c_172]) ).
tcf(c_192,plain,
! [X0: $i,X1: $i,X2: $i] :
( greater(X2,X1)
| ~ organization(sK2,sK9)
| ~ organization(sK1,sK8)
| ~ reorganization_free(sK2,sK9,sK9)
| ~ reorganization_free(sK1,sK8,sK8)
| ~ reproducibility(sK2,X2,sK9)
| ~ reproducibility(sK1,X1,sK8)
| ~ inertia(sK2,X0,sK9)
| ~ greater(X0,sK0(sK1,sK8))
| ~ inertia(sK1,sK0(sK1,sK8),sK8) ),
inference(instantiation,[status(thm)],[c_175]) ).
tcf(c_204,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( greater(X0,sK0(sK1,sK8))
| ~ organization(sK2,sK9)
| ~ organization(sK1,sK8)
| ~ greater(X3,X2)
| ~ size(sK2,X3,sK9)
| ~ size(sK1,X2,sK8)
| ~ class(sK2,X1,sK9)
| ~ class(sK1,X1,sK8)
| ~ inertia(sK2,X0,sK9)
| ~ inertia(sK1,sK0(sK1,sK8),sK8) ),
inference(instantiation,[status(thm)],[c_183]) ).
tcf(c_210,plain,
! [X0: $i,X1: $i] :
( greater(X1,X0)
| ~ organization(sK2,sK9)
| ~ organization(sK1,sK8)
| ~ reorganization_free(sK2,sK9,sK9)
| ~ reorganization_free(sK1,sK8,sK8)
| ~ reproducibility(sK2,X1,sK9)
| ~ reproducibility(sK1,X0,sK8)
| ~ inertia(sK2,sK0(sK2,sK9),sK9)
| ~ inertia(sK1,sK0(sK1,sK8),sK8)
| ~ greater(sK0(sK2,sK9),sK0(sK1,sK8)) ),
inference(instantiation,[status(thm)],[c_192]) ).
tcf(c_218,plain,
! [X0: $i] :
( greater(X0,sK4)
| ~ organization(sK2,sK9)
| ~ organization(sK1,sK8)
| ~ reproducibility(sK1,sK4,sK8)
| ~ reorganization_free(sK2,sK9,sK9)
| ~ reorganization_free(sK1,sK8,sK8)
| ~ reproducibility(sK2,X0,sK9)
| ~ inertia(sK2,sK0(sK2,sK9),sK9)
| ~ inertia(sK1,sK0(sK1,sK8),sK8)
| ~ greater(sK0(sK2,sK9),sK0(sK1,sK8)) ),
inference(instantiation,[status(thm)],[c_210]) ).
tcf(c_223,plain,
( greater(sK5,sK4)
| ~ organization(sK2,sK9)
| ~ organization(sK1,sK8)
| ~ reproducibility(sK2,sK5,sK9)
| ~ reproducibility(sK1,sK4,sK8)
| ~ reorganization_free(sK2,sK9,sK9)
| ~ reorganization_free(sK1,sK8,sK8)
| ~ inertia(sK2,sK0(sK2,sK9),sK9)
| ~ inertia(sK1,sK0(sK1,sK8),sK8)
| ~ greater(sK0(sK2,sK9),sK0(sK1,sK8)) ),
inference(instantiation,[status(thm)],[c_218]) ).
tcf(c_228,plain,
! [X0: $i,X1: $i,X2: $i] :
( greater(sK0(sK2,sK9),sK0(sK1,sK8))
| ~ organization(sK2,sK9)
| ~ organization(sK1,sK8)
| ~ greater(X2,X1)
| ~ size(sK2,X2,sK9)
| ~ size(sK1,X1,sK8)
| ~ class(sK2,X0,sK9)
| ~ class(sK1,X0,sK8)
| ~ inertia(sK2,sK0(sK2,sK9),sK9)
| ~ inertia(sK1,sK0(sK1,sK8),sK8) ),
inference(instantiation,[status(thm)],[c_204]) ).
tcf(c_234,plain,
! [X0: $i,X1: $i] :
( greater(sK0(sK2,sK9),sK0(sK1,sK8))
| ~ organization(sK2,sK9)
| ~ organization(sK1,sK8)
| ~ greater(X1,X0)
| ~ class(sK2,sK3,sK9)
| ~ class(sK1,sK3,sK8)
| ~ size(sK2,X1,sK9)
| ~ size(sK1,X0,sK8)
| ~ inertia(sK2,sK0(sK2,sK9),sK9)
| ~ inertia(sK1,sK0(sK1,sK8),sK8) ),
inference(instantiation,[status(thm)],[c_228]) ).
tcf(c_236,plain,
! [X0: $i] :
( greater(sK0(sK2,sK9),sK0(sK1,sK8))
| ~ organization(sK2,sK9)
| ~ organization(sK1,sK8)
| ~ greater(X0,sK6)
| ~ size(sK1,sK6,sK8)
| ~ class(sK2,sK3,sK9)
| ~ class(sK1,sK3,sK8)
| ~ size(sK2,X0,sK9)
| ~ inertia(sK2,sK0(sK2,sK9),sK9)
| ~ inertia(sK1,sK0(sK1,sK8),sK8) ),
inference(instantiation,[status(thm)],[c_234]) ).
tcf(c_246,plain,
( greater(sK0(sK2,sK9),sK0(sK1,sK8))
| ~ greater(sK7,sK6)
| ~ organization(sK2,sK9)
| ~ organization(sK1,sK8)
| ~ size(sK2,sK7,sK9)
| ~ size(sK1,sK6,sK8)
| ~ class(sK2,sK3,sK9)
| ~ class(sK1,sK3,sK8)
| ~ inertia(sK2,sK0(sK2,sK9),sK9)
| ~ inertia(sK1,sK0(sK1,sK8),sK8) ),
inference(instantiation,[status(thm)],[c_236]) ).
tcf(c_247,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_246,c_223,c_167,c_166,c_53,c_56,c_57,c_58,c_59,c_60,c_61,c_62,c_63,c_54,c_55,c_64]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT009+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.38 % Computer : n002.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Thu Sep 24 01:00:21 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.43
% 0.11/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.43
% 0.11/0.43 % Detected problem language: tptp
% 0.11/0.45 % Proving...
% 1.82/1.29 % SZS status Started for theBenchmark.p
% 1.82/1.29 % SZS status Theorem for theBenchmark.p
% 1.82/1.29
% 1.82/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.82/1.29
% 1.82/1.29 % ------ iProver source info
% 1.82/1.29
% 1.82/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 1.82/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.82/1.29 % git: non_committed_changes: false
% 1.82/1.29
% 1.82/1.29 % ------ Parsing...
% 1.82/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.82/1.29
% 1.82/1.29 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.82/1.29
% 1.82/1.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.82/1.29 % ------ Proving...
% 1.82/1.29 % ------ Problem Properties
% 1.82/1.29
% 1.82/1.29 %
% 1.82/1.29 % clauses 16
% 1.82/1.29 % conjectures 12
% 1.82/1.29 % EPR 15
% 1.82/1.29 % Horn 16
% 1.82/1.29 % unary 12
% 1.82/1.29 % binary 1
% 1.82/1.29 % lits 44
% 1.82/1.29 % lits eq 0
% 1.82/1.29 % fd_pure 0
% 1.82/1.29 % fd_pseudo 0
% 1.82/1.29 % fd_cond 0
% 1.82/1.29 % fd_pseudo_cond 0
% 1.82/1.29 % AC symbols 0
% 1.82/1.29
% 1.82/1.29 % ------ Schedule dynamic 5 is on
% 1.82/1.29
% 1.82/1.29 % ------ no equalities: superposition off
% 1.82/1.29
% 1.82/1.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.82/1.29
% 1.82/1.29
% 1.82/1.29 % ------
% 1.82/1.29 % Current options:
% 1.82/1.29 % ------
% 1.82/1.29
% 1.82/1.29
% 1.82/1.29 %
% 1.82/1.29
% 1.82/1.29 % ------ Proving...
% 1.82/1.29 %
% 1.82/1.29
% 1.82/1.29 % SZS status Theorem for theBenchmark.p
% 1.82/1.29
% 1.82/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.82/1.29
% 1.82/1.29
%------------------------------------------------------------------------------