%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : MGT012+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 : n013.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.85s 1.27s
% Output : CNFRefutation 1.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 7
% Syntax : Number of formulae : 81 ( 25 unt; 0 def)
% Number of atoms : 301 ( 19 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 397 ( 177 ~; 167 |; 46 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 7 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 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 203 ( 0 sgn 189 !; 14 ?; 81 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( organization(X0,X1)
=> ? [X2] : inertia(X0,X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp5) ).
fof(f3,axiom,
! [X0,X1] :
~ ( greater(X1,X0)
& greater(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp6_2) ).
fof(f4,axiom,
! [X0,X1] :
( organization(X0,X1)
=> ? [X2] : class(X0,X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp9) ).
fof(f5,axiom,
! [X0,X1,X2,X3,X4] :
( ( class(X0,X4,X2)
& class(X0,X3,X1)
& reorganization_free(X0,X1,X2)
& organization(X0,X2)
& organization(X0,X1) )
=> X3 = X4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp10) ).
fof(f6,axiom,
! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( ( greater(X4,X3)
& inertia(X1,X6,X8)
& inertia(X0,X5,X7)
& complexity(X1,X4,X8)
& complexity(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',a12_FOL) ).
fof(f7,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/sandbox/benchmark/theBenchmark.p',t2_FOL) ).
fof(f8,conjecture,
! [X0,X1,X2,X3,X4] :
( ( greater(X4,X3)
& complexity(X0,X2,X4)
& complexity(X0,X1,X3)
& reorganization_free(X0,X3,X4)
& organization(X0,X4)
& organization(X0,X3) )
=> ~ greater(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t12_FOL) ).
fof(f9,negated_conjecture,
~ ! [X0,X1,X2,X3,X4] :
( ( greater(X4,X3)
& complexity(X0,X2,X4)
& complexity(X0,X1,X3)
& reorganization_free(X0,X3,X4)
& organization(X0,X4)
& organization(X0,X3) )
=> ~ greater(X1,X2) ),
inference(negated_conjecture,[status(cth)],[f8]) ).
fof(f10,plain,
! [X0,X1] :
( ~ organization(X0,X1)
| ? [X2] : inertia(X0,X2,X1) ),
inference(ennf_transformation,[],[f1]) ).
fof(f12,plain,
! [X0,X1] :
( ~ greater(X1,X0)
| ~ greater(X0,X1) ),
inference(ennf_transformation,[],[f3]) ).
fof(f13,plain,
! [X0,X1] :
( ~ organization(X0,X1)
| ? [X2] : class(X0,X2,X1) ),
inference(ennf_transformation,[],[f4]) ).
fof(f14,plain,
! [X0,X1,X2,X3,X4] :
( ~ class(X0,X4,X2)
| ~ class(X0,X3,X1)
| ~ reorganization_free(X0,X1,X2)
| ~ organization(X0,X2)
| ~ organization(X0,X1)
| X3 = X4 ),
inference(ennf_transformation,[],[f5]) ).
fof(f15,plain,
! [X0,X1,X2,X3,X4] :
( ~ class(X0,X4,X2)
| ~ class(X0,X3,X1)
| ~ reorganization_free(X0,X1,X2)
| ~ organization(X0,X2)
| ~ organization(X0,X1)
| X3 = X4 ),
inference(flattening,[],[f14]) ).
fof(f16,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( ~ greater(X4,X3)
| ~ inertia(X1,X6,X8)
| ~ inertia(X0,X5,X7)
| ~ complexity(X1,X4,X8)
| ~ complexity(X0,X3,X7)
| ~ class(X1,X2,X8)
| ~ class(X0,X2,X7)
| ~ organization(X1,X8)
| ~ organization(X0,X7)
| greater(X6,X5) ),
inference(ennf_transformation,[],[f6]) ).
fof(f17,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( ~ greater(X4,X3)
| ~ inertia(X1,X6,X8)
| ~ inertia(X0,X5,X7)
| ~ complexity(X1,X4,X8)
| ~ complexity(X0,X3,X7)
| ~ class(X1,X2,X8)
| ~ class(X0,X2,X7)
| ~ organization(X1,X8)
| ~ organization(X0,X7)
| greater(X6,X5) ),
inference(flattening,[],[f16]) ).
fof(f18,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,[],[f7]) ).
fof(f19,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,[],[f18]) ).
fof(f20,plain,
? [X0,X1,X2,X3,X4] :
( greater(X4,X3)
& complexity(X0,X2,X4)
& complexity(X0,X1,X3)
& reorganization_free(X0,X3,X4)
& organization(X0,X4)
& organization(X0,X3)
& greater(X1,X2) ),
inference(ennf_transformation,[],[f9]) ).
fof(f21,plain,
? [X0,X1,X2,X3,X4] :
( greater(X4,X3)
& complexity(X0,X2,X4)
& complexity(X0,X1,X3)
& reorganization_free(X0,X3,X4)
& organization(X0,X4)
& organization(X0,X3)
& greater(X1,X2) ),
inference(flattening,[],[f20]) ).
fof(f22,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))],[f10]) ).
fof(f23,plain,
! [X0,X1] :
( ~ organization(X0,X1)
| class(X0,sK1(X0,X1),X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X2,sK1(X0,X1))],[f13]) ).
fof(f24,plain,
( greater(sK6,sK5)
& complexity(sK2,sK4,sK6)
& complexity(sK2,sK3,sK5)
& reorganization_free(sK2,sK5,sK6)
& organization(sK2,sK6)
& organization(sK2,sK5)
& greater(sK3,sK4) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5,sK6]),skolemize(X0,sK2),skolemize(X1,sK3),skolemize(X2,sK4),skolemize(X3,sK5),skolemize(X4,sK6)],[f21]) ).
fof(f25,plain,
! [X0,X1] :
( ~ organization(X0,X1)
| inertia(X0,sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f22]) ).
fof(f27,plain,
! [X0,X1] :
( ~ greater(X1,X0)
| ~ greater(X0,X1) ),
inference(cnf_transformation,[],[f12]) ).
fof(f28,plain,
! [X0,X1] :
( ~ organization(X0,X1)
| class(X0,sK1(X0,X1),X1) ),
inference(cnf_transformation,[],[f23]) ).
fof(f29,plain,
! [X2,X3,X0,X1,X4] :
( ~ class(X0,X4,X2)
| ~ class(X0,X3,X1)
| ~ reorganization_free(X0,X1,X2)
| ~ organization(X0,X2)
| ~ organization(X0,X1)
| X3 = X4 ),
inference(cnf_transformation,[],[f15]) ).
fof(f30,plain,
! [X2,X3,X0,X1,X8,X6,X7,X4,X5] :
( ~ greater(X4,X3)
| ~ inertia(X1,X6,X8)
| ~ inertia(X0,X5,X7)
| ~ complexity(X1,X4,X8)
| ~ complexity(X0,X3,X7)
| ~ class(X1,X2,X8)
| ~ class(X0,X2,X7)
| ~ organization(X1,X8)
| ~ organization(X0,X7)
| greater(X6,X5) ),
inference(cnf_transformation,[],[f17]) ).
fof(f31,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,[],[f19]) ).
fof(f32,plain,
greater(sK6,sK5),
inference(cnf_transformation,[],[f24]) ).
fof(f33,plain,
complexity(sK2,sK4,sK6),
inference(cnf_transformation,[],[f24]) ).
fof(f34,plain,
complexity(sK2,sK3,sK5),
inference(cnf_transformation,[],[f24]) ).
fof(f35,plain,
reorganization_free(sK2,sK5,sK6),
inference(cnf_transformation,[],[f24]) ).
fof(f36,plain,
organization(sK2,sK6),
inference(cnf_transformation,[],[f24]) ).
fof(f37,plain,
organization(sK2,sK5),
inference(cnf_transformation,[],[f24]) ).
fof(f38,plain,
greater(sK3,sK4),
inference(cnf_transformation,[],[f24]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i] :
( inertia(X0,sK0(X0,X1),X1)
| ~ organization(X0,X1) ),
inference(cnf_transformation,[],[f25]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i] :
( ~ greater(X1,X0)
| ~ greater(X0,X1) ),
inference(cnf_transformation,[],[f27]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i] :
( class(X0,sK1(X0,X1),X1)
| ~ organization(X0,X1) ),
inference(cnf_transformation,[],[f28]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( ( X1 = X3 )
| ~ organization(X0,X4)
| ~ organization(X0,X2)
| ~ reorganization_free(X0,X2,X4)
| ~ class(X0,X3,X4)
| ~ class(X0,X1,X2) ),
inference(cnf_transformation,[],[f29]) ).
tcf(c_54,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)
| ~ complexity(X3,X8,X5)
| ~ complexity(X0,X7,X2)
| ~ class(X3,X6,X5)
| ~ class(X0,X6,X2)
| ~ inertia(X3,X4,X5)
| ~ inertia(X0,X1,X2) ),
inference(cnf_transformation,[],[f30]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( greater(X3,X1)
| ~ greater(X4,X2)
| ~ organization(X0,X4)
| ~ organization(X0,X2)
| ~ reorganization_free(X0,X2,X4)
| ~ inertia(X0,X3,X4)
| ~ inertia(X0,X1,X2) ),
inference(cnf_transformation,[],[f31]) ).
tcf(c_56,negated_conjecture,
greater(sK3,sK4),
inference(cnf_transformation,[],[f38]) ).
tcf(c_57,negated_conjecture,
organization(sK2,sK5),
inference(cnf_transformation,[],[f37]) ).
tcf(c_58,negated_conjecture,
organization(sK2,sK6),
inference(cnf_transformation,[],[f36]) ).
tcf(c_59,negated_conjecture,
reorganization_free(sK2,sK5,sK6),
inference(cnf_transformation,[],[f35]) ).
tcf(c_60,negated_conjecture,
complexity(sK2,sK3,sK5),
inference(cnf_transformation,[],[f34]) ).
tcf(c_61,negated_conjecture,
complexity(sK2,sK4,sK6),
inference(cnf_transformation,[],[f33]) ).
tcf(c_62,negated_conjecture,
greater(sK6,sK5),
inference(cnf_transformation,[],[f32]) ).
tcf(c_206,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)
| ( X2 != sK6 )
| ( X1 != sK5 )
| ( X0 != sK2 ) ),
inference(resolution_lifted,[status(thm)],[c_55,c_59]) ).
tcf(c_207,plain,
! [X0: $i,X1: $i] :
( greater(X1,X0)
| ~ greater(sK6,sK5)
| ~ organization(sK2,sK6)
| ~ organization(sK2,sK5)
| ~ inertia(sK2,X1,sK6)
| ~ inertia(sK2,X0,sK5) ),
inference(unflattening,[status(thm)],[c_206]) ).
tcf(c_209,plain,
! [X0: $i,X1: $i] :
( greater(X1,X0)
| ~ inertia(sK2,X0,sK5)
| ~ inertia(sK2,X1,sK6) ),
inference(global_subsumption_just,[status(thm)],[c_207,c_62,c_58,c_57,c_207]) ).
tcf(c_210,plain,
! [X0: $i,X1: $i] :
( greater(X1,X0)
| ~ inertia(sK2,X1,sK6)
| ~ inertia(sK2,X0,sK5) ),
inference(renaming,[status(thm)],[c_209]) ).
tcf(c_221,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( ( X3 = X4 )
| ~ organization(X0,X2)
| ~ organization(X0,X1)
| ~ class(X0,X4,X2)
| ~ class(X0,X3,X1)
| ( X2 != sK6 )
| ( X1 != sK5 )
| ( X0 != sK2 ) ),
inference(resolution_lifted,[status(thm)],[c_53,c_59]) ).
tcf(c_222,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ organization(sK2,sK6)
| ~ organization(sK2,sK5)
| ~ class(sK2,X1,sK6)
| ~ class(sK2,X0,sK5) ),
inference(unflattening,[status(thm)],[c_221]) ).
tcf(c_224,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ class(sK2,X1,sK6)
| ~ class(sK2,X0,sK5) ),
inference(global_subsumption_just,[status(thm)],[c_222,c_58,c_57,c_222]) ).
tcf(c_350,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ class(sK2,X1,sK6)
| ~ class(sK2,X0,sK5) ),
inference(demodulation,[status(thm)],[c_224]) ).
tcf(c_351,plain,
! [X0: $i,X1: $i] :
( greater(X1,X0)
| ~ inertia(sK2,X1,sK6)
| ~ inertia(sK2,X0,sK5) ),
inference(demodulation,[status(thm)],[c_210]) ).
tcf(c_353,negated_conjecture,
complexity(sK2,sK4,sK6),
inference(demodulation,[status(thm)],[c_61]) ).
tcf(c_354,negated_conjecture,
complexity(sK2,sK3,sK5),
inference(demodulation,[status(thm)],[c_60]) ).
tcf(c_355,negated_conjecture,
organization(sK2,sK6),
inference(demodulation,[status(thm)],[c_58]) ).
tcf(c_356,negated_conjecture,
organization(sK2,sK5),
inference(demodulation,[status(thm)],[c_57]) ).
tcf(c_357,negated_conjecture,
greater(sK3,sK4),
inference(demodulation,[status(thm)],[c_56]) ).
tcf(c_607,plain,
! [X0: $i] :
( greater(X0,sK0(sK2,sK5))
| ~ organization(sK2,sK5)
| ~ inertia(sK2,X0,sK6) ),
inference(superposition,[status(thm)],[c_49,c_351]) ).
tcf(c_608,plain,
! [X0: $i] :
( greater(X0,sK0(sK2,sK5))
| ~ inertia(sK2,X0,sK6) ),
inference(forward_subsumption_resolution,[status(thm)],[c_607,c_356]) ).
tcf(c_622,plain,
! [X0: $i] :
( ( sK1(sK2,sK5) = X0 )
| ~ organization(sK2,sK5)
| ~ class(sK2,X0,sK6) ),
inference(superposition,[status(thm)],[c_52,c_350]) ).
tcf(c_623,plain,
! [X0: $i] :
( ( sK1(sK2,sK5) = X0 )
| ~ class(sK2,X0,sK6) ),
inference(forward_subsumption_resolution,[status(thm)],[c_622,c_356]) ).
tcf(c_647,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i,X6: $i,X7: $i] :
( greater(X1,sK0(X3,X5))
| ~ greater(X7,X6)
| ~ organization(X3,X5)
| ~ organization(X0,X2)
| ~ complexity(X3,X6,X5)
| ~ complexity(X0,X7,X2)
| ~ class(X3,X4,X5)
| ~ class(X0,X4,X2)
| ~ inertia(X0,X1,X2) ),
inference(superposition,[status(thm)],[c_49,c_54]) ).
tcf(c_662,plain,
! [X0: $i] :
( ~ inertia(sK2,X0,sK6)
| ~ greater(sK0(sK2,sK5),X0) ),
inference(superposition,[status(thm)],[c_608,c_51]) ).
tcf(c_670,plain,
( ( sK1(sK2,sK5) = sK1(sK2,sK6) )
| ~ organization(sK2,sK6) ),
inference(superposition,[status(thm)],[c_52,c_623]) ).
tcf(c_671,plain,
sK1(sK2,sK5) = sK1(sK2,sK6),
inference(forward_subsumption_resolution,[status(thm)],[c_670,c_355]) ).
tcf(c_672,plain,
( class(sK2,sK1(sK2,sK5),sK6)
| ~ organization(sK2,sK6) ),
inference(superposition,[status(thm)],[c_671,c_52]) ).
tcf(c_673,plain,
class(sK2,sK1(sK2,sK5),sK6),
inference(forward_subsumption_resolution,[status(thm)],[c_672,c_355]) ).
tcf(c_698,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i,X6: $i] :
( greater(sK0(X0,X2),sK0(X3,X4))
| ~ greater(X5,X6)
| ~ organization(X3,X4)
| ~ organization(X0,X2)
| ~ complexity(X3,X6,X4)
| ~ complexity(X0,X5,X2)
| ~ class(X3,X1,X4)
| ~ class(X0,X1,X2) ),
inference(superposition,[status(thm)],[c_49,c_647]) ).
tcf(c_723,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] :
( greater(sK0(X1,X2),sK0(X0,X3))
| ~ greater(X4,X5)
| ~ organization(X1,X2)
| ~ organization(X0,X3)
| ~ complexity(X1,X4,X2)
| ~ complexity(X0,X5,X3)
| ~ class(X0,sK1(X1,X2),X3) ),
inference(superposition,[status(thm)],[c_52,c_698]) ).
tcf(c_782,plain,
! [X0: $i,X1: $i,X2: $i] :
( greater(sK0(sK2,sK5),sK0(X0,X1))
| ~ organization(sK2,sK5)
| ~ greater(sK3,X2)
| ~ organization(X0,X1)
| ~ complexity(X0,X2,X1)
| ~ class(X0,sK1(sK2,sK5),X1) ),
inference(superposition,[status(thm)],[c_354,c_723]) ).
tcf(c_791,plain,
! [X0: $i,X1: $i,X2: $i] :
( greater(sK0(sK2,sK5),sK0(X0,X1))
| ~ greater(sK3,X2)
| ~ organization(X0,X1)
| ~ complexity(X0,X2,X1)
| ~ class(X0,sK1(sK2,sK5),X1) ),
inference(forward_subsumption_resolution,[status(thm)],[c_782,c_356]) ).
tcf(c_831,plain,
( greater(sK0(sK2,sK5),sK0(sK2,sK6))
| ~ greater(sK3,sK4)
| ~ organization(sK2,sK6)
| ~ class(sK2,sK1(sK2,sK5),sK6) ),
inference(superposition,[status(thm)],[c_353,c_791]) ).
tcf(c_832,plain,
greater(sK0(sK2,sK5),sK0(sK2,sK6)),
inference(forward_subsumption_resolution,[status(thm)],[c_831,c_357,c_355,c_673]) ).
tcf(c_834,plain,
~ inertia(sK2,sK0(sK2,sK6),sK6),
inference(superposition,[status(thm)],[c_832,c_662]) ).
tcf(c_840,plain,
~ organization(sK2,sK6),
inference(superposition,[status(thm)],[c_49,c_834]) ).
tcf(c_841,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_840,c_355]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT012+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.07/0.35 % Computer : n013.cluster.edu
% 0.07/0.35 % Model : x86_64 x86_64
% 0.07/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35 % Memory : 8046.5625MB
% 0.07/0.35 % OS : Linux 6.8.0-71-generic
% 0.07/0.35 % CPULimit : 300
% 0.07/0.35 % WCLimit : 300
% 0.07/0.35 % DateTime : Thu Sep 24 00:59:06 UTC 2026
% 0.07/0.36 % CPUTime :
% 0.07/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.39 Running first-order theorem proving
% 0.12/0.40 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.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...
% 1.85/1.27 % SZS status Started for theBenchmark.p
% 1.85/1.27 % SZS status Theorem for theBenchmark.p
% 1.85/1.27
% 1.85/1.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.85/1.27
% 1.85/1.27 % ------ iProver source info
% 1.85/1.27
% 1.85/1.27 % git: date: 2026-07-19 20:42:38 +0200
% 1.85/1.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.85/1.27 % git: non_committed_changes: false
% 1.85/1.27
% 1.85/1.27 % ------ Parsing...
% 1.85/1.27 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.85/1.27
% 1.85/1.27 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e %
% 1.85/1.27
% 1.85/1.27 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.85/1.27
% 1.85/1.27 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.85/1.27 % ------ Proving...
% 1.85/1.27 % ------ Problem Properties
% 1.85/1.27
% 1.85/1.27 %
% 1.85/1.27 % clauses 13
% 1.85/1.27 % conjectures 6
% 1.85/1.27 % EPR 11
% 1.85/1.27 % Horn 13
% 1.85/1.27 % unary 7
% 1.85/1.27 % binary 3
% 1.85/1.27 % lits 29
% 1.85/1.27 % lits eq 1
% 1.85/1.27 % fd_pure 0
% 1.85/1.27 % fd_pseudo 0
% 1.85/1.27 % fd_cond 0
% 1.85/1.27 % fd_pseudo_cond 1
% 1.85/1.27 % AC symbols 0
% 1.85/1.27
% 1.85/1.27 % ------ Schedule dynamic 5 is on
% 1.85/1.27
% 1.85/1.27 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.85/1.27
% 1.85/1.27
% 1.85/1.27 % ------
% 1.85/1.27 % Current options:
% 1.85/1.27 % ------
% 1.85/1.27
% 1.85/1.27
% 1.85/1.27 %
% 1.85/1.27
% 1.85/1.27 % ------ Proving...
% 1.85/1.27 %
% 1.85/1.27
% 1.85/1.27 % SZS status Theorem for theBenchmark.p
% 1.85/1.27
% 1.85/1.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.85/1.27
% 1.85/1.27
%------------------------------------------------------------------------------