TSTP Solution File: MGT014+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : MGT014+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n023.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:10 EDT 2023
% Result : Theorem 2.17s 1.16s
% Output : CNFRefutation 2.17s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f53)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] :
~ ( greater(X1,X0)
& greater(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp6_2) ).
fof(f3,axiom,
! [X0,X2] :
( organization(X0,X2)
=> time(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp15) ).
fof(f4,axiom,
! [X3,X4] :
( ( time(X4)
& time(X3) )
=> ( greater(X4,X3)
| X3 = X4
| greater(X3,X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp16) ).
fof(f5,axiom,
! [X0,X3,X4] :
( reorganization_free(X0,X3,X4)
=> reorganization_free(X0,X4,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp17) ).
fof(f7,axiom,
! [X0,X5,X6,X3,X4] :
( ( greater(X4,X3)
& size(X0,X6,X4)
& size(X0,X5,X3)
& reorganization_free(X0,X3,X4)
& organization(X0,X4)
& organization(X0,X3) )
=> ~ greater(X5,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t11_FOL) ).
fof(f8,axiom,
! [X0,X7,X8,X3,X4] :
( ( greater(X4,X3)
& complexity(X0,X8,X4)
& complexity(X0,X7,X3)
& reorganization_free(X0,X3,X4)
& organization(X0,X4)
& organization(X0,X3) )
=> ~ greater(X7,X8) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12_FOL) ).
fof(f9,conjecture,
! [X0,X7,X8,X5,X6,X3,X4] :
( ( greater(X6,X5)
& size(X0,X6,X4)
& size(X0,X5,X3)
& complexity(X0,X8,X4)
& complexity(X0,X7,X3)
& reorganization_free(X0,X3,X4)
& organization(X0,X4)
& organization(X0,X3) )
=> ~ greater(X7,X8) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t14_FOL) ).
fof(f10,negated_conjecture,
~ ! [X0,X7,X8,X5,X6,X3,X4] :
( ( greater(X6,X5)
& size(X0,X6,X4)
& size(X0,X5,X3)
& complexity(X0,X8,X4)
& complexity(X0,X7,X3)
& reorganization_free(X0,X3,X4)
& organization(X0,X4)
& organization(X0,X3) )
=> ~ greater(X7,X8) ),
inference(negated_conjecture,[],[f9]) ).
fof(f11,plain,
! [X0,X1] :
( organization(X0,X1)
=> time(X1) ),
inference(rectify,[],[f3]) ).
fof(f12,plain,
! [X0,X1] :
( ( time(X1)
& time(X0) )
=> ( greater(X1,X0)
| X0 = X1
| greater(X0,X1) ) ),
inference(rectify,[],[f4]) ).
fof(f13,plain,
! [X0,X1,X2] :
( reorganization_free(X0,X1,X2)
=> reorganization_free(X0,X2,X1) ),
inference(rectify,[],[f5]) ).
fof(f15,plain,
! [X0,X1,X2,X3,X4] :
( ( greater(X4,X3)
& size(X0,X2,X4)
& size(X0,X1,X3)
& reorganization_free(X0,X3,X4)
& organization(X0,X4)
& organization(X0,X3) )
=> ~ greater(X1,X2) ),
inference(rectify,[],[f7]) ).
fof(f16,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(rectify,[],[f8]) ).
fof(f17,plain,
~ ! [X0,X1,X2,X3,X4,X5,X6] :
( ( greater(X4,X3)
& size(X0,X4,X6)
& size(X0,X3,X5)
& complexity(X0,X2,X6)
& complexity(X0,X1,X5)
& reorganization_free(X0,X5,X6)
& organization(X0,X6)
& organization(X0,X5) )
=> ~ greater(X1,X2) ),
inference(rectify,[],[f10]) ).
fof(f19,plain,
! [X0,X1] :
( ~ greater(X1,X0)
| ~ greater(X0,X1) ),
inference(ennf_transformation,[],[f2]) ).
fof(f20,plain,
! [X0,X1] :
( time(X1)
| ~ organization(X0,X1) ),
inference(ennf_transformation,[],[f11]) ).
fof(f21,plain,
! [X0,X1] :
( greater(X1,X0)
| X0 = X1
| greater(X0,X1)
| ~ time(X1)
| ~ time(X0) ),
inference(ennf_transformation,[],[f12]) ).
fof(f22,plain,
! [X0,X1] :
( greater(X1,X0)
| X0 = X1
| greater(X0,X1)
| ~ time(X1)
| ~ time(X0) ),
inference(flattening,[],[f21]) ).
fof(f23,plain,
! [X0,X1,X2] :
( reorganization_free(X0,X2,X1)
| ~ reorganization_free(X0,X1,X2) ),
inference(ennf_transformation,[],[f13]) ).
fof(f26,plain,
! [X0,X1,X2,X3,X4] :
( ~ greater(X1,X2)
| ~ greater(X4,X3)
| ~ size(X0,X2,X4)
| ~ size(X0,X1,X3)
| ~ reorganization_free(X0,X3,X4)
| ~ organization(X0,X4)
| ~ organization(X0,X3) ),
inference(ennf_transformation,[],[f15]) ).
fof(f27,plain,
! [X0,X1,X2,X3,X4] :
( ~ greater(X1,X2)
| ~ greater(X4,X3)
| ~ size(X0,X2,X4)
| ~ size(X0,X1,X3)
| ~ reorganization_free(X0,X3,X4)
| ~ organization(X0,X4)
| ~ organization(X0,X3) ),
inference(flattening,[],[f26]) ).
fof(f28,plain,
! [X0,X1,X2,X3,X4] :
( ~ greater(X1,X2)
| ~ greater(X4,X3)
| ~ complexity(X0,X2,X4)
| ~ complexity(X0,X1,X3)
| ~ reorganization_free(X0,X3,X4)
| ~ organization(X0,X4)
| ~ organization(X0,X3) ),
inference(ennf_transformation,[],[f16]) ).
fof(f29,plain,
! [X0,X1,X2,X3,X4] :
( ~ greater(X1,X2)
| ~ greater(X4,X3)
| ~ complexity(X0,X2,X4)
| ~ complexity(X0,X1,X3)
| ~ reorganization_free(X0,X3,X4)
| ~ organization(X0,X4)
| ~ organization(X0,X3) ),
inference(flattening,[],[f28]) ).
fof(f30,plain,
? [X0,X1,X2,X3,X4,X5,X6] :
( greater(X1,X2)
& greater(X4,X3)
& size(X0,X4,X6)
& size(X0,X3,X5)
& complexity(X0,X2,X6)
& complexity(X0,X1,X5)
& reorganization_free(X0,X5,X6)
& organization(X0,X6)
& organization(X0,X5) ),
inference(ennf_transformation,[],[f17]) ).
fof(f31,plain,
? [X0,X1,X2,X3,X4,X5,X6] :
( greater(X1,X2)
& greater(X4,X3)
& size(X0,X4,X6)
& size(X0,X3,X5)
& complexity(X0,X2,X6)
& complexity(X0,X1,X5)
& reorganization_free(X0,X5,X6)
& organization(X0,X6)
& organization(X0,X5) ),
inference(flattening,[],[f30]) ).
fof(f32,plain,
( ? [X0,X1,X2,X3,X4,X5,X6] :
( greater(X1,X2)
& greater(X4,X3)
& size(X0,X4,X6)
& size(X0,X3,X5)
& complexity(X0,X2,X6)
& complexity(X0,X1,X5)
& reorganization_free(X0,X5,X6)
& organization(X0,X6)
& organization(X0,X5) )
=> ( greater(sK1,sK2)
& greater(sK4,sK3)
& size(sK0,sK4,sK6)
& size(sK0,sK3,sK5)
& complexity(sK0,sK2,sK6)
& complexity(sK0,sK1,sK5)
& reorganization_free(sK0,sK5,sK6)
& organization(sK0,sK6)
& organization(sK0,sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f33,plain,
( greater(sK1,sK2)
& greater(sK4,sK3)
& size(sK0,sK4,sK6)
& size(sK0,sK3,sK5)
& complexity(sK0,sK2,sK6)
& complexity(sK0,sK1,sK5)
& reorganization_free(sK0,sK5,sK6)
& organization(sK0,sK6)
& organization(sK0,sK5) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6])],[f31,f32]) ).
fof(f35,plain,
! [X0,X1] :
( ~ greater(X1,X0)
| ~ greater(X0,X1) ),
inference(cnf_transformation,[],[f19]) ).
fof(f36,plain,
! [X0,X1] :
( time(X1)
| ~ organization(X0,X1) ),
inference(cnf_transformation,[],[f20]) ).
fof(f37,plain,
! [X0,X1] :
( greater(X1,X0)
| X0 = X1
| greater(X0,X1)
| ~ time(X1)
| ~ time(X0) ),
inference(cnf_transformation,[],[f22]) ).
fof(f38,plain,
! [X2,X0,X1] :
( reorganization_free(X0,X2,X1)
| ~ reorganization_free(X0,X1,X2) ),
inference(cnf_transformation,[],[f23]) ).
fof(f40,plain,
! [X2,X3,X0,X1,X4] :
( ~ greater(X1,X2)
| ~ greater(X4,X3)
| ~ size(X0,X2,X4)
| ~ size(X0,X1,X3)
| ~ reorganization_free(X0,X3,X4)
| ~ organization(X0,X4)
| ~ organization(X0,X3) ),
inference(cnf_transformation,[],[f27]) ).
fof(f41,plain,
! [X2,X3,X0,X1,X4] :
( ~ greater(X1,X2)
| ~ greater(X4,X3)
| ~ complexity(X0,X2,X4)
| ~ complexity(X0,X1,X3)
| ~ reorganization_free(X0,X3,X4)
| ~ organization(X0,X4)
| ~ organization(X0,X3) ),
inference(cnf_transformation,[],[f29]) ).
fof(f42,plain,
organization(sK0,sK5),
inference(cnf_transformation,[],[f33]) ).
fof(f43,plain,
organization(sK0,sK6),
inference(cnf_transformation,[],[f33]) ).
fof(f44,plain,
reorganization_free(sK0,sK5,sK6),
inference(cnf_transformation,[],[f33]) ).
fof(f45,plain,
complexity(sK0,sK1,sK5),
inference(cnf_transformation,[],[f33]) ).
fof(f46,plain,
complexity(sK0,sK2,sK6),
inference(cnf_transformation,[],[f33]) ).
fof(f47,plain,
size(sK0,sK3,sK5),
inference(cnf_transformation,[],[f33]) ).
fof(f48,plain,
size(sK0,sK4,sK6),
inference(cnf_transformation,[],[f33]) ).
fof(f49,plain,
greater(sK4,sK3),
inference(cnf_transformation,[],[f33]) ).
fof(f50,plain,
greater(sK1,sK2),
inference(cnf_transformation,[],[f33]) ).
cnf(c_50,plain,
( ~ greater(X0,X1)
| ~ greater(X1,X0) ),
inference(cnf_transformation,[],[f35]) ).
cnf(c_51,plain,
( ~ organization(X0,X1)
| time(X1) ),
inference(cnf_transformation,[],[f36]) ).
cnf(c_52,plain,
( ~ time(X0)
| ~ time(X1)
| X0 = X1
| greater(X0,X1)
| greater(X1,X0) ),
inference(cnf_transformation,[],[f37]) ).
cnf(c_53,plain,
( ~ reorganization_free(X0,X1,X2)
| reorganization_free(X0,X2,X1) ),
inference(cnf_transformation,[],[f38]) ).
cnf(c_54,plain,
( ~ size(X0,X1,X2)
| ~ size(X0,X3,X2)
| ~ organization(X0,X2)
| X1 = X3 ),
inference(cnf_transformation,[],[f53]) ).
cnf(c_55,plain,
( ~ reorganization_free(X0,X1,X2)
| ~ size(X0,X3,X1)
| ~ size(X0,X4,X2)
| ~ greater(X2,X1)
| ~ greater(X3,X4)
| ~ organization(X0,X1)
| ~ organization(X0,X2) ),
inference(cnf_transformation,[],[f40]) ).
cnf(c_56,plain,
( ~ reorganization_free(X0,X1,X2)
| ~ complexity(X0,X3,X1)
| ~ complexity(X0,X4,X2)
| ~ greater(X2,X1)
| ~ greater(X3,X4)
| ~ organization(X0,X1)
| ~ organization(X0,X2) ),
inference(cnf_transformation,[],[f41]) ).
cnf(c_57,negated_conjecture,
greater(sK1,sK2),
inference(cnf_transformation,[],[f50]) ).
cnf(c_58,negated_conjecture,
greater(sK4,sK3),
inference(cnf_transformation,[],[f49]) ).
cnf(c_59,negated_conjecture,
size(sK0,sK4,sK6),
inference(cnf_transformation,[],[f48]) ).
cnf(c_60,negated_conjecture,
size(sK0,sK3,sK5),
inference(cnf_transformation,[],[f47]) ).
cnf(c_61,negated_conjecture,
complexity(sK0,sK2,sK6),
inference(cnf_transformation,[],[f46]) ).
cnf(c_62,negated_conjecture,
complexity(sK0,sK1,sK5),
inference(cnf_transformation,[],[f45]) ).
cnf(c_63,negated_conjecture,
reorganization_free(sK0,sK5,sK6),
inference(cnf_transformation,[],[f44]) ).
cnf(c_64,negated_conjecture,
organization(sK0,sK6),
inference(cnf_transformation,[],[f43]) ).
cnf(c_65,negated_conjecture,
organization(sK0,sK5),
inference(cnf_transformation,[],[f42]) ).
cnf(c_143,plain,
( ~ reorganization_free(X0_13,X0_14,X1_14)
| ~ complexity(X0_13,X2_14,X0_14)
| ~ complexity(X0_13,X3_14,X1_14)
| ~ greater(X1_14,X0_14)
| ~ greater(X2_14,X3_14)
| ~ organization(X0_13,X0_14)
| ~ organization(X0_13,X1_14) ),
inference(subtyping,[status(esa)],[c_56]) ).
cnf(c_144,plain,
( ~ reorganization_free(X0_13,X0_14,X1_14)
| ~ size(X0_13,X2_14,X0_14)
| ~ size(X0_13,X3_14,X1_14)
| ~ greater(X1_14,X0_14)
| ~ greater(X2_14,X3_14)
| ~ organization(X0_13,X0_14)
| ~ organization(X0_13,X1_14) ),
inference(subtyping,[status(esa)],[c_55]) ).
cnf(c_145,plain,
( ~ size(X0_13,X0_14,X1_14)
| ~ size(X0_13,X2_14,X1_14)
| ~ organization(X0_13,X1_14)
| X0_14 = X2_14 ),
inference(subtyping,[status(esa)],[c_54]) ).
cnf(c_146,plain,
( ~ reorganization_free(X0_13,X0_14,X1_14)
| reorganization_free(X0_13,X1_14,X0_14) ),
inference(subtyping,[status(esa)],[c_53]) ).
cnf(c_147,plain,
( ~ time(X0_14)
| ~ time(X1_14)
| X1_14 = X0_14
| greater(X0_14,X1_14)
| greater(X1_14,X0_14) ),
inference(subtyping,[status(esa)],[c_52]) ).
cnf(c_148,plain,
( ~ organization(X0_13,X0_14)
| time(X0_14) ),
inference(subtyping,[status(esa)],[c_51]) ).
cnf(c_149,plain,
( ~ greater(X0_14,X1_14)
| ~ greater(X1_14,X0_14) ),
inference(subtyping,[status(esa)],[c_50]) ).
cnf(c_154,plain,
( X0_14 != X1_14
| X2_14 != X3_14
| ~ greater(X1_14,X3_14)
| greater(X0_14,X2_14) ),
theory(equality) ).
cnf(c_157,plain,
( X0_14 != X1_14
| X2_14 != X3_14
| ~ size(X0_13,X1_14,X3_14)
| size(X0_13,X0_14,X2_14) ),
theory(equality) ).
cnf(c_163,plain,
( ~ organization(sK0,sK5)
| time(sK5) ),
inference(instantiation,[status(thm)],[c_148]) ).
cnf(c_165,plain,
( ~ reorganization_free(sK0,sK5,sK6)
| reorganization_free(sK0,sK6,sK5) ),
inference(instantiation,[status(thm)],[c_146]) ).
cnf(c_171,plain,
( ~ reorganization_free(X0_13,X0_14,X1_14)
| ~ size(X0_13,sK4,X0_14)
| ~ size(X0_13,sK3,X1_14)
| ~ greater(X1_14,X0_14)
| ~ organization(X0_13,X0_14)
| ~ organization(X0_13,X1_14)
| ~ greater(sK4,sK3) ),
inference(instantiation,[status(thm)],[c_144]) ).
cnf(c_172,plain,
( ~ size(sK0,X0_14,sK6)
| ~ size(sK0,sK4,sK6)
| ~ organization(sK0,sK6)
| X0_14 = sK4 ),
inference(instantiation,[status(thm)],[c_145]) ).
cnf(c_174,plain,
( ~ size(sK0,X0_14,sK5)
| ~ size(sK0,sK3,sK5)
| ~ organization(sK0,sK5)
| X0_14 = sK3 ),
inference(instantiation,[status(thm)],[c_145]) ).
cnf(c_184,plain,
( X0_14 != sK3
| X1_14 != sK5
| ~ size(sK0,sK3,sK5)
| size(sK0,X0_14,X1_14) ),
inference(instantiation,[status(thm)],[c_157]) ).
cnf(c_210,plain,
( ~ size(sK0,sK3,sK5)
| ~ organization(sK0,sK5)
| sK3 = sK3 ),
inference(instantiation,[status(thm)],[c_174]) ).
cnf(c_250,plain,
( X0_14 != sK5
| sK3 != sK3
| ~ size(sK0,sK3,sK5)
| size(sK0,sK3,X0_14) ),
inference(instantiation,[status(thm)],[c_184]) ).
cnf(c_270,plain,
( ~ time(X0_14)
| ~ time(sK6)
| sK6 = X0_14
| greater(X0_14,sK6)
| greater(sK6,X0_14) ),
inference(instantiation,[status(thm)],[c_147]) ).
cnf(c_271,plain,
( ~ time(sK6)
| ~ time(sK5)
| sK6 = sK5
| greater(sK6,sK5)
| greater(sK5,sK6) ),
inference(instantiation,[status(thm)],[c_270]) ).
cnf(c_302,plain,
( ~ organization(X0_13,sK6)
| time(sK6) ),
inference(instantiation,[status(thm)],[c_148]) ).
cnf(c_303,plain,
( ~ organization(sK0,sK6)
| time(sK6) ),
inference(instantiation,[status(thm)],[c_302]) ).
cnf(c_345,plain,
( sK3 != sK3
| sK6 != sK5
| ~ size(sK0,sK3,sK5)
| size(sK0,sK3,sK6) ),
inference(instantiation,[status(thm)],[c_250]) ).
cnf(c_346,plain,
( ~ size(sK0,sK4,sK6)
| ~ size(sK0,sK3,sK6)
| ~ organization(sK0,sK6)
| sK3 = sK4 ),
inference(instantiation,[status(thm)],[c_172]) ).
cnf(c_374,plain,
( ~ reorganization_free(X0_13,sK6,X0_14)
| ~ size(X0_13,sK3,X0_14)
| ~ size(X0_13,sK4,sK6)
| ~ organization(X0_13,X0_14)
| ~ greater(X0_14,sK6)
| ~ organization(X0_13,sK6)
| ~ greater(sK4,sK3) ),
inference(instantiation,[status(thm)],[c_171]) ).
cnf(c_383,plain,
( ~ reorganization_free(sK0,sK6,sK5)
| ~ size(sK0,sK4,sK6)
| ~ size(sK0,sK3,sK5)
| ~ greater(sK4,sK3)
| ~ greater(sK5,sK6)
| ~ organization(sK0,sK6)
| ~ organization(sK0,sK5) ),
inference(instantiation,[status(thm)],[c_374]) ).
cnf(c_415,plain,
( ~ reorganization_free(X0_13,X0_14,X1_14)
| ~ complexity(X0_13,sK1,X0_14)
| ~ complexity(X0_13,sK2,X1_14)
| ~ greater(X1_14,X0_14)
| ~ organization(X0_13,X0_14)
| ~ organization(X0_13,X1_14)
| ~ greater(sK1,sK2) ),
inference(instantiation,[status(thm)],[c_143]) ).
cnf(c_422,plain,
( X0_14 != sK4
| X1_14 != sK3
| ~ greater(sK4,sK3)
| greater(X0_14,X1_14) ),
inference(instantiation,[status(thm)],[c_154]) ).
cnf(c_445,plain,
( X0_14 != sK4
| sK3 != sK3
| ~ greater(sK4,sK3)
| greater(X0_14,sK3) ),
inference(instantiation,[status(thm)],[c_422]) ).
cnf(c_516,plain,
( ~ reorganization_free(X0_13,X0_14,sK6)
| ~ complexity(X0_13,sK1,X0_14)
| ~ complexity(X0_13,sK2,sK6)
| ~ organization(X0_13,X0_14)
| ~ greater(sK6,X0_14)
| ~ organization(X0_13,sK6)
| ~ greater(sK1,sK2) ),
inference(instantiation,[status(thm)],[c_415]) ).
cnf(c_518,plain,
( ~ reorganization_free(sK0,sK5,sK6)
| ~ complexity(sK0,sK1,sK5)
| ~ complexity(sK0,sK2,sK6)
| ~ greater(sK1,sK2)
| ~ greater(sK6,sK5)
| ~ organization(sK0,sK6)
| ~ organization(sK0,sK5) ),
inference(instantiation,[status(thm)],[c_516]) ).
cnf(c_872,plain,
( sK3 != sK4
| sK3 != sK3
| ~ greater(sK4,sK3)
| greater(sK3,sK3) ),
inference(instantiation,[status(thm)],[c_445]) ).
cnf(c_1098,plain,
~ greater(sK3,sK3),
inference(instantiation,[status(thm)],[c_149]) ).
cnf(c_1099,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1098,c_872,c_518,c_383,c_346,c_345,c_303,c_271,c_210,c_165,c_163,c_59,c_60,c_61,c_62,c_63,c_57,c_58,c_64,c_65]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT014+1 : TPTP v8.1.2. Released v2.0.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n023.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Aug 28 06:48:26 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.17/1.16 % SZS status Started for theBenchmark.p
% 2.17/1.16 % SZS status Theorem for theBenchmark.p
% 2.17/1.16
% 2.17/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.17/1.16
% 2.17/1.16 ------ iProver source info
% 2.17/1.16
% 2.17/1.16 git: date: 2023-05-31 18:12:56 +0000
% 2.17/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.17/1.16 git: non_committed_changes: false
% 2.17/1.16 git: last_make_outside_of_git: false
% 2.17/1.16
% 2.17/1.16 ------ Parsing...
% 2.17/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Option_epr_non_horn_eq
% 2.17/1.16
% 2.17/1.16
% 2.17/1.16 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 2.17/1.16
% 2.17/1.16 ------ Preprocessing...------ preprocesses with Option_epr_non_horn_eq
% 2.17/1.16 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e ------ preprocesses with Option_epr_non_horn_eq
% 2.17/1.16
% 2.17/1.16
% 2.17/1.16 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.17/1.16 ------ Proving...
% 2.17/1.16 ------ Problem Properties
% 2.17/1.16
% 2.17/1.16
% 2.17/1.16 clauses 17
% 2.17/1.16 conjectures 9
% 2.17/1.16 EPR 17
% 2.17/1.16 Horn 16
% 2.17/1.16 unary 10
% 2.17/1.16 binary 3
% 2.17/1.16 lits 39
% 2.17/1.16 lits eq 2
% 2.17/1.16 fd_pure 0
% 2.17/1.16 fd_pseudo 0
% 2.17/1.16 fd_cond 0
% 2.17/1.16 fd_pseudo_cond 2
% 2.17/1.16 AC symbols 0
% 2.17/1.16
% 2.17/1.16 ------ Schedule EPR non Horn eq is on
% 2.17/1.16
% 2.17/1.16 ------ Option_epr_non_horn_eq Time Limit: Unbounded
% 2.17/1.16
% 2.17/1.16
% 2.17/1.16 ------
% 2.17/1.16 Current options:
% 2.17/1.16 ------
% 2.17/1.16
% 2.17/1.16
% 2.17/1.16
% 2.17/1.16
% 2.17/1.16 ------ Proving...
% 2.17/1.16
% 2.17/1.16
% 2.17/1.16 % SZS status Theorem for theBenchmark.p
% 2.17/1.16
% 2.17/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.17/1.16
% 2.17/1.16
%------------------------------------------------------------------------------