TSTP Solution File: PLA054_4 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : PLA054_4 : TPTP v8.2.0. Released v8.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n010.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:53:59 EDT 2024
% Result : Theorem 0.76s 1.13s
% Output : CNFRefutation 0.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of formulae : 51 ( 12 unt; 0 typ; 0 def)
% Number of atoms : 373 ( 0 equ)
% Maximal formula atoms : 26 ( 7 avg)
% Number of connectives : 404 ( 162 ~; 149 |; 55 &)
% ( 0 <=>; 38 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 7 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 80 ( 80 fml; 0 var)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 14 ( 13 usr; 7 prp; 0-3 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 157 ( 6 sgn 102 !; 19 ?; 82 :)
% Comments :
%------------------------------------------------------------------------------
tff(f1,axiom,
! [X0: '$ki_world'] : '$ki_accessible'(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mrel_reflexive) ).
tff(f3,axiom,
! [X0: '$ki_world',X3] : '$ki_exists_in_world_$i'(X0,X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','$ki_exists_in_world_$i_const') ).
tff(f5,axiom,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ! [X4] :
( '$ki_exists_in_world_$i'(X0,X4)
=> ! [X1] :
( '$ki_exists_in_world_$i'(X0,X1)
=> ? [X5] :
( ! [X6: '$ki_world'] :
( '$ki_accessible'(X0,X6)
=> ( ( h(X6,o)
& ~ combo(X6,X4,X1)
& closed(X6,X4) )
=> ! [X7: '$ki_world'] :
( '$ki_accessible'(X6,X7)
=> closed(X7,X4) ) ) )
& ! [X6: '$ki_world'] :
( '$ki_accessible'(X0,X6)
=> ( ( h(X6,X5)
& combo(X6,X4,X1)
& closed(X6,X4) )
=> ! [X7: '$ki_world'] :
( '$ki_accessible'(X6,X7)
=> open(X7,X4) ) ) )
& '$ki_exists_in_world_$i'(X0,X5) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax1) ).
tff(f6,axiom,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> closed(X0,d) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax2) ).
tff(f8,axiom,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ! [X4] :
( '$ki_exists_in_world_$i'(X0,X4)
=> ~ ( closed(X0,X4)
& open(X0,X4) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax4) ).
tff(f10,conjecture,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ? [X1] :
( ? [X5] :
( ( ! [X6: '$ki_world'] :
( '$ki_accessible'(X0,X6)
=> ( h(X6,X5)
& combo(X6,d,X1) ) )
=> ! [X6: '$ki_world'] :
( '$ki_accessible'(X0,X6)
=> open(X6,d) ) )
& '$ki_exists_in_world_$i'(X0,X5) )
& '$ki_exists_in_world_$i'(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verify) ).
tff(f11,negated_conjecture,
~ ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ? [X1] :
( ? [X5] :
( ( ! [X6: '$ki_world'] :
( '$ki_accessible'(X0,X6)
=> ( h(X6,X5)
& combo(X6,d,X1) ) )
=> ! [X6: '$ki_world'] :
( '$ki_accessible'(X0,X6)
=> open(X6,d) ) )
& '$ki_exists_in_world_$i'(X0,X5) )
& '$ki_exists_in_world_$i'(X0,X1) ) ),
inference(negated_conjecture,[],[f10]) ).
tff(f12,plain,
! [X0: '$ki_world',X1] : '$ki_exists_in_world_$i'(X0,X1),
inference(rectify,[],[f3]) ).
tff(f14,plain,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ! [X1] :
( '$ki_exists_in_world_$i'(X0,X1)
=> ! [X2] :
( '$ki_exists_in_world_$i'(X0,X2)
=> ? [X3] :
( ! [X4: '$ki_world'] :
( '$ki_accessible'(X0,X4)
=> ( ( h(X4,o)
& ~ combo(X4,X1,X2)
& closed(X4,X1) )
=> ! [X5: '$ki_world'] :
( '$ki_accessible'(X4,X5)
=> closed(X5,X1) ) ) )
& ! [X6: '$ki_world'] :
( '$ki_accessible'(X0,X6)
=> ( ( h(X6,X3)
& combo(X6,X1,X2)
& closed(X6,X1) )
=> ! [X7: '$ki_world'] :
( '$ki_accessible'(X6,X7)
=> open(X7,X1) ) ) )
& '$ki_exists_in_world_$i'(X0,X3) ) ) ) ),
inference(rectify,[],[f5]) ).
tff(f15,plain,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ! [X1] :
( '$ki_exists_in_world_$i'(X0,X1)
=> ~ ( closed(X0,X1)
& open(X0,X1) ) ) ),
inference(rectify,[],[f8]) ).
tff(f17,plain,
~ ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ? [X1] :
( ? [X2] :
( ( ! [X3: '$ki_world'] :
( '$ki_accessible'(X0,X3)
=> ( h(X3,X2)
& combo(X3,d,X1) ) )
=> ! [X4: '$ki_world'] :
( '$ki_accessible'(X0,X4)
=> open(X4,d) ) )
& '$ki_exists_in_world_$i'(X0,X2) )
& '$ki_exists_in_world_$i'(X0,X1) ) ),
inference(rectify,[],[f11]) ).
tff(f20,plain,
! [X0: '$ki_world'] :
( ! [X1] :
( ! [X2] :
( ? [X3] :
( ! [X4: '$ki_world'] :
( ! [X5: '$ki_world'] :
( closed(X5,X1)
| ~ '$ki_accessible'(X4,X5) )
| ~ h(X4,o)
| combo(X4,X1,X2)
| ~ closed(X4,X1)
| ~ '$ki_accessible'(X0,X4) )
& ! [X6: '$ki_world'] :
( ! [X7: '$ki_world'] :
( open(X7,X1)
| ~ '$ki_accessible'(X6,X7) )
| ~ h(X6,X3)
| ~ combo(X6,X1,X2)
| ~ closed(X6,X1)
| ~ '$ki_accessible'(X0,X6) )
& '$ki_exists_in_world_$i'(X0,X3) )
| ~ '$ki_exists_in_world_$i'(X0,X2) )
| ~ '$ki_exists_in_world_$i'(X0,X1) )
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(ennf_transformation,[],[f14]) ).
tff(f21,plain,
! [X0: '$ki_world'] :
( ! [X1] :
( ! [X2] :
( ? [X3] :
( ! [X4: '$ki_world'] :
( ! [X5: '$ki_world'] :
( closed(X5,X1)
| ~ '$ki_accessible'(X4,X5) )
| ~ h(X4,o)
| combo(X4,X1,X2)
| ~ closed(X4,X1)
| ~ '$ki_accessible'(X0,X4) )
& ! [X6: '$ki_world'] :
( ! [X7: '$ki_world'] :
( open(X7,X1)
| ~ '$ki_accessible'(X6,X7) )
| ~ h(X6,X3)
| ~ combo(X6,X1,X2)
| ~ closed(X6,X1)
| ~ '$ki_accessible'(X0,X6) )
& '$ki_exists_in_world_$i'(X0,X3) )
| ~ '$ki_exists_in_world_$i'(X0,X2) )
| ~ '$ki_exists_in_world_$i'(X0,X1) )
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(flattening,[],[f20]) ).
tff(f22,plain,
! [X0: '$ki_world'] :
( closed(X0,d)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(ennf_transformation,[],[f6]) ).
tff(f25,plain,
! [X0: '$ki_world'] :
( ! [X1] :
( ~ closed(X0,X1)
| ~ open(X0,X1)
| ~ '$ki_exists_in_world_$i'(X0,X1) )
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(ennf_transformation,[],[f15]) ).
tff(f26,plain,
! [X0: '$ki_world'] :
( ! [X1] :
( ~ closed(X0,X1)
| ~ open(X0,X1)
| ~ '$ki_exists_in_world_$i'(X0,X1) )
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(flattening,[],[f25]) ).
tff(f28,plain,
? [X0: '$ki_world'] :
( ! [X1] :
( ! [X2] :
( ( ? [X4: '$ki_world'] :
( ~ open(X4,d)
& '$ki_accessible'(X0,X4) )
& ! [X3: '$ki_world'] :
( ( h(X3,X2)
& combo(X3,d,X1) )
| ~ '$ki_accessible'(X0,X3) ) )
| ~ '$ki_exists_in_world_$i'(X0,X2) )
| ~ '$ki_exists_in_world_$i'(X0,X1) )
& '$ki_accessible'('$ki_local_world',X0) ),
inference(ennf_transformation,[],[f17]) ).
tff(f31,plain,
! [X0: '$ki_world',X1,X2] :
( ? [X3] :
( ! [X4: '$ki_world'] :
( ! [X5: '$ki_world'] :
( closed(X5,X1)
| ~ '$ki_accessible'(X4,X5) )
| ~ h(X4,o)
| combo(X4,X1,X2)
| ~ closed(X4,X1)
| ~ '$ki_accessible'(X0,X4) )
& ! [X6: '$ki_world'] :
( ! [X7: '$ki_world'] :
( open(X7,X1)
| ~ '$ki_accessible'(X6,X7) )
| ~ h(X6,X3)
| ~ combo(X6,X1,X2)
| ~ closed(X6,X1)
| ~ '$ki_accessible'(X0,X6) )
& '$ki_exists_in_world_$i'(X0,X3) )
=> ( ! [X4: '$ki_world'] :
( ! [X5: '$ki_world'] :
( closed(X5,X1)
| ~ '$ki_accessible'(X4,X5) )
| ~ h(X4,o)
| combo(X4,X1,X2)
| ~ closed(X4,X1)
| ~ '$ki_accessible'(X0,X4) )
& ! [X6: '$ki_world'] :
( ! [X7: '$ki_world'] :
( open(X7,X1)
| ~ '$ki_accessible'(X6,X7) )
| ~ h(X6,sK1(X0,X1,X2))
| ~ combo(X6,X1,X2)
| ~ closed(X6,X1)
| ~ '$ki_accessible'(X0,X6) )
& '$ki_exists_in_world_$i'(X0,sK1(X0,X1,X2)) ) ),
introduced(choice_axiom,[]) ).
tff(f32,plain,
! [X0: '$ki_world'] :
( ! [X1] :
( ! [X2] :
( ( ! [X4: '$ki_world'] :
( ! [X5: '$ki_world'] :
( closed(X5,X1)
| ~ '$ki_accessible'(X4,X5) )
| ~ h(X4,o)
| combo(X4,X1,X2)
| ~ closed(X4,X1)
| ~ '$ki_accessible'(X0,X4) )
& ! [X6: '$ki_world'] :
( ! [X7: '$ki_world'] :
( open(X7,X1)
| ~ '$ki_accessible'(X6,X7) )
| ~ h(X6,sK1(X0,X1,X2))
| ~ combo(X6,X1,X2)
| ~ closed(X6,X1)
| ~ '$ki_accessible'(X0,X6) )
& '$ki_exists_in_world_$i'(X0,sK1(X0,X1,X2)) )
| ~ '$ki_exists_in_world_$i'(X0,X2) )
| ~ '$ki_exists_in_world_$i'(X0,X1) )
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f21,f31]) ).
tff(f35,plain,
? [X0: '$ki_world'] :
( ! [X1] :
( ! [X2] :
( ( ? [X3: '$ki_world'] :
( ~ open(X3,d)
& '$ki_accessible'(X0,X3) )
& ! [X4: '$ki_world'] :
( ( h(X4,X2)
& combo(X4,d,X1) )
| ~ '$ki_accessible'(X0,X4) ) )
| ~ '$ki_exists_in_world_$i'(X0,X2) )
| ~ '$ki_exists_in_world_$i'(X0,X1) )
& '$ki_accessible'('$ki_local_world',X0) ),
inference(rectify,[],[f28]) ).
tff(f36,plain,
( ? [X0: '$ki_world'] :
( ! [X1] :
( ! [X2] :
( ( ? [X3: '$ki_world'] :
( ~ open(X3,d)
& '$ki_accessible'(X0,X3) )
& ! [X4: '$ki_world'] :
( ( h(X4,X2)
& combo(X4,d,X1) )
| ~ '$ki_accessible'(X0,X4) ) )
| ~ '$ki_exists_in_world_$i'(X0,X2) )
| ~ '$ki_exists_in_world_$i'(X0,X1) )
& '$ki_accessible'('$ki_local_world',X0) )
=> ( ! [X1] :
( ! [X2] :
( ( ? [X3: '$ki_world'] :
( ~ open(X3,d)
& '$ki_accessible'(sK3,X3) )
& ! [X4: '$ki_world'] :
( ( h(X4,X2)
& combo(X4,d,X1) )
| ~ '$ki_accessible'(sK3,X4) ) )
| ~ '$ki_exists_in_world_$i'(sK3,X2) )
| ~ '$ki_exists_in_world_$i'(sK3,X1) )
& '$ki_accessible'('$ki_local_world',sK3) ) ),
introduced(choice_axiom,[]) ).
tff(f37,plain,
( ? [X3: '$ki_world'] :
( ~ open(X3,d)
& '$ki_accessible'(sK3,X3) )
=> ( ~ open(sK4,d)
& '$ki_accessible'(sK3,sK4) ) ),
introduced(choice_axiom,[]) ).
tff(f38,plain,
( ! [X1] :
( ! [X2] :
( ( ~ open(sK4,d)
& '$ki_accessible'(sK3,sK4)
& ! [X4: '$ki_world'] :
( ( h(X4,X2)
& combo(X4,d,X1) )
| ~ '$ki_accessible'(sK3,X4) ) )
| ~ '$ki_exists_in_world_$i'(sK3,X2) )
| ~ '$ki_exists_in_world_$i'(sK3,X1) )
& '$ki_accessible'('$ki_local_world',sK3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f35,f37,f36]) ).
tff(f39,plain,
! [X0: '$ki_world'] : '$ki_accessible'(X0,X0),
inference(cnf_transformation,[],[f1]) ).
tff(f41,plain,
! [X0: '$ki_world',X1: $i] : '$ki_exists_in_world_$i'(X0,X1),
inference(cnf_transformation,[],[f12]) ).
tff(f44,plain,
! [X2: $i,X0: '$ki_world',X1: $i,X6: '$ki_world',X7: '$ki_world'] :
( open(X7,X1)
| ~ '$ki_accessible'(X6,X7)
| ~ h(X6,sK1(X0,X1,X2))
| ~ combo(X6,X1,X2)
| ~ closed(X6,X1)
| ~ '$ki_accessible'(X0,X6)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(cnf_transformation,[],[f32]) ).
tff(f46,plain,
! [X0: '$ki_world'] :
( closed(X0,d)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(cnf_transformation,[],[f22]) ).
tff(f48,plain,
! [X0: '$ki_world',X1: $i] :
( ~ closed(X0,X1)
| ~ open(X0,X1)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(cnf_transformation,[],[f26]) ).
tff(f51,plain,
'$ki_accessible'('$ki_local_world',sK3),
inference(cnf_transformation,[],[f38]) ).
tff(f52,plain,
! [X2: $i,X1: $i,X4: '$ki_world'] :
( combo(X4,d,X1)
| ~ '$ki_accessible'(sK3,X4)
| ~ '$ki_exists_in_world_$i'(sK3,X2)
| ~ '$ki_exists_in_world_$i'(sK3,X1) ),
inference(cnf_transformation,[],[f38]) ).
tff(f53,plain,
! [X2: $i,X1: $i,X4: '$ki_world'] :
( h(X4,X2)
| ~ '$ki_accessible'(sK3,X4)
| ~ '$ki_exists_in_world_$i'(sK3,X2)
| ~ '$ki_exists_in_world_$i'(sK3,X1) ),
inference(cnf_transformation,[],[f38]) ).
cnf(c_49,plain,
'$ki_accessible'(X0_13,X0_13),
inference(cnf_transformation,[],[f39]) ).
cnf(c_51,plain,
'$ki_exists_in_world_$i'(X0_13,X0),
inference(cnf_transformation,[],[f41]) ).
cnf(c_54,plain,
( ~ h(X0_13,sK1(X1_13,X0,X1))
| ~ combo(X0_13,X0,X1)
| ~ '$ki_accessible'(X0_13,X2_13)
| ~ '$ki_accessible'(X1_13,X0_13)
| ~ closed(X0_13,X0)
| ~ '$ki_exists_in_world_$i'(X1_13,X0)
| ~ '$ki_exists_in_world_$i'(X1_13,X1)
| ~ '$ki_accessible'('$ki_local_world',X1_13)
| open(X2_13,X0) ),
inference(cnf_transformation,[],[f44]) ).
cnf(c_56,plain,
( ~ '$ki_accessible'('$ki_local_world',X0_13)
| closed(X0_13,d) ),
inference(cnf_transformation,[],[f46]) ).
cnf(c_57,plain,
( ~ closed(X0_13,X0)
| ~ open(X0_13,X0)
| ~ '$ki_exists_in_world_$i'(X0_13,X0)
| ~ '$ki_accessible'('$ki_local_world',X0_13) ),
inference(cnf_transformation,[],[f48]) ).
cnf(c_62,negated_conjecture,
( ~ '$ki_accessible'(sK3,X0_13)
| ~ '$ki_exists_in_world_$i'(sK3,X0)
| ~ '$ki_exists_in_world_$i'(sK3,X1)
| h(X0_13,X1) ),
inference(cnf_transformation,[],[f53]) ).
cnf(c_63,negated_conjecture,
( ~ '$ki_accessible'(sK3,X0_13)
| ~ '$ki_exists_in_world_$i'(sK3,X0)
| ~ '$ki_exists_in_world_$i'(sK3,X1)
| combo(X0_13,d,X0) ),
inference(cnf_transformation,[],[f52]) ).
cnf(c_64,negated_conjecture,
'$ki_accessible'('$ki_local_world',sK3),
inference(cnf_transformation,[],[f51]) ).
cnf(c_65,plain,
'$ki_exists_in_world_$i'(sK3,d),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_66,plain,
'$ki_accessible'(sK3,sK3),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_68,plain,
( ~ '$ki_accessible'('$ki_local_world',sK3)
| closed(sK3,d) ),
inference(instantiation,[status(thm)],[c_56]) ).
cnf(c_73,plain,
( ~ '$ki_accessible'(sK3,sK3)
| ~ '$ki_exists_in_world_$i'(sK3,d)
| combo(sK3,d,d) ),
inference(instantiation,[status(thm)],[c_63]) ).
cnf(c_74,plain,
( ~ '$ki_accessible'('$ki_local_world',sK3)
| ~ closed(sK3,d)
| ~ open(sK3,d)
| ~ '$ki_exists_in_world_$i'(sK3,d) ),
inference(instantiation,[status(thm)],[c_57]) ).
cnf(c_95,plain,
( ~ h(X0_13,sK1(X1_13,X0,X1))
| ~ combo(X0_13,X0,X1)
| ~ '$ki_accessible'(X0_13,X2_13)
| ~ '$ki_accessible'(X1_13,X0_13)
| ~ closed(X0_13,X0)
| ~ '$ki_exists_in_world_$i'(X1_13,X1)
| ~ '$ki_accessible'('$ki_local_world',X1_13)
| open(X2_13,X0) ),
inference(backward_subsumption_resolution,[status(thm)],[c_54,c_51]) ).
cnf(c_96,plain,
( ~ '$ki_accessible'(sK3,X0_13)
| ~ '$ki_exists_in_world_$i'(sK3,X0)
| h(X0_13,X0) ),
inference(backward_subsumption_resolution,[status(thm)],[c_62,c_51]) ).
cnf(c_120,plain,
( ~ '$ki_accessible'(sK3,X0_13)
| h(X0_13,X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_96,c_51]) ).
cnf(c_183,plain,
( ~ h(X0_13,sK1(X1_13,X0,X1))
| ~ combo(X0_13,X0,X1)
| ~ '$ki_accessible'(X0_13,X2_13)
| ~ '$ki_accessible'(X1_13,X0_13)
| ~ closed(X0_13,X0)
| ~ '$ki_accessible'('$ki_local_world',X1_13)
| open(X2_13,X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_95,c_51]) ).
cnf(c_228,plain,
( ~ combo(X0_13,X0,X1)
| ~ '$ki_accessible'(X0_13,X1_13)
| ~ '$ki_accessible'(X2_13,X0_13)
| ~ closed(X0_13,X0)
| ~ '$ki_accessible'('$ki_local_world',X2_13)
| ~ '$ki_accessible'(sK3,X0_13)
| open(X1_13,X0) ),
inference(resolution,[status(thm)],[c_183,c_120]) ).
cnf(c_229,plain,
( ~ combo(sK3,d,d)
| ~ '$ki_accessible'('$ki_local_world',sK3)
| ~ '$ki_accessible'(sK3,sK3)
| ~ closed(sK3,d)
| open(sK3,d) ),
inference(instantiation,[status(thm)],[c_228]) ).
cnf(c_230,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_229,c_74,c_73,c_68,c_66,c_65,c_64]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : PLA054_4 : TPTP v8.2.0. Released v8.2.0.
% 0.03/0.12 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n010.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Thu May 2 21:19:19 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 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
% 0.76/1.13 % SZS status Started for theBenchmark.p
% 0.76/1.13 % SZS status Theorem for theBenchmark.p
% 0.76/1.13
% 0.76/1.13 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.76/1.13
% 0.76/1.13 ------ iProver source info
% 0.76/1.13
% 0.76/1.13 git: date: 2024-05-02 19:28:25 +0000
% 0.76/1.13 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.76/1.13 git: non_committed_changes: false
% 0.76/1.13
% 0.76/1.13 ------ Parsing...
% 0.76/1.13 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Global Options Modified: tff_prep: switching off prep_sem_filter, sub_typing, pure_diseq_elim
% 0.76/1.13
% 0.76/1.13
% 0.76/1.13 ------ Preprocessing... pe_s pe:1:0s
% 0.76/1.13
% 0.76/1.13 % SZS status Theorem for theBenchmark.p
% 0.76/1.13
% 0.76/1.13 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.76/1.13
% 0.76/1.13
%------------------------------------------------------------------------------