TSTP Solution File: SYN548+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SYN548+1 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n007.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 Sep 1 03:08:28 EDT 2023
% Result : Theorem 3.82s 1.15s
% Output : CNFRefutation 3.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 30
% Number of leaves : 9
% Syntax : Number of formulae : 149 ( 6 unt; 0 def)
% Number of atoms : 568 ( 0 equ)
% Maximal formula atoms : 17 ( 3 avg)
% Number of connectives : 727 ( 308 ~; 342 |; 50 &)
% ( 3 <=>; 21 =>; 0 <=; 3 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-1 aty)
% Number of variables : 246 ( 0 sgn; 94 !; 25 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : reachable(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_of_reachable) ).
fof(f2,axiom,
! [X0,X1,X2] :
( ( reachable(X1,X2)
& reachable(X0,X1) )
=> reachable(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_of_reachable) ).
fof(f3,conjecture,
? [X0] :
( ! [X1] :
( reachable(X0,X1)
=> ( ! [X2] :
( reachable(X1,X2)
=> ( ! [X3] :
( reachable(X2,X3)
=> q(X3) )
| p(X2) ) )
<=> ( ! [X4] :
( reachable(X1,X4)
=> q(X4) )
| ! [X4] :
( reachable(X1,X4)
=> p(X4) ) ) ) )
& reachable(initial_world,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f4,negated_conjecture,
~ ? [X0] :
( ! [X1] :
( reachable(X0,X1)
=> ( ! [X2] :
( reachable(X1,X2)
=> ( ! [X3] :
( reachable(X2,X3)
=> q(X3) )
| p(X2) ) )
<=> ( ! [X4] :
( reachable(X1,X4)
=> q(X4) )
| ! [X4] :
( reachable(X1,X4)
=> p(X4) ) ) ) )
& reachable(initial_world,X0) ),
inference(negated_conjecture,[],[f3]) ).
fof(f5,plain,
~ ? [X0] :
( ! [X1] :
( reachable(X0,X1)
=> ( ! [X2] :
( reachable(X1,X2)
=> ( ! [X3] :
( reachable(X2,X3)
=> q(X3) )
| p(X2) ) )
<=> ( ! [X4] :
( reachable(X1,X4)
=> q(X4) )
| ! [X5] :
( reachable(X1,X5)
=> p(X5) ) ) ) )
& reachable(initial_world,X0) ),
inference(rectify,[],[f4]) ).
fof(f6,plain,
! [X0,X1,X2] :
( reachable(X0,X2)
| ~ reachable(X1,X2)
| ~ reachable(X0,X1) ),
inference(ennf_transformation,[],[f2]) ).
fof(f7,plain,
! [X0,X1,X2] :
( reachable(X0,X2)
| ~ reachable(X1,X2)
| ~ reachable(X0,X1) ),
inference(flattening,[],[f6]) ).
fof(f8,plain,
! [X0] :
( ? [X1] :
( ( ! [X2] :
( ! [X3] :
( q(X3)
| ~ reachable(X2,X3) )
| p(X2)
| ~ reachable(X1,X2) )
<~> ( ! [X4] :
( q(X4)
| ~ reachable(X1,X4) )
| ! [X5] :
( p(X5)
| ~ reachable(X1,X5) ) ) )
& reachable(X0,X1) )
| ~ reachable(initial_world,X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f9,plain,
! [X0] :
( ? [X1] :
( ( ! [X2] :
( ! [X3] :
( q(X3)
| ~ reachable(X2,X3) )
| p(X2)
| ~ reachable(X1,X2) )
<~> ( ! [X4] :
( q(X4)
| ~ reachable(X1,X4) )
| ! [X5] :
( p(X5)
| ~ reachable(X1,X5) ) ) )
& reachable(X0,X1) )
| ~ reachable(initial_world,X0) ),
inference(flattening,[],[f8]) ).
fof(f10,plain,
! [X1] :
( ( ! [X2] :
( ! [X3] :
( q(X3)
| ~ reachable(X2,X3) )
| p(X2)
| ~ reachable(X1,X2) )
<~> ( ! [X4] :
( q(X4)
| ~ reachable(X1,X4) )
| ! [X5] :
( p(X5)
| ~ reachable(X1,X5) ) ) )
| ~ sP0(X1) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f11,plain,
! [X0] :
( ? [X1] :
( sP0(X1)
& reachable(X0,X1) )
| ~ reachable(initial_world,X0) ),
inference(definition_folding,[],[f9,f10]) ).
fof(f12,plain,
! [X1] :
( ( ( ( ? [X4] :
( ~ q(X4)
& reachable(X1,X4) )
& ? [X5] :
( ~ p(X5)
& reachable(X1,X5) ) )
| ? [X2] :
( ? [X3] :
( ~ q(X3)
& reachable(X2,X3) )
& ~ p(X2)
& reachable(X1,X2) ) )
& ( ! [X4] :
( q(X4)
| ~ reachable(X1,X4) )
| ! [X5] :
( p(X5)
| ~ reachable(X1,X5) )
| ! [X2] :
( ! [X3] :
( q(X3)
| ~ reachable(X2,X3) )
| p(X2)
| ~ reachable(X1,X2) ) ) )
| ~ sP0(X1) ),
inference(nnf_transformation,[],[f10]) ).
fof(f13,plain,
! [X1] :
( ( ( ( ? [X4] :
( ~ q(X4)
& reachable(X1,X4) )
& ? [X5] :
( ~ p(X5)
& reachable(X1,X5) ) )
| ? [X2] :
( ? [X3] :
( ~ q(X3)
& reachable(X2,X3) )
& ~ p(X2)
& reachable(X1,X2) ) )
& ( ! [X4] :
( q(X4)
| ~ reachable(X1,X4) )
| ! [X5] :
( p(X5)
| ~ reachable(X1,X5) )
| ! [X2] :
( ! [X3] :
( q(X3)
| ~ reachable(X2,X3) )
| p(X2)
| ~ reachable(X1,X2) ) ) )
| ~ sP0(X1) ),
inference(flattening,[],[f12]) ).
fof(f14,plain,
! [X0] :
( ( ( ( ? [X1] :
( ~ q(X1)
& reachable(X0,X1) )
& ? [X2] :
( ~ p(X2)
& reachable(X0,X2) ) )
| ? [X3] :
( ? [X4] :
( ~ q(X4)
& reachable(X3,X4) )
& ~ p(X3)
& reachable(X0,X3) ) )
& ( ! [X5] :
( q(X5)
| ~ reachable(X0,X5) )
| ! [X6] :
( p(X6)
| ~ reachable(X0,X6) )
| ! [X7] :
( ! [X8] :
( q(X8)
| ~ reachable(X7,X8) )
| p(X7)
| ~ reachable(X0,X7) ) ) )
| ~ sP0(X0) ),
inference(rectify,[],[f13]) ).
fof(f15,plain,
! [X0] :
( ? [X1] :
( ~ q(X1)
& reachable(X0,X1) )
=> ( ~ q(sK1(X0))
& reachable(X0,sK1(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f16,plain,
! [X0] :
( ? [X2] :
( ~ p(X2)
& reachable(X0,X2) )
=> ( ~ p(sK2(X0))
& reachable(X0,sK2(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f17,plain,
! [X0] :
( ? [X3] :
( ? [X4] :
( ~ q(X4)
& reachable(X3,X4) )
& ~ p(X3)
& reachable(X0,X3) )
=> ( ? [X4] :
( ~ q(X4)
& reachable(sK3(X0),X4) )
& ~ p(sK3(X0))
& reachable(X0,sK3(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f18,plain,
! [X0] :
( ? [X4] :
( ~ q(X4)
& reachable(sK3(X0),X4) )
=> ( ~ q(sK4(X0))
& reachable(sK3(X0),sK4(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f19,plain,
! [X0] :
( ( ( ( ~ q(sK1(X0))
& reachable(X0,sK1(X0))
& ~ p(sK2(X0))
& reachable(X0,sK2(X0)) )
| ( ~ q(sK4(X0))
& reachable(sK3(X0),sK4(X0))
& ~ p(sK3(X0))
& reachable(X0,sK3(X0)) ) )
& ( ! [X5] :
( q(X5)
| ~ reachable(X0,X5) )
| ! [X6] :
( p(X6)
| ~ reachable(X0,X6) )
| ! [X7] :
( ! [X8] :
( q(X8)
| ~ reachable(X7,X8) )
| p(X7)
| ~ reachable(X0,X7) ) ) )
| ~ sP0(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4])],[f14,f18,f17,f16,f15]) ).
fof(f20,plain,
! [X0] :
( ? [X1] :
( sP0(X1)
& reachable(X0,X1) )
=> ( sP0(sK5(X0))
& reachable(X0,sK5(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f21,plain,
! [X0] :
( ( sP0(sK5(X0))
& reachable(X0,sK5(X0)) )
| ~ reachable(initial_world,X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5])],[f11,f20]) ).
fof(f22,plain,
! [X0] : reachable(X0,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f23,plain,
! [X2,X0,X1] :
( reachable(X0,X2)
| ~ reachable(X1,X2)
| ~ reachable(X0,X1) ),
inference(cnf_transformation,[],[f7]) ).
fof(f24,plain,
! [X0,X8,X6,X7,X5] :
( q(X5)
| ~ reachable(X0,X5)
| p(X6)
| ~ reachable(X0,X6)
| q(X8)
| ~ reachable(X7,X8)
| p(X7)
| ~ reachable(X0,X7)
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f19]) ).
fof(f25,plain,
! [X0] :
( reachable(X0,sK2(X0))
| reachable(X0,sK3(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f19]) ).
fof(f26,plain,
! [X0] :
( reachable(X0,sK2(X0))
| ~ p(sK3(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f19]) ).
fof(f27,plain,
! [X0] :
( reachable(X0,sK2(X0))
| reachable(sK3(X0),sK4(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f19]) ).
fof(f28,plain,
! [X0] :
( reachable(X0,sK2(X0))
| ~ q(sK4(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f19]) ).
fof(f29,plain,
! [X0] :
( ~ p(sK2(X0))
| reachable(X0,sK3(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f19]) ).
fof(f30,plain,
! [X0] :
( ~ p(sK2(X0))
| ~ p(sK3(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f19]) ).
fof(f31,plain,
! [X0] :
( ~ p(sK2(X0))
| reachable(sK3(X0),sK4(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f19]) ).
fof(f32,plain,
! [X0] :
( ~ p(sK2(X0))
| ~ q(sK4(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f19]) ).
fof(f33,plain,
! [X0] :
( reachable(X0,sK1(X0))
| reachable(X0,sK3(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f19]) ).
fof(f34,plain,
! [X0] :
( reachable(X0,sK1(X0))
| ~ p(sK3(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f19]) ).
fof(f35,plain,
! [X0] :
( reachable(X0,sK1(X0))
| reachable(sK3(X0),sK4(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f19]) ).
fof(f36,plain,
! [X0] :
( reachable(X0,sK1(X0))
| ~ q(sK4(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f19]) ).
fof(f37,plain,
! [X0] :
( ~ q(sK1(X0))
| reachable(X0,sK3(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f19]) ).
fof(f38,plain,
! [X0] :
( ~ q(sK1(X0))
| ~ p(sK3(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f19]) ).
fof(f39,plain,
! [X0] :
( ~ q(sK1(X0))
| reachable(sK3(X0),sK4(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f19]) ).
fof(f40,plain,
! [X0] :
( ~ q(sK1(X0))
| ~ q(sK4(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f19]) ).
fof(f41,plain,
! [X0] :
( reachable(X0,sK5(X0))
| ~ reachable(initial_world,X0) ),
inference(cnf_transformation,[],[f21]) ).
fof(f42,plain,
! [X0] :
( sP0(sK5(X0))
| ~ reachable(initial_world,X0) ),
inference(cnf_transformation,[],[f21]) ).
cnf(c_49,plain,
reachable(X0,X0),
inference(cnf_transformation,[],[f22]) ).
cnf(c_50,plain,
( ~ reachable(X0,X1)
| ~ reachable(X1,X2)
| reachable(X0,X2) ),
inference(cnf_transformation,[],[f23]) ).
cnf(c_51,plain,
( ~ q(sK1(X0))
| ~ q(sK4(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f40]) ).
cnf(c_52,plain,
( ~ q(sK1(X0))
| ~ sP0(X0)
| reachable(sK3(X0),sK4(X0)) ),
inference(cnf_transformation,[],[f39]) ).
cnf(c_53,plain,
( ~ q(sK1(X0))
| ~ p(sK3(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f38]) ).
cnf(c_54,plain,
( ~ q(sK1(X0))
| ~ sP0(X0)
| reachable(X0,sK3(X0)) ),
inference(cnf_transformation,[],[f37]) ).
cnf(c_55,plain,
( ~ q(sK4(X0))
| ~ sP0(X0)
| reachable(X0,sK1(X0)) ),
inference(cnf_transformation,[],[f36]) ).
cnf(c_56,plain,
( ~ sP0(X0)
| reachable(sK3(X0),sK4(X0))
| reachable(X0,sK1(X0)) ),
inference(cnf_transformation,[],[f35]) ).
cnf(c_57,plain,
( ~ p(sK3(X0))
| ~ sP0(X0)
| reachable(X0,sK1(X0)) ),
inference(cnf_transformation,[],[f34]) ).
cnf(c_58,plain,
( ~ sP0(X0)
| reachable(X0,sK1(X0))
| reachable(X0,sK3(X0)) ),
inference(cnf_transformation,[],[f33]) ).
cnf(c_59,plain,
( ~ q(sK4(X0))
| ~ p(sK2(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f32]) ).
cnf(c_60,plain,
( ~ p(sK2(X0))
| ~ sP0(X0)
| reachable(sK3(X0),sK4(X0)) ),
inference(cnf_transformation,[],[f31]) ).
cnf(c_61,plain,
( ~ p(sK3(X0))
| ~ p(sK2(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f30]) ).
cnf(c_62,plain,
( ~ p(sK2(X0))
| ~ sP0(X0)
| reachable(X0,sK3(X0)) ),
inference(cnf_transformation,[],[f29]) ).
cnf(c_63,plain,
( ~ q(sK4(X0))
| ~ sP0(X0)
| reachable(X0,sK2(X0)) ),
inference(cnf_transformation,[],[f28]) ).
cnf(c_64,plain,
( ~ sP0(X0)
| reachable(sK3(X0),sK4(X0))
| reachable(X0,sK2(X0)) ),
inference(cnf_transformation,[],[f27]) ).
cnf(c_65,plain,
( ~ p(sK3(X0))
| ~ sP0(X0)
| reachable(X0,sK2(X0)) ),
inference(cnf_transformation,[],[f26]) ).
cnf(c_66,plain,
( ~ sP0(X0)
| reachable(X0,sK3(X0))
| reachable(X0,sK2(X0)) ),
inference(cnf_transformation,[],[f25]) ).
cnf(c_67,plain,
( ~ reachable(X0,X1)
| ~ reachable(X0,X2)
| ~ reachable(X0,X3)
| ~ reachable(X3,X4)
| ~ sP0(X0)
| q(X1)
| q(X4)
| p(X2)
| p(X3) ),
inference(cnf_transformation,[],[f24]) ).
cnf(c_68,negated_conjecture,
( ~ reachable(initial_world,X0)
| sP0(sK5(X0)) ),
inference(cnf_transformation,[],[f42]) ).
cnf(c_69,negated_conjecture,
( ~ reachable(initial_world,X0)
| reachable(X0,sK5(X0)) ),
inference(cnf_transformation,[],[f41]) ).
cnf(c_70,plain,
reachable(initial_world,initial_world),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_90,plain,
( ~ reachable(initial_world,X0)
| sP0(sK5(X0)) ),
inference(prop_impl_just,[status(thm)],[c_68]) ).
cnf(c_98,plain,
( ~ reachable(sK5(X0),X1)
| ~ reachable(sK5(X0),X2)
| ~ reachable(sK5(X0),X3)
| ~ reachable(X1,X4)
| ~ reachable(initial_world,X0)
| q(X2)
| q(X4)
| p(X1)
| p(X3) ),
inference(resolution,[status(thm)],[c_67,c_90]) ).
cnf(c_127,plain,
( ~ reachable(initial_world,X0)
| reachable(sK5(X0),sK3(sK5(X0)))
| reachable(sK5(X0),sK2(sK5(X0))) ),
inference(resolution,[status(thm)],[c_66,c_90]) ).
cnf(c_138,plain,
( ~ p(sK3(sK5(X0)))
| ~ reachable(initial_world,X0)
| reachable(sK5(X0),sK2(sK5(X0))) ),
inference(resolution,[status(thm)],[c_65,c_90]) ).
cnf(c_149,plain,
( ~ reachable(initial_world,X0)
| reachable(sK3(sK5(X0)),sK4(sK5(X0)))
| reachable(sK5(X0),sK2(sK5(X0))) ),
inference(resolution,[status(thm)],[c_64,c_90]) ).
cnf(c_160,plain,
( ~ q(sK4(sK5(X0)))
| ~ reachable(initial_world,X0)
| reachable(sK5(X0),sK2(sK5(X0))) ),
inference(resolution,[status(thm)],[c_63,c_90]) ).
cnf(c_171,plain,
( ~ p(sK2(sK5(X0)))
| ~ reachable(initial_world,X0)
| reachable(sK5(X0),sK3(sK5(X0))) ),
inference(resolution,[status(thm)],[c_62,c_90]) ).
cnf(c_182,plain,
( ~ p(sK3(sK5(X0)))
| ~ p(sK2(sK5(X0)))
| ~ reachable(initial_world,X0) ),
inference(resolution,[status(thm)],[c_61,c_90]) ).
cnf(c_193,plain,
( ~ p(sK2(sK5(X0)))
| ~ reachable(initial_world,X0)
| reachable(sK3(sK5(X0)),sK4(sK5(X0))) ),
inference(resolution,[status(thm)],[c_60,c_90]) ).
cnf(c_204,plain,
( ~ q(sK4(sK5(X0)))
| ~ p(sK2(sK5(X0)))
| ~ reachable(initial_world,X0) ),
inference(resolution,[status(thm)],[c_59,c_90]) ).
cnf(c_215,plain,
( ~ reachable(initial_world,X0)
| reachable(sK5(X0),sK1(sK5(X0)))
| reachable(sK5(X0),sK3(sK5(X0))) ),
inference(resolution,[status(thm)],[c_58,c_90]) ).
cnf(c_226,plain,
( ~ p(sK3(sK5(X0)))
| ~ reachable(initial_world,X0)
| reachable(sK5(X0),sK1(sK5(X0))) ),
inference(resolution,[status(thm)],[c_57,c_90]) ).
cnf(c_237,plain,
( ~ reachable(initial_world,X0)
| reachable(sK3(sK5(X0)),sK4(sK5(X0)))
| reachable(sK5(X0),sK1(sK5(X0))) ),
inference(resolution,[status(thm)],[c_56,c_90]) ).
cnf(c_248,plain,
( ~ q(sK4(sK5(X0)))
| ~ reachable(initial_world,X0)
| reachable(sK5(X0),sK1(sK5(X0))) ),
inference(resolution,[status(thm)],[c_55,c_90]) ).
cnf(c_259,plain,
( ~ q(sK1(sK5(X0)))
| ~ reachable(initial_world,X0)
| reachable(sK5(X0),sK3(sK5(X0))) ),
inference(resolution,[status(thm)],[c_54,c_90]) ).
cnf(c_270,plain,
( ~ q(sK1(sK5(X0)))
| ~ p(sK3(sK5(X0)))
| ~ reachable(initial_world,X0) ),
inference(resolution,[status(thm)],[c_53,c_90]) ).
cnf(c_281,plain,
( ~ q(sK1(sK5(X0)))
| ~ reachable(initial_world,X0)
| reachable(sK3(sK5(X0)),sK4(sK5(X0))) ),
inference(resolution,[status(thm)],[c_52,c_90]) ).
cnf(c_292,plain,
( ~ q(sK1(sK5(X0)))
| ~ q(sK4(sK5(X0)))
| ~ reachable(initial_world,X0) ),
inference(resolution,[status(thm)],[c_51,c_90]) ).
cnf(c_367,plain,
( ~ reachable(sK5(X0),X1)
| q(X1)
| ~ sP0_iProver_split(X0) ),
inference(splitting,[splitting(split),new_symbols(definition,[sP0_iProver_split])],[c_98]) ).
cnf(c_368,plain,
( ~ reachable(sK5(X0),X1)
| p(X1)
| ~ sP1_iProver_split(X0) ),
inference(splitting,[splitting(split),new_symbols(definition,[sP1_iProver_split])],[c_98]) ).
cnf(c_369,plain,
( ~ reachable(X0,X1)
| q(X1)
| ~ sP2_iProver_split(X0) ),
inference(splitting,[splitting(split),new_symbols(definition,[sP2_iProver_split])],[c_98]) ).
cnf(c_370,plain,
( ~ reachable(sK5(X0),X1)
| ~ reachable(initial_world,X0)
| p(X1)
| sP0_iProver_split(X0)
| sP1_iProver_split(X0)
| sP2_iProver_split(X1) ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_98]) ).
cnf(c_452,plain,
( ~ reachable(sK5(X0),X1)
| ~ reachable(initial_world,X0)
| reachable(X0,X1) ),
inference(superposition,[status(thm)],[c_69,c_50]) ).
cnf(c_474,plain,
( ~ reachable(sK3(sK5(X0)),X1)
| ~ q(sK1(sK5(X0)))
| ~ reachable(initial_world,X0)
| reachable(sK5(X0),X1) ),
inference(superposition,[status(thm)],[c_259,c_50]) ).
cnf(c_608,plain,
( ~ reachable(sK3(sK5(X0)),X1)
| ~ p(sK2(sK5(X0)))
| ~ reachable(initial_world,X0)
| reachable(sK5(X0),X1) ),
inference(superposition,[status(thm)],[c_171,c_50]) ).
cnf(c_705,plain,
( ~ q(sK1(sK5(X0)))
| ~ sP2_iProver_split(sK3(sK5(X0)))
| ~ reachable(initial_world,X0)
| q(sK4(sK5(X0))) ),
inference(superposition,[status(thm)],[c_281,c_369]) ).
cnf(c_714,plain,
( ~ q(sK1(sK5(X0)))
| ~ sP2_iProver_split(sK3(sK5(X0)))
| ~ reachable(initial_world,X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_705,c_292]) ).
cnf(c_728,plain,
( ~ reachable(sK3(sK5(X0)),X1)
| ~ reachable(initial_world,X0)
| reachable(sK5(X0),sK1(sK5(X0)))
| reachable(sK5(X0),X1) ),
inference(superposition,[status(thm)],[c_215,c_50]) ).
cnf(c_773,plain,
( ~ p(sK2(sK5(X0)))
| ~ sP2_iProver_split(sK3(sK5(X0)))
| ~ reachable(initial_world,X0)
| q(sK4(sK5(X0))) ),
inference(superposition,[status(thm)],[c_193,c_369]) ).
cnf(c_782,plain,
( ~ p(sK2(sK5(X0)))
| ~ sP2_iProver_split(sK3(sK5(X0)))
| ~ reachable(initial_world,X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_773,c_204]) ).
cnf(c_796,plain,
( ~ reachable(sK3(sK5(X0)),X1)
| ~ reachable(initial_world,X0)
| reachable(sK5(X0),sK2(sK5(X0)))
| reachable(sK5(X0),X1) ),
inference(superposition,[status(thm)],[c_127,c_50]) ).
cnf(c_837,plain,
( sP0_iProver_split(X0)
| p(X1)
| ~ reachable(initial_world,X0)
| ~ reachable(sK5(X0),X1)
| sP2_iProver_split(X1) ),
inference(global_subsumption_just,[status(thm)],[c_370,c_368,c_370]) ).
cnf(c_838,plain,
( ~ reachable(sK5(X0),X1)
| ~ reachable(initial_world,X0)
| p(X1)
| sP0_iProver_split(X0)
| sP2_iProver_split(X1) ),
inference(renaming,[status(thm)],[c_837]) ).
cnf(c_849,plain,
( ~ reachable(initial_world,X0)
| reachable(sK5(X0),sK2(sK5(X0)))
| p(sK3(sK5(X0)))
| sP2_iProver_split(sK3(sK5(X0)))
| sP0_iProver_split(X0) ),
inference(superposition,[status(thm)],[c_127,c_838]) ).
cnf(c_850,plain,
( ~ reachable(initial_world,X0)
| reachable(sK5(X0),sK1(sK5(X0)))
| p(sK3(sK5(X0)))
| sP2_iProver_split(sK3(sK5(X0)))
| sP0_iProver_split(X0) ),
inference(superposition,[status(thm)],[c_215,c_838]) ).
cnf(c_851,plain,
( ~ p(sK2(sK5(X0)))
| ~ reachable(initial_world,X0)
| p(sK3(sK5(X0)))
| sP2_iProver_split(sK3(sK5(X0)))
| sP0_iProver_split(X0) ),
inference(superposition,[status(thm)],[c_171,c_838]) ).
cnf(c_852,plain,
( ~ q(sK1(sK5(X0)))
| ~ reachable(initial_world,X0)
| p(sK3(sK5(X0)))
| sP2_iProver_split(sK3(sK5(X0)))
| sP0_iProver_split(X0) ),
inference(superposition,[status(thm)],[c_259,c_838]) ).
cnf(c_895,plain,
( ~ q(sK1(sK5(X0)))
| ~ reachable(initial_world,X0)
| sP0_iProver_split(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_852,c_714,c_270]) ).
cnf(c_906,plain,
( ~ p(sK2(sK5(X0)))
| ~ reachable(initial_world,X0)
| sP0_iProver_split(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_851,c_782,c_182]) ).
cnf(c_949,plain,
( ~ reachable(initial_world,X0)
| reachable(sK5(X0),sK1(sK5(X0)))
| sP2_iProver_split(sK3(sK5(X0)))
| sP0_iProver_split(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_850,c_226]) ).
cnf(c_960,plain,
( ~ reachable(initial_world,X0)
| reachable(sK5(X0),sK2(sK5(X0)))
| sP2_iProver_split(sK3(sK5(X0)))
| sP0_iProver_split(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_849,c_138]) ).
cnf(c_975,plain,
( ~ sP2_iProver_split(sK3(sK5(X0)))
| ~ reachable(initial_world,X0)
| reachable(sK5(X0),sK1(sK5(X0)))
| q(sK4(sK5(X0))) ),
inference(superposition,[status(thm)],[c_237,c_369]) ).
cnf(c_984,plain,
( ~ sP2_iProver_split(sK3(sK5(X0)))
| ~ reachable(initial_world,X0)
| reachable(sK5(X0),sK1(sK5(X0))) ),
inference(forward_subsumption_resolution,[status(thm)],[c_975,c_248]) ).
cnf(c_999,plain,
( ~ sP2_iProver_split(sK3(sK5(X0)))
| ~ reachable(initial_world,X0)
| reachable(sK5(X0),sK2(sK5(X0)))
| q(sK4(sK5(X0))) ),
inference(superposition,[status(thm)],[c_149,c_369]) ).
cnf(c_1008,plain,
( ~ sP2_iProver_split(sK3(sK5(X0)))
| ~ reachable(initial_world,X0)
| reachable(sK5(X0),sK2(sK5(X0))) ),
inference(forward_subsumption_resolution,[status(thm)],[c_999,c_160]) ).
cnf(c_1168,plain,
( ~ q(sK1(sK5(X0)))
| ~ reachable(initial_world,X0)
| reachable(sK5(X0),sK4(sK5(X0))) ),
inference(superposition,[status(thm)],[c_281,c_474]) ).
cnf(c_1259,plain,
( ~ p(sK2(sK5(X0)))
| ~ reachable(initial_world,X0)
| reachable(sK5(X0),sK4(sK5(X0))) ),
inference(superposition,[status(thm)],[c_193,c_608]) ).
cnf(c_1488,plain,
( ~ reachable(initial_world,X0)
| reachable(sK5(X0),sK1(sK5(X0)))
| reachable(sK5(X0),sK4(sK5(X0))) ),
inference(superposition,[status(thm)],[c_237,c_728]) ).
cnf(c_1611,plain,
( ~ reachable(initial_world,X0)
| reachable(sK5(X0),sK4(sK5(X0)))
| reachable(sK5(X0),sK2(sK5(X0))) ),
inference(superposition,[status(thm)],[c_149,c_796]) ).
cnf(c_1676,plain,
( reachable(sK5(X0),sK2(sK5(X0)))
| ~ reachable(initial_world,X0)
| sP0_iProver_split(X0) ),
inference(global_subsumption_just,[status(thm)],[c_960,c_960,c_1008]) ).
cnf(c_1677,plain,
( ~ reachable(initial_world,X0)
| reachable(sK5(X0),sK2(sK5(X0)))
| sP0_iProver_split(X0) ),
inference(renaming,[status(thm)],[c_1676]) ).
cnf(c_1739,plain,
( reachable(sK5(X0),sK1(sK5(X0)))
| ~ reachable(initial_world,X0)
| sP0_iProver_split(X0) ),
inference(global_subsumption_just,[status(thm)],[c_949,c_949,c_984]) ).
cnf(c_1740,plain,
( ~ reachable(initial_world,X0)
| reachable(sK5(X0),sK1(sK5(X0)))
| sP0_iProver_split(X0) ),
inference(renaming,[status(thm)],[c_1739]) ).
cnf(c_1747,plain,
( ~ reachable(initial_world,X0)
| reachable(X0,sK1(sK5(X0)))
| sP0_iProver_split(X0) ),
inference(superposition,[status(thm)],[c_1740,c_452]) ).
cnf(c_3070,plain,
( ~ reachable(initial_world,X0)
| ~ sP2_iProver_split(X0)
| q(sK5(X0)) ),
inference(superposition,[status(thm)],[c_69,c_369]) ).
cnf(c_3305,plain,
( ~ reachable(sK5(X0),X1)
| ~ reachable(initial_world,X0)
| reachable(X0,X1) ),
inference(superposition,[status(thm)],[c_69,c_50]) ).
cnf(c_4105,plain,
( ~ q(sK1(sK5(X0)))
| ~ reachable(initial_world,X0)
| ~ sP0_iProver_split(X0)
| q(sK4(sK5(X0))) ),
inference(superposition,[status(thm)],[c_1168,c_367]) ).
cnf(c_4121,plain,
( ~ q(sK1(sK5(X0)))
| ~ reachable(initial_world,X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_4105,c_292,c_895]) ).
cnf(c_4270,plain,
( ~ p(sK2(sK5(X0)))
| ~ reachable(initial_world,X0)
| ~ sP0_iProver_split(X0)
| q(sK4(sK5(X0))) ),
inference(superposition,[status(thm)],[c_1259,c_367]) ).
cnf(c_4286,plain,
( ~ p(sK2(sK5(X0)))
| ~ reachable(initial_world,X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_4270,c_204,c_906]) ).
cnf(c_4336,plain,
( ~ reachable(initial_world,X0)
| ~ q(sK1(sK5(X0))) ),
inference(global_subsumption_just,[status(thm)],[c_281,c_4121]) ).
cnf(c_4337,plain,
( ~ q(sK1(sK5(X0)))
| ~ reachable(initial_world,X0) ),
inference(renaming,[status(thm)],[c_4336]) ).
cnf(c_4613,plain,
( ~ reachable(initial_world,X0)
| ~ p(sK2(sK5(X0))) ),
inference(global_subsumption_just,[status(thm)],[c_193,c_4286]) ).
cnf(c_4614,plain,
( ~ p(sK2(sK5(X0)))
| ~ reachable(initial_world,X0) ),
inference(renaming,[status(thm)],[c_4613]) ).
cnf(c_4769,plain,
( ~ reachable(initial_world,X0)
| ~ sP0_iProver_split(X0)
| reachable(sK5(X0),sK1(sK5(X0)))
| q(sK4(sK5(X0))) ),
inference(superposition,[status(thm)],[c_1488,c_367]) ).
cnf(c_4785,plain,
( ~ reachable(initial_world,X0)
| reachable(sK5(X0),sK1(sK5(X0))) ),
inference(forward_subsumption_resolution,[status(thm)],[c_4769,c_248,c_1740]) ).
cnf(c_4849,plain,
( sP0_iProver_split(X0)
| p(X1)
| ~ reachable(initial_world,X0)
| ~ reachable(sK5(X0),X1)
| sP2_iProver_split(X1) ),
inference(global_subsumption_just,[status(thm)],[c_370,c_838]) ).
cnf(c_4850,plain,
( ~ reachable(sK5(X0),X1)
| ~ reachable(initial_world,X0)
| p(X1)
| sP0_iProver_split(X0)
| sP2_iProver_split(X1) ),
inference(renaming,[status(thm)],[c_4849]) ).
cnf(c_5235,plain,
( ~ reachable(initial_world,X0)
| reachable(sK5(X0),sK1(sK5(X0))) ),
inference(global_subsumption_just,[status(thm)],[c_237,c_4785]) ).
cnf(c_5242,plain,
( ~ reachable(initial_world,X0)
| ~ sP0_iProver_split(X0)
| q(sK1(sK5(X0))) ),
inference(superposition,[status(thm)],[c_5235,c_367]) ).
cnf(c_5256,plain,
( ~ reachable(initial_world,X0)
| ~ sP0_iProver_split(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_5242,c_4337]) ).
cnf(c_5282,plain,
( ~ reachable(initial_world,X0)
| reachable(sK5(X0),sK2(sK5(X0))) ),
inference(global_subsumption_just,[status(thm)],[c_1611,c_1677,c_5256]) ).
cnf(c_5415,plain,
( reachable(X0,sK1(sK5(X0)))
| ~ reachable(initial_world,X0) ),
inference(global_subsumption_just,[status(thm)],[c_1747,c_1747,c_5256]) ).
cnf(c_5416,plain,
( ~ reachable(initial_world,X0)
| reachable(X0,sK1(sK5(X0))) ),
inference(renaming,[status(thm)],[c_5415]) ).
cnf(c_5421,plain,
( ~ reachable(initial_world,X0)
| ~ sP2_iProver_split(X0)
| q(sK1(sK5(X0))) ),
inference(superposition,[status(thm)],[c_5416,c_369]) ).
cnf(c_5455,plain,
( ~ reachable(initial_world,X0)
| ~ sP2_iProver_split(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_5421,c_4121]) ).
cnf(c_5648,plain,
( ~ reachable(initial_world,X0)
| reachable(sK5(X0),sK2(sK5(X0))) ),
inference(global_subsumption_just,[status(thm)],[c_149,c_5282]) ).
cnf(c_5654,plain,
( ~ reachable(initial_world,X0)
| p(sK2(sK5(X0)))
| sP2_iProver_split(sK2(sK5(X0)))
| sP0_iProver_split(X0) ),
inference(superposition,[status(thm)],[c_5648,c_4850]) ).
cnf(c_5672,plain,
( ~ reachable(initial_world,X0)
| sP2_iProver_split(sK2(sK5(X0))) ),
inference(forward_subsumption_resolution,[status(thm)],[c_5654,c_5256,c_4614]) ).
cnf(c_5856,plain,
( ~ sP2_iProver_split(X0)
| ~ reachable(initial_world,X0) ),
inference(global_subsumption_just,[status(thm)],[c_3070,c_5455]) ).
cnf(c_5857,plain,
( ~ reachable(initial_world,X0)
| ~ sP2_iProver_split(X0) ),
inference(renaming,[status(thm)],[c_5856]) ).
cnf(c_5993,plain,
( ~ reachable(initial_world,X0)
| reachable(X0,sK2(sK5(X0))) ),
inference(superposition,[status(thm)],[c_5648,c_3305]) ).
cnf(c_6843,plain,
( ~ sP2_iProver_split(sK2(sK5(initial_world)))
| ~ reachable(initial_world,initial_world) ),
inference(superposition,[status(thm)],[c_5993,c_5857]) ).
cnf(c_6854,plain,
~ reachable(initial_world,initial_world),
inference(forward_subsumption_resolution,[status(thm)],[c_6843,c_5672]) ).
cnf(c_6897,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_6854,c_70]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN548+1 : TPTP v8.1.2. Released v2.2.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n007.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sat Aug 26 19:19:27 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.82/1.15 % SZS status Started for theBenchmark.p
% 3.82/1.15 % SZS status Theorem for theBenchmark.p
% 3.82/1.15
% 3.82/1.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.82/1.15
% 3.82/1.15 ------ iProver source info
% 3.82/1.15
% 3.82/1.15 git: date: 2023-05-31 18:12:56 +0000
% 3.82/1.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.82/1.15 git: non_committed_changes: false
% 3.82/1.15 git: last_make_outside_of_git: false
% 3.82/1.15
% 3.82/1.15 ------ Parsing...
% 3.82/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.82/1.15
% 3.82/1.15 ------ Preprocessing... pe_s pe:1:0s pe_e pe_s pe_e
% 3.82/1.15
% 3.82/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e scvd_s sp: 3 0s scvd_e snvd_s sp: 0 0s snvd_e
% 3.82/1.15 ------ Proving...
% 3.82/1.15 ------ Problem Properties
% 3.82/1.15
% 3.82/1.15
% 3.82/1.15 clauses 23
% 3.82/1.15 conjectures 1
% 3.82/1.15 EPR 3
% 3.82/1.15 Horn 18
% 3.82/1.15 unary 1
% 3.82/1.15 binary 1
% 3.82/1.15 lits 69
% 3.82/1.15 lits eq 0
% 3.82/1.15 fd_pure 0
% 3.82/1.15 fd_pseudo 0
% 3.82/1.15 fd_cond 0
% 3.82/1.15 fd_pseudo_cond 0
% 3.82/1.15 AC symbols 0
% 3.82/1.15
% 3.82/1.15 ------ Input Options Time Limit: Unbounded
% 3.82/1.15
% 3.82/1.15
% 3.82/1.15 ------
% 3.82/1.15 Current options:
% 3.82/1.15 ------
% 3.82/1.15
% 3.82/1.15
% 3.82/1.15
% 3.82/1.15
% 3.82/1.15 ------ Proving...
% 3.82/1.15
% 3.82/1.15
% 3.82/1.15 % SZS status Theorem for theBenchmark.p
% 3.82/1.15
% 3.82/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.82/1.15
% 3.82/1.15
%------------------------------------------------------------------------------