TSTP Solution File: SYN549+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SYN549+1 : TPTP v8.1.2. Released v2.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 Sep 1 03:08:28 EDT 2023
% Result : Theorem 1.90s 1.19s
% Output : CNFRefutation 1.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of formulae : 91 ( 7 unt; 0 def)
% Number of atoms : 377 ( 0 equ)
% Maximal formula atoms : 11 ( 4 avg)
% Number of connectives : 450 ( 164 ~; 204 |; 67 &)
% ( 4 <=>; 9 =>; 0 <=; 2 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-1 aty)
% Number of variables : 165 ( 0 sgn; 65 !; 42 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : reachable(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_of_reachable) ).
fof(f2,axiom,
! [X0,X1,X2] :
( ( reachable(X1,X2)
& reachable(X0,X1) )
=> reachable(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_of_reachable) ).
fof(f3,conjecture,
? [X0] :
( ! [X1] :
( reachable(X0,X1)
=> ( ? [X2] :
( ( ? [X3] :
( q(X3)
& reachable(X2,X3) )
| p(X2) )
& reachable(X1,X2) )
<=> ( ? [X4] :
( q(X4)
& reachable(X1,X4) )
| ? [X4] :
( p(X4)
& reachable(X1,X4) ) ) ) )
& reachable(initial_world,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f4,negated_conjecture,
~ ? [X0] :
( ! [X1] :
( reachable(X0,X1)
=> ( ? [X2] :
( ( ? [X3] :
( q(X3)
& reachable(X2,X3) )
| p(X2) )
& reachable(X1,X2) )
<=> ( ? [X4] :
( q(X4)
& reachable(X1,X4) )
| ? [X4] :
( p(X4)
& reachable(X1,X4) ) ) ) )
& reachable(initial_world,X0) ),
inference(negated_conjecture,[],[f3]) ).
fof(f5,plain,
~ ? [X0] :
( ! [X1] :
( reachable(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(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,
! [X1] :
( sP0(X1)
<=> ( ? [X4] :
( q(X4)
& reachable(X1,X4) )
| ? [X5] :
( p(X5)
& reachable(X1,X5) ) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f10,plain,
! [X1] :
( ( ? [X2] :
( ( ? [X3] :
( q(X3)
& reachable(X2,X3) )
| p(X2) )
& reachable(X1,X2) )
<~> sP0(X1) )
| ~ sP1(X1) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP1])]) ).
fof(f11,plain,
! [X0] :
( ? [X1] :
( sP1(X1)
& reachable(X0,X1) )
| ~ reachable(initial_world,X0) ),
inference(definition_folding,[],[f8,f10,f9]) ).
fof(f12,plain,
! [X1] :
( ( ( ~ sP0(X1)
| ! [X2] :
( ( ! [X3] :
( ~ q(X3)
| ~ reachable(X2,X3) )
& ~ p(X2) )
| ~ reachable(X1,X2) ) )
& ( sP0(X1)
| ? [X2] :
( ( ? [X3] :
( q(X3)
& reachable(X2,X3) )
| p(X2) )
& reachable(X1,X2) ) ) )
| ~ sP1(X1) ),
inference(nnf_transformation,[],[f10]) ).
fof(f13,plain,
! [X0] :
( ( ( ~ sP0(X0)
| ! [X1] :
( ( ! [X2] :
( ~ q(X2)
| ~ reachable(X1,X2) )
& ~ p(X1) )
| ~ reachable(X0,X1) ) )
& ( sP0(X0)
| ? [X3] :
( ( ? [X4] :
( q(X4)
& reachable(X3,X4) )
| p(X3) )
& reachable(X0,X3) ) ) )
| ~ sP1(X0) ),
inference(rectify,[],[f12]) ).
fof(f14,plain,
! [X0] :
( ? [X3] :
( ( ? [X4] :
( q(X4)
& reachable(X3,X4) )
| p(X3) )
& reachable(X0,X3) )
=> ( ( ? [X4] :
( q(X4)
& reachable(sK2(X0),X4) )
| p(sK2(X0)) )
& reachable(X0,sK2(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f15,plain,
! [X0] :
( ? [X4] :
( q(X4)
& reachable(sK2(X0),X4) )
=> ( q(sK3(X0))
& reachable(sK2(X0),sK3(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f16,plain,
! [X0] :
( ( ( ~ sP0(X0)
| ! [X1] :
( ( ! [X2] :
( ~ q(X2)
| ~ reachable(X1,X2) )
& ~ p(X1) )
| ~ reachable(X0,X1) ) )
& ( sP0(X0)
| ( ( ( q(sK3(X0))
& reachable(sK2(X0),sK3(X0)) )
| p(sK2(X0)) )
& reachable(X0,sK2(X0)) ) ) )
| ~ sP1(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f13,f15,f14]) ).
fof(f17,plain,
! [X1] :
( ( sP0(X1)
| ( ! [X4] :
( ~ q(X4)
| ~ reachable(X1,X4) )
& ! [X5] :
( ~ p(X5)
| ~ reachable(X1,X5) ) ) )
& ( ? [X4] :
( q(X4)
& reachable(X1,X4) )
| ? [X5] :
( p(X5)
& reachable(X1,X5) )
| ~ sP0(X1) ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f18,plain,
! [X1] :
( ( sP0(X1)
| ( ! [X4] :
( ~ q(X4)
| ~ reachable(X1,X4) )
& ! [X5] :
( ~ p(X5)
| ~ reachable(X1,X5) ) ) )
& ( ? [X4] :
( q(X4)
& reachable(X1,X4) )
| ? [X5] :
( p(X5)
& reachable(X1,X5) )
| ~ sP0(X1) ) ),
inference(flattening,[],[f17]) ).
fof(f19,plain,
! [X0] :
( ( sP0(X0)
| ( ! [X1] :
( ~ q(X1)
| ~ reachable(X0,X1) )
& ! [X2] :
( ~ p(X2)
| ~ reachable(X0,X2) ) ) )
& ( ? [X3] :
( q(X3)
& reachable(X0,X3) )
| ? [X4] :
( p(X4)
& reachable(X0,X4) )
| ~ sP0(X0) ) ),
inference(rectify,[],[f18]) ).
fof(f20,plain,
! [X0] :
( ? [X3] :
( q(X3)
& reachable(X0,X3) )
=> ( q(sK4(X0))
& reachable(X0,sK4(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f21,plain,
! [X0] :
( ? [X4] :
( p(X4)
& reachable(X0,X4) )
=> ( p(sK5(X0))
& reachable(X0,sK5(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f22,plain,
! [X0] :
( ( sP0(X0)
| ( ! [X1] :
( ~ q(X1)
| ~ reachable(X0,X1) )
& ! [X2] :
( ~ p(X2)
| ~ reachable(X0,X2) ) ) )
& ( ( q(sK4(X0))
& reachable(X0,sK4(X0)) )
| ( p(sK5(X0))
& reachable(X0,sK5(X0)) )
| ~ sP0(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5])],[f19,f21,f20]) ).
fof(f23,plain,
! [X0] :
( ? [X1] :
( sP1(X1)
& reachable(X0,X1) )
=> ( sP1(sK6(X0))
& reachable(X0,sK6(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f24,plain,
! [X0] :
( ( sP1(sK6(X0))
& reachable(X0,sK6(X0)) )
| ~ reachable(initial_world,X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6])],[f11,f23]) ).
fof(f25,plain,
! [X0] : reachable(X0,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f26,plain,
! [X2,X0,X1] :
( reachable(X0,X2)
| ~ reachable(X1,X2)
| ~ reachable(X0,X1) ),
inference(cnf_transformation,[],[f7]) ).
fof(f27,plain,
! [X0] :
( sP0(X0)
| reachable(X0,sK2(X0))
| ~ sP1(X0) ),
inference(cnf_transformation,[],[f16]) ).
fof(f28,plain,
! [X0] :
( sP0(X0)
| reachable(sK2(X0),sK3(X0))
| p(sK2(X0))
| ~ sP1(X0) ),
inference(cnf_transformation,[],[f16]) ).
fof(f29,plain,
! [X0] :
( sP0(X0)
| q(sK3(X0))
| p(sK2(X0))
| ~ sP1(X0) ),
inference(cnf_transformation,[],[f16]) ).
fof(f30,plain,
! [X0,X1] :
( ~ sP0(X0)
| ~ p(X1)
| ~ reachable(X0,X1)
| ~ sP1(X0) ),
inference(cnf_transformation,[],[f16]) ).
fof(f31,plain,
! [X2,X0,X1] :
( ~ sP0(X0)
| ~ q(X2)
| ~ reachable(X1,X2)
| ~ reachable(X0,X1)
| ~ sP1(X0) ),
inference(cnf_transformation,[],[f16]) ).
fof(f32,plain,
! [X0] :
( reachable(X0,sK4(X0))
| reachable(X0,sK5(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f22]) ).
fof(f33,plain,
! [X0] :
( reachable(X0,sK4(X0))
| p(sK5(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f22]) ).
fof(f34,plain,
! [X0] :
( q(sK4(X0))
| reachable(X0,sK5(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f22]) ).
fof(f35,plain,
! [X0] :
( q(sK4(X0))
| p(sK5(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f22]) ).
fof(f36,plain,
! [X2,X0] :
( sP0(X0)
| ~ p(X2)
| ~ reachable(X0,X2) ),
inference(cnf_transformation,[],[f22]) ).
fof(f37,plain,
! [X0,X1] :
( sP0(X0)
| ~ q(X1)
| ~ reachable(X0,X1) ),
inference(cnf_transformation,[],[f22]) ).
fof(f39,plain,
! [X0] :
( sP1(sK6(X0))
| ~ reachable(initial_world,X0) ),
inference(cnf_transformation,[],[f24]) ).
cnf(c_49,plain,
reachable(X0,X0),
inference(cnf_transformation,[],[f25]) ).
cnf(c_50,plain,
( ~ reachable(X0,X1)
| ~ reachable(X1,X2)
| reachable(X0,X2) ),
inference(cnf_transformation,[],[f26]) ).
cnf(c_51,plain,
( ~ reachable(X0,X1)
| ~ reachable(X1,X2)
| ~ sP0(X0)
| ~ q(X2)
| ~ sP1(X0) ),
inference(cnf_transformation,[],[f31]) ).
cnf(c_52,plain,
( ~ reachable(X0,X1)
| ~ sP0(X0)
| ~ sP1(X0)
| ~ p(X1) ),
inference(cnf_transformation,[],[f30]) ).
cnf(c_53,plain,
( ~ sP1(X0)
| q(sK3(X0))
| p(sK2(X0))
| sP0(X0) ),
inference(cnf_transformation,[],[f29]) ).
cnf(c_54,plain,
( ~ sP1(X0)
| reachable(sK2(X0),sK3(X0))
| p(sK2(X0))
| sP0(X0) ),
inference(cnf_transformation,[],[f28]) ).
cnf(c_55,plain,
( ~ sP1(X0)
| reachable(X0,sK2(X0))
| sP0(X0) ),
inference(cnf_transformation,[],[f27]) ).
cnf(c_56,plain,
( ~ reachable(X0,X1)
| ~ q(X1)
| sP0(X0) ),
inference(cnf_transformation,[],[f37]) ).
cnf(c_57,plain,
( ~ reachable(X0,X1)
| ~ p(X1)
| sP0(X0) ),
inference(cnf_transformation,[],[f36]) ).
cnf(c_58,plain,
( ~ sP0(X0)
| q(sK4(X0))
| p(sK5(X0)) ),
inference(cnf_transformation,[],[f35]) ).
cnf(c_59,plain,
( ~ sP0(X0)
| reachable(X0,sK5(X0))
| q(sK4(X0)) ),
inference(cnf_transformation,[],[f34]) ).
cnf(c_60,plain,
( ~ sP0(X0)
| reachable(X0,sK4(X0))
| p(sK5(X0)) ),
inference(cnf_transformation,[],[f33]) ).
cnf(c_61,plain,
( ~ sP0(X0)
| reachable(X0,sK4(X0))
| reachable(X0,sK5(X0)) ),
inference(cnf_transformation,[],[f32]) ).
cnf(c_62,negated_conjecture,
( ~ reachable(initial_world,X0)
| sP1(sK6(X0)) ),
inference(cnf_transformation,[],[f39]) ).
cnf(c_64,plain,
reachable(initial_world,initial_world),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_78,plain,
( ~ reachable(X0,X1)
| ~ sP1(X0)
| ~ p(X1) ),
inference(global_subsumption_just,[status(thm)],[c_52,c_57,c_52]) ).
cnf(c_171,plain,
( ~ reachable(sK6(X0),X1)
| ~ reachable(initial_world,X0)
| ~ p(X1) ),
inference(resolution,[status(thm)],[c_78,c_62]) ).
cnf(c_182,plain,
( ~ reachable(initial_world,X0)
| reachable(sK6(X0),sK2(sK6(X0)))
| sP0(sK6(X0)) ),
inference(resolution,[status(thm)],[c_55,c_62]) ).
cnf(c_183,plain,
( ~ reachable(initial_world,initial_world)
| reachable(sK6(initial_world),sK2(sK6(initial_world)))
| sP0(sK6(initial_world)) ),
inference(instantiation,[status(thm)],[c_182]) ).
cnf(c_193,plain,
( ~ reachable(initial_world,X0)
| reachable(sK2(sK6(X0)),sK3(sK6(X0)))
| p(sK2(sK6(X0)))
| sP0(sK6(X0)) ),
inference(resolution,[status(thm)],[c_54,c_62]) ).
cnf(c_194,plain,
( ~ reachable(initial_world,initial_world)
| reachable(sK2(sK6(initial_world)),sK3(sK6(initial_world)))
| p(sK2(sK6(initial_world)))
| sP0(sK6(initial_world)) ),
inference(instantiation,[status(thm)],[c_193]) ).
cnf(c_207,plain,
( ~ reachable(initial_world,X0)
| q(sK3(sK6(X0)))
| p(sK2(sK6(X0)))
| sP0(sK6(X0)) ),
inference(resolution,[status(thm)],[c_53,c_62]) ).
cnf(c_208,plain,
( ~ reachable(initial_world,initial_world)
| q(sK3(sK6(initial_world)))
| p(sK2(sK6(initial_world)))
| sP0(sK6(initial_world)) ),
inference(instantiation,[status(thm)],[c_207]) ).
cnf(c_221,plain,
( ~ reachable(sK6(X0),X1)
| ~ reachable(X1,X2)
| ~ reachable(initial_world,X0)
| ~ sP0(sK6(X0))
| ~ q(X2) ),
inference(resolution,[status(thm)],[c_51,c_62]) ).
cnf(c_873,plain,
( ~ reachable(initial_world,X0)
| reachable(sK6(X0),sK2(sK6(X0)))
| reachable(sK6(X0),sK5(sK6(X0)))
| q(sK4(sK6(X0))) ),
inference(resolution,[status(thm)],[c_59,c_182]) ).
cnf(c_874,plain,
( ~ reachable(initial_world,initial_world)
| reachable(sK6(initial_world),sK2(sK6(initial_world)))
| reachable(sK6(initial_world),sK5(sK6(initial_world)))
| q(sK4(sK6(initial_world))) ),
inference(instantiation,[status(thm)],[c_873]) ).
cnf(c_921,plain,
( ~ reachable(initial_world,X0)
| reachable(sK6(X0),sK2(sK6(X0)))
| q(sK4(sK6(X0)))
| p(sK5(sK6(X0))) ),
inference(resolution,[status(thm)],[c_58,c_182]) ).
cnf(c_922,plain,
( ~ reachable(initial_world,initial_world)
| reachable(sK6(initial_world),sK2(sK6(initial_world)))
| q(sK4(sK6(initial_world)))
| p(sK5(sK6(initial_world))) ),
inference(instantiation,[status(thm)],[c_921]) ).
cnf(c_1887,plain,
( ~ sP0(sK6(X0))
| reachable(sK6(X0),sK5(sK6(X0)))
| q(sK4(sK6(X0))) ),
inference(instantiation,[status(thm)],[c_59]) ).
cnf(c_1888,plain,
( ~ sP0(sK6(initial_world))
| reachable(sK6(initial_world),sK5(sK6(initial_world)))
| q(sK4(sK6(initial_world))) ),
inference(instantiation,[status(thm)],[c_1887]) ).
cnf(c_1889,plain,
( ~ sP0(sK6(X0))
| reachable(sK6(X0),sK4(sK6(X0)))
| p(sK5(sK6(X0))) ),
inference(instantiation,[status(thm)],[c_60]) ).
cnf(c_1890,plain,
( ~ sP0(sK6(initial_world))
| reachable(sK6(initial_world),sK4(sK6(initial_world)))
| p(sK5(sK6(initial_world))) ),
inference(instantiation,[status(thm)],[c_1889]) ).
cnf(c_1891,plain,
( ~ sP0(sK6(X0))
| reachable(sK6(X0),sK4(sK6(X0)))
| reachable(sK6(X0),sK5(sK6(X0))) ),
inference(instantiation,[status(thm)],[c_61]) ).
cnf(c_1892,plain,
( ~ sP0(sK6(initial_world))
| reachable(sK6(initial_world),sK4(sK6(initial_world)))
| reachable(sK6(initial_world),sK5(sK6(initial_world))) ),
inference(instantiation,[status(thm)],[c_1891]) ).
cnf(c_1893,plain,
( ~ sP0(sK6(X0))
| q(sK4(sK6(X0)))
| p(sK5(sK6(X0))) ),
inference(instantiation,[status(thm)],[c_58]) ).
cnf(c_1894,plain,
( ~ sP0(sK6(initial_world))
| q(sK4(sK6(initial_world)))
| p(sK5(sK6(initial_world))) ),
inference(instantiation,[status(thm)],[c_1893]) ).
cnf(c_1895,plain,
( ~ reachable(X0,sK3(sK6(X1)))
| ~ q(sK3(sK6(X1)))
| sP0(X0) ),
inference(instantiation,[status(thm)],[c_56]) ).
cnf(c_1900,plain,
( ~ reachable(sK6(X0),sK2(sK6(X1)))
| ~ p(sK2(sK6(X1)))
| ~ reachable(initial_world,X0) ),
inference(instantiation,[status(thm)],[c_171]) ).
cnf(c_1901,plain,
( ~ reachable(sK6(initial_world),sK2(sK6(initial_world)))
| ~ p(sK2(sK6(initial_world)))
| ~ reachable(initial_world,initial_world) ),
inference(instantiation,[status(thm)],[c_1900]) ).
cnf(c_1907,plain,
( ~ reachable(X0,sK3(sK6(X1)))
| ~ reachable(X2,X0)
| reachable(X2,sK3(sK6(X1))) ),
inference(instantiation,[status(thm)],[c_50]) ).
cnf(c_1920,plain,
( ~ reachable(sK6(X0),sK5(sK6(X1)))
| ~ p(sK5(sK6(X1)))
| ~ reachable(initial_world,X0) ),
inference(instantiation,[status(thm)],[c_171]) ).
cnf(c_1921,plain,
( ~ reachable(sK6(initial_world),sK5(sK6(initial_world)))
| ~ p(sK5(sK6(initial_world)))
| ~ reachable(initial_world,initial_world) ),
inference(instantiation,[status(thm)],[c_1920]) ).
cnf(c_1925,plain,
( ~ reachable(X0,sK4(sK6(X1)))
| ~ reachable(sK6(X2),X0)
| ~ q(sK4(sK6(X1)))
| ~ reachable(initial_world,X2)
| ~ sP0(sK6(X2)) ),
inference(instantiation,[status(thm)],[c_221]) ).
cnf(c_1939,plain,
( ~ reachable(sK6(X0),sK4(sK6(X1)))
| ~ reachable(sK6(X0),sK6(X0))
| ~ q(sK4(sK6(X1)))
| ~ reachable(initial_world,X0)
| ~ sP0(sK6(X0)) ),
inference(instantiation,[status(thm)],[c_1925]) ).
cnf(c_1940,plain,
reachable(sK6(X0),sK6(X0)),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_1941,plain,
( ~ reachable(sK6(initial_world),sK4(sK6(initial_world)))
| ~ reachable(sK6(initial_world),sK6(initial_world))
| ~ q(sK4(sK6(initial_world)))
| ~ reachable(initial_world,initial_world)
| ~ sP0(sK6(initial_world)) ),
inference(instantiation,[status(thm)],[c_1939]) ).
cnf(c_1942,plain,
reachable(sK6(initial_world),sK6(initial_world)),
inference(instantiation,[status(thm)],[c_1940]) ).
cnf(c_1977,plain,
( ~ reachable(sK2(sK6(X0)),sK3(sK6(X0)))
| ~ reachable(X1,sK2(sK6(X0)))
| reachable(X1,sK3(sK6(X0))) ),
inference(instantiation,[status(thm)],[c_1907]) ).
cnf(c_2050,plain,
( ~ reachable(sK2(sK6(X0)),sK3(sK6(X0)))
| ~ reachable(sK6(X1),sK2(sK6(X0)))
| reachable(sK6(X1),sK3(sK6(X0))) ),
inference(instantiation,[status(thm)],[c_1977]) ).
cnf(c_2052,plain,
( ~ reachable(sK2(sK6(initial_world)),sK3(sK6(initial_world)))
| ~ reachable(sK6(initial_world),sK2(sK6(initial_world)))
| reachable(sK6(initial_world),sK3(sK6(initial_world))) ),
inference(instantiation,[status(thm)],[c_2050]) ).
cnf(c_2055,plain,
( ~ reachable(sK6(X0),sK3(sK6(X1)))
| ~ q(sK3(sK6(X1)))
| sP0(sK6(X0)) ),
inference(instantiation,[status(thm)],[c_1895]) ).
cnf(c_2056,plain,
( ~ reachable(sK6(initial_world),sK3(sK6(initial_world)))
| ~ q(sK3(sK6(initial_world)))
| sP0(sK6(initial_world)) ),
inference(instantiation,[status(thm)],[c_2055]) ).
cnf(c_2251,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_2056,c_2052,c_1942,c_1941,c_1921,c_1901,c_1894,c_1892,c_1890,c_1888,c_922,c_874,c_208,c_194,c_183,c_64]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN549+1 : TPTP v8.1.2. Released v2.2.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n010.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 18:29:20 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 1.90/1.19 % SZS status Started for theBenchmark.p
% 1.90/1.19 % SZS status Theorem for theBenchmark.p
% 1.90/1.19
% 1.90/1.19 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.90/1.19
% 1.90/1.19 ------ iProver source info
% 1.90/1.19
% 1.90/1.19 git: date: 2023-05-31 18:12:56 +0000
% 1.90/1.19 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.90/1.19 git: non_committed_changes: false
% 1.90/1.19 git: last_make_outside_of_git: false
% 1.90/1.19
% 1.90/1.19 ------ Parsing...
% 1.90/1.19 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.90/1.19
% 1.90/1.19 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe:1:0s pe_e sf_s rm: 0 0s sf_e pe_s pe_e
% 1.90/1.19
% 1.90/1.19 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.90/1.19 ------ Proving...
% 1.90/1.19 ------ Problem Properties
% 1.90/1.19
% 1.90/1.19
% 1.90/1.19 clauses 14
% 1.90/1.19 conjectures 1
% 1.90/1.19 EPR 4
% 1.90/1.19 Horn 7
% 1.90/1.19 unary 1
% 1.90/1.19 binary 1
% 1.90/1.19 lits 43
% 1.90/1.19 lits eq 0
% 1.90/1.19 fd_pure 0
% 1.90/1.19 fd_pseudo 0
% 1.90/1.19 fd_cond 0
% 1.90/1.19 fd_pseudo_cond 0
% 1.90/1.19 AC symbols 0
% 1.90/1.19
% 1.90/1.19 ------ Schedule dynamic 5 is on
% 1.90/1.19
% 1.90/1.19 ------ no equalities: superposition off
% 1.90/1.19
% 1.90/1.19 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.90/1.19
% 1.90/1.19
% 1.90/1.19 ------
% 1.90/1.19 Current options:
% 1.90/1.19 ------
% 1.90/1.19
% 1.90/1.19
% 1.90/1.19
% 1.90/1.19
% 1.90/1.19 ------ Proving...
% 1.90/1.19
% 1.90/1.19
% 1.90/1.19 % SZS status Theorem for theBenchmark.p
% 1.90/1.19
% 1.90/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.90/1.20
% 1.95/1.20
%------------------------------------------------------------------------------