%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SYN549+1 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n017.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 03:40:46 PM UTC 2026
% Result : Theorem 0.76s 1.09s
% Output : CNFRefutation 0.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 84 ( 7 unt; 2 def)
% Number of atoms : 367 ( 0 equ)
% Maximal formula atoms : 11 ( 4 avg)
% Number of connectives : 435 ( 170 ~; 200 |; 55 &)
% ( 4 <=>; 4 =>; 0 <=; 2 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-1 aty)
% Number of variables : 158 ( 0 sgn 123 !; 35 ?; 63 :)
% 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] :
( ( ? [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/sandbox2/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,[status(cth)],[f3]) ).
fof(f5,plain,
~ ? [X0] :
( ! [X1] :
( reachable(X0,X1)
=> ( ? [X2] :
( ( ? [X3] :
( q(X3)
& reachable(X2,X3) )
| p(X2) )
& reachable(X1,X2) )
<=> ( ? [X5] :
( q(X5)
& reachable(X1,X5) )
| ? [X4] :
( p(X4)
& reachable(X1,X4) ) ) ) )
& reachable(initial_world,X0) ),
inference(rectify,[],[f4]) ).
fof(f6,plain,
! [X0,X1,X2] :
( ~ reachable(X1,X2)
| ~ reachable(X0,X1)
| reachable(X0,X2) ),
inference(ennf_transformation,[],[f2]) ).
fof(f7,plain,
! [X0,X1,X2] :
( ~ reachable(X1,X2)
| ~ reachable(X0,X1)
| reachable(X0,X2) ),
inference(flattening,[],[f6]) ).
fof(f8,plain,
! [X0] :
( ? [X1] :
( reachable(X0,X1)
& ( ? [X2] :
( ( ? [X3] :
( q(X3)
& reachable(X2,X3) )
| p(X2) )
& reachable(X1,X2) )
<~> ( ? [X5] :
( q(X5)
& reachable(X1,X5) )
| ? [X4] :
( p(X4)
& reachable(X1,X4) ) ) ) )
| ~ reachable(initial_world,X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f12,plain,
! [X1] :
( ~ sP1(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) )
| ~ sP0(X1) ) ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f13,plain,
! [X0] :
( ~ sP1(X0)
| ( ( ? [X3] :
( ( ? [X4] :
( q(X4)
& reachable(X3,X4) )
| p(X3) )
& reachable(X0,X3) )
| sP0(X0) )
& ( ! [X1] :
( ( ! [X2] :
( ~ q(X2)
| ~ reachable(X1,X2) )
& ~ p(X1) )
| ~ reachable(X0,X1) )
| ~ sP0(X0) ) ) ),
inference(rectify,[],[f12]) ).
fof(f14,plain,
! [X0] :
( ~ sP1(X0)
| ( ( ( ( ( q(sK3(X0))
& reachable(sK2(X0),sK3(X0)) )
| p(sK2(X0)) )
& reachable(X0,sK2(X0)) )
| sP0(X0) )
& ( ! [X1] :
( ( ! [X2] :
( ~ q(X2)
| ~ reachable(X1,X2) )
& ~ p(X1) )
| ~ reachable(X0,X1) )
| ~ sP0(X0) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3]),skolemize(X3,sK2(X0)),skolemize(X4,sK3(X0))],[f13]) ).
fof(f19,plain,
! [X0] :
( ( reachable(X0,sK6(X0))
& sP1(sK6(X0)) )
| ~ reachable(initial_world,X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6]),skolemize(X1,sK6(X0))],[f11]) ).
fof(f20,plain,
! [X0] : reachable(X0,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f21,plain,
! [X2,X0,X1] :
( ~ reachable(X1,X2)
| ~ reachable(X0,X1)
| reachable(X0,X2) ),
inference(cnf_transformation,[],[f7]) ).
fof(f22,plain,
! [X0] :
( ~ sP1(X0)
| q(sK3(X0))
| p(sK2(X0))
| sP0(X0) ),
inference(cnf_transformation,[],[f14]) ).
fof(f23,plain,
! [X0] :
( ~ sP1(X0)
| reachable(sK2(X0),sK3(X0))
| p(sK2(X0))
| sP0(X0) ),
inference(cnf_transformation,[],[f14]) ).
fof(f24,plain,
! [X0] :
( ~ sP1(X0)
| reachable(X0,sK2(X0))
| sP0(X0) ),
inference(cnf_transformation,[],[f14]) ).
fof(f25,plain,
! [X2,X0,X1] :
( ~ sP1(X0)
| ~ q(X2)
| ~ reachable(X1,X2)
| ~ reachable(X0,X1)
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f14]) ).
fof(f26,plain,
! [X0,X1] :
( ~ sP1(X0)
| ~ p(X1)
| ~ reachable(X0,X1)
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f14]) ).
fof(f34,plain,
! [X0] :
( sP1(sK6(X0))
| ~ reachable(initial_world,X0) ),
inference(cnf_transformation,[],[f19]) ).
tcf(c_49,plain,
! [X0: $i] : reachable(X0,X0),
inference(cnf_transformation,[],[f20]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i,X2: $i] :
( reachable(X0,X2)
| ~ reachable(X1,X2)
| ~ reachable(X0,X1) ),
inference(cnf_transformation,[],[f21]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i] :
( ~ sP1(X0)
| ~ p(X1)
| ~ sP0(X0)
| ~ reachable(X0,X1) ),
inference(cnf_transformation,[],[f26]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ q(X2)
| ~ sP1(X0)
| ~ sP0(X0)
| ~ reachable(X1,X2)
| ~ reachable(X0,X1) ),
inference(cnf_transformation,[],[f25]) ).
tcf(c_53,plain,
! [X0: $i] :
( sP0(X0)
| reachable(X0,sK2(X0))
| ~ sP1(X0) ),
inference(cnf_transformation,[],[f24]) ).
tcf(c_54,plain,
! [X0: $i] :
( sP0(X0)
| p(sK2(X0))
| reachable(sK2(X0),sK3(X0))
| ~ sP1(X0) ),
inference(cnf_transformation,[],[f23]) ).
tcf(c_55,plain,
! [X0: $i] :
( sP0(X0)
| q(sK3(X0))
| p(sK2(X0))
| ~ sP1(X0) ),
inference(cnf_transformation,[],[f22]) ).
tcf(c_62,negated_conjecture,
! [X0: $i] :
( sP1(sK6(X0))
| ~ reachable(initial_world,X0) ),
inference(cnf_transformation,[],[f34]) ).
tcf(c_64,plain,
reachable(initial_world,initial_world),
inference(instantiation,[status(thm)],[c_49]) ).
tcf(c_182,plain,
! [X0: $i] :
( sP0(sK6(X0))
| q(sK3(sK6(X0)))
| p(sK2(sK6(X0)))
| ~ reachable(initial_world,X0) ),
inference(resolution,[status(thm)],[c_55,c_62]) ).
tcf(c_196,plain,
! [X0: $i] :
( sP0(sK6(X0))
| p(sK2(sK6(X0)))
| reachable(sK2(sK6(X0)),sK3(sK6(X0)))
| ~ reachable(initial_world,X0) ),
inference(resolution,[status(thm)],[c_54,c_62]) ).
tcf(c_210,plain,
! [X0: $i] :
( sP0(sK6(X0))
| reachable(sK6(X0),sK2(sK6(X0)))
| ~ reachable(initial_world,X0) ),
inference(resolution,[status(thm)],[c_53,c_62]) ).
tcf(c_211,plain,
( sP0(sK6(initial_world))
| reachable(sK6(initial_world),sK2(sK6(initial_world)))
| ~ reachable(initial_world,initial_world) ),
inference(instantiation,[status(thm)],[c_210]) ).
tcf(c_221,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ q(X2)
| ~ sP0(sK6(X0))
| ~ reachable(initial_world,X0)
| ~ reachable(X1,X2)
| ~ reachable(sK6(X0),X1) ),
inference(resolution,[status(thm)],[c_52,c_62]) ).
tcf(c_1887,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ q(X2)
| ~ sP0(sK6(X0))
| ~ reachable(initial_world,X0)
| ~ reachable(X1,X2)
| ~ reachable(sK6(X0),X1) ),
inference(demodulation,[status(thm)],[c_221]) ).
tcf(c_1922,plain,
! [X0: $i,X1: $i,X2: $i] :
( reachable(X2,sK3(sK6(X1)))
| ~ reachable(X2,X0)
| ~ reachable(X0,sK3(sK6(X1))) ),
inference(instantiation,[status(thm)],[c_50]) ).
tcf(c_1931,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ sP0(sK6(X2))
| ~ reachable(initial_world,X2)
| ~ q(sK5(sK6(X1)))
| ~ reachable(sK6(X2),X0)
| ~ reachable(X0,sK5(sK6(X1))) ),
inference(instantiation,[status(thm)],[c_1887]) ).
tcf(c_1945,plain,
! [X0: $i,X1: $i] :
( ~ sP0(sK6(X0))
| ~ reachable(initial_world,X0)
| ~ q(sK5(sK6(X1)))
| ~ reachable(sK6(X0),sK6(X0))
| ~ reachable(sK6(X0),sK5(sK6(X1))) ),
inference(instantiation,[status(thm)],[c_1931]) ).
tcf(c_1946,plain,
! [X0: $i] : reachable(sK6(X0),sK6(X0)),
inference(instantiation,[status(thm)],[c_49]) ).
tcf(c_1947,plain,
( ~ sP0(sK6(initial_world))
| ~ reachable(initial_world,initial_world)
| ~ q(sK5(sK6(initial_world)))
| ~ reachable(sK6(initial_world),sK6(initial_world))
| ~ reachable(sK6(initial_world),sK5(sK6(initial_world))) ),
inference(instantiation,[status(thm)],[c_1945]) ).
tcf(c_1948,plain,
reachable(sK6(initial_world),sK6(initial_world)),
inference(instantiation,[status(thm)],[c_1946]) ).
tcf(c_1972,plain,
! [X0: $i,X1: $i] :
( reachable(X1,sK3(sK6(X0)))
| ~ reachable(X1,sK2(sK6(X0)))
| ~ reachable(sK2(sK6(X0)),sK3(sK6(X0))) ),
inference(instantiation,[status(thm)],[c_1922]) ).
tcf(c_1982,plain,
! [X0: $i,X1: $i] :
( reachable(sK6(X1),sK3(sK6(X0)))
| ~ reachable(sK6(X1),sK2(sK6(X0)))
| ~ reachable(sK2(sK6(X0)),sK3(sK6(X0))) ),
inference(instantiation,[status(thm)],[c_1972]) ).
tcf(c_1984,plain,
( reachable(sK6(initial_world),sK3(sK6(initial_world)))
| ~ reachable(sK6(initial_world),sK2(sK6(initial_world)))
| ~ reachable(sK2(sK6(initial_world)),sK3(sK6(initial_world))) ),
inference(instantiation,[status(thm)],[c_1982]) ).
fof(f9,definition,
! [X1] :
( sP0(X1)
<=> ( ? [X5] :
( q(X5)
& reachable(X1,X5) )
| ? [X4] :
( p(X4)
& reachable(X1,X4) ) ) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f10,definition,
! [X1] :
( ~ sP1(X1)
| ( ? [X2] :
( ( ? [X3] :
( q(X3)
& reachable(X2,X3) )
| p(X2) )
& reachable(X1,X2) )
<~> sP0(X1) ) ),
introduced(definition,[new_symbols(definition,[sP1])],[predicate_definition_introduction]) ).
fof(f11,plain,
! [X0] :
( ? [X1] :
( reachable(X0,X1)
& sP1(X1) )
| ~ reachable(initial_world,X0) ),
inference(definition_folding,[],[f8,f10,f9]) ).
fof(f15,plain,
! [X1] :
( ( ~ sP0(X1)
| ? [X5] :
( q(X5)
& reachable(X1,X5) )
| ? [X4] :
( p(X4)
& reachable(X1,X4) ) )
& ( ( ! [X5] :
( ~ q(X5)
| ~ reachable(X1,X5) )
& ! [X4] :
( ~ p(X4)
| ~ reachable(X1,X4) ) )
| sP0(X1) ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f16,plain,
! [X1] :
( ( ~ sP0(X1)
| ? [X5] :
( q(X5)
& reachable(X1,X5) )
| ? [X4] :
( p(X4)
& reachable(X1,X4) ) )
& ( ( ! [X5] :
( ~ q(X5)
| ~ reachable(X1,X5) )
& ! [X4] :
( ~ p(X4)
| ~ reachable(X1,X4) ) )
| sP0(X1) ) ),
inference(flattening,[],[f15]) ).
fof(f17,plain,
! [X0] :
( ( ~ sP0(X0)
| ? [X4] :
( q(X4)
& reachable(X0,X4) )
| ? [X3] :
( p(X3)
& reachable(X0,X3) ) )
& ( ( ! [X2] :
( ~ q(X2)
| ~ reachable(X0,X2) )
& ! [X1] :
( ~ p(X1)
| ~ reachable(X0,X1) ) )
| sP0(X0) ) ),
inference(rectify,[],[f16]) ).
fof(f18,plain,
! [X0] :
( ( ~ sP0(X0)
| ( q(sK5(X0))
& reachable(X0,sK5(X0)) )
| ( p(sK4(X0))
& reachable(X0,sK4(X0)) ) )
& ( ( ! [X2] :
( ~ q(X2)
| ~ reachable(X0,X2) )
& ! [X1] :
( ~ p(X1)
| ~ reachable(X0,X1) ) )
| sP0(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5]),skolemize(X3,sK4(X0)),skolemize(X4,sK5(X0))],[f17]) ).
fof(f27,plain,
! [X0] :
( ~ sP0(X0)
| q(sK5(X0))
| p(sK4(X0)) ),
inference(cnf_transformation,[],[f18]) ).
fof(f28,plain,
! [X0] :
( ~ sP0(X0)
| reachable(X0,sK5(X0))
| p(sK4(X0)) ),
inference(cnf_transformation,[],[f18]) ).
fof(f29,plain,
! [X0] :
( ~ sP0(X0)
| q(sK5(X0))
| reachable(X0,sK4(X0)) ),
inference(cnf_transformation,[],[f18]) ).
fof(f30,plain,
! [X0] :
( ~ sP0(X0)
| reachable(X0,sK5(X0))
| reachable(X0,sK4(X0)) ),
inference(cnf_transformation,[],[f18]) ).
fof(f31,plain,
! [X2,X0] :
( ~ q(X2)
| ~ reachable(X0,X2)
| sP0(X0) ),
inference(cnf_transformation,[],[f18]) ).
fof(f32,plain,
! [X0,X1] :
( ~ p(X1)
| ~ reachable(X0,X1)
| sP0(X0) ),
inference(cnf_transformation,[],[f18]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i] :
( sP0(X0)
| ~ p(X1)
| ~ reachable(X0,X1) ),
inference(cnf_transformation,[],[f32]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i] :
( sP0(X0)
| ~ q(X1)
| ~ reachable(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
tcf(c_58,plain,
! [X0: $i] :
( reachable(X0,sK5(X0))
| reachable(X0,sK4(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f30]) ).
tcf(c_59,plain,
! [X0: $i] :
( q(sK5(X0))
| reachable(X0,sK4(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f29]) ).
tcf(c_60,plain,
! [X0: $i] :
( p(sK4(X0))
| reachable(X0,sK5(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f28]) ).
tcf(c_61,plain,
! [X0: $i] :
( q(sK5(X0))
| p(sK4(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f27]) ).
tcf(c_78,plain,
! [X0: $i,X1: $i] :
( ~ sP1(X0)
| ~ p(X1)
| ~ reachable(X0,X1) ),
inference(global_subsumption_just,[status(thm)],[c_51,c_56,c_51]) ).
tcf(c_171,plain,
! [X0: $i,X1: $i] :
( ~ p(X1)
| ~ reachable(initial_world,X0)
| ~ reachable(sK6(X0),X1) ),
inference(resolution,[status(thm)],[c_78,c_62]) ).
tcf(c_448,plain,
! [X0: $i,X1: $i] :
( sP0(sK6(X1))
| reachable(sK2(sK6(X1)),sK3(sK6(X1)))
| ~ reachable(initial_world,X1)
| ~ reachable(initial_world,X0)
| ~ reachable(sK6(X0),sK2(sK6(X1))) ),
inference(resolution,[status(thm)],[c_171,c_196]) ).
tcf(c_449,plain,
( sP0(sK6(initial_world))
| reachable(sK2(sK6(initial_world)),sK3(sK6(initial_world)))
| ~ reachable(initial_world,initial_world)
| ~ reachable(sK6(initial_world),sK2(sK6(initial_world))) ),
inference(instantiation,[status(thm)],[c_448]) ).
tcf(c_465,plain,
! [X0: $i,X1: $i] :
( sP0(sK6(X1))
| q(sK3(sK6(X1)))
| ~ reachable(initial_world,X1)
| ~ reachable(initial_world,X0)
| ~ reachable(sK6(X0),sK2(sK6(X1))) ),
inference(resolution,[status(thm)],[c_171,c_182]) ).
tcf(c_466,plain,
( sP0(sK6(initial_world))
| q(sK3(sK6(initial_world)))
| ~ reachable(initial_world,initial_world)
| ~ reachable(sK6(initial_world),sK2(sK6(initial_world))) ),
inference(instantiation,[status(thm)],[c_465]) ).
tcf(c_1891,plain,
! [X0: $i,X1: $i] :
( ~ p(X1)
| ~ reachable(initial_world,X0)
| ~ reachable(sK6(X0),X1) ),
inference(demodulation,[status(thm)],[c_171]) ).
tcf(c_1893,plain,
! [X0: $i] :
( q(sK5(sK6(X0)))
| reachable(sK6(X0),sK4(sK6(X0)))
| ~ sP0(sK6(X0)) ),
inference(instantiation,[status(thm)],[c_59]) ).
tcf(c_1894,plain,
( q(sK5(sK6(initial_world)))
| reachable(sK6(initial_world),sK4(sK6(initial_world)))
| ~ sP0(sK6(initial_world)) ),
inference(instantiation,[status(thm)],[c_1893]) ).
tcf(c_1895,plain,
! [X0: $i] :
( p(sK4(sK6(X0)))
| reachable(sK6(X0),sK5(sK6(X0)))
| ~ sP0(sK6(X0)) ),
inference(instantiation,[status(thm)],[c_60]) ).
tcf(c_1896,plain,
( p(sK4(sK6(initial_world)))
| reachable(sK6(initial_world),sK5(sK6(initial_world)))
| ~ sP0(sK6(initial_world)) ),
inference(instantiation,[status(thm)],[c_1895]) ).
tcf(c_1897,plain,
! [X0: $i] :
( reachable(sK6(X0),sK5(sK6(X0)))
| reachable(sK6(X0),sK4(sK6(X0)))
| ~ sP0(sK6(X0)) ),
inference(instantiation,[status(thm)],[c_58]) ).
tcf(c_1898,plain,
( reachable(sK6(initial_world),sK5(sK6(initial_world)))
| reachable(sK6(initial_world),sK4(sK6(initial_world)))
| ~ sP0(sK6(initial_world)) ),
inference(instantiation,[status(thm)],[c_1897]) ).
tcf(c_1899,plain,
! [X0: $i] :
( q(sK5(sK6(X0)))
| p(sK4(sK6(X0)))
| ~ sP0(sK6(X0)) ),
inference(instantiation,[status(thm)],[c_61]) ).
tcf(c_1900,plain,
( q(sK5(sK6(initial_world)))
| p(sK4(sK6(initial_world)))
| ~ sP0(sK6(initial_world)) ),
inference(instantiation,[status(thm)],[c_1899]) ).
tcf(c_1914,plain,
! [X0: $i,X1: $i] :
( sP0(X0)
| ~ q(sK3(sK6(X1)))
| ~ reachable(X0,sK3(sK6(X1))) ),
inference(instantiation,[status(thm)],[c_57]) ).
tcf(c_1977,plain,
! [X0: $i,X1: $i] :
( ~ reachable(initial_world,X0)
| ~ p(sK4(sK6(X1)))
| ~ reachable(sK6(X0),sK4(sK6(X1))) ),
inference(instantiation,[status(thm)],[c_1891]) ).
tcf(c_1978,plain,
( ~ reachable(initial_world,initial_world)
| ~ p(sK4(sK6(initial_world)))
| ~ reachable(sK6(initial_world),sK4(sK6(initial_world))) ),
inference(instantiation,[status(thm)],[c_1977]) ).
tcf(c_2054,plain,
! [X0: $i,X1: $i] :
( sP0(sK6(X0))
| ~ q(sK3(sK6(X1)))
| ~ reachable(sK6(X0),sK3(sK6(X1))) ),
inference(instantiation,[status(thm)],[c_1914]) ).
tcf(c_2055,plain,
( sP0(sK6(initial_world))
| ~ q(sK3(sK6(initial_world)))
| ~ reachable(sK6(initial_world),sK3(sK6(initial_world))) ),
inference(instantiation,[status(thm)],[c_2054]) ).
tcf(c_2490,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_2055,c_1984,c_1978,c_1948,c_1947,c_1900,c_1898,c_1896,c_1894,c_466,c_449,c_211,c_64]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN549+1 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.36 % Computer : n017.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Fri Sep 25 01:38:50 UTC 2026
% 0.12/0.36 % CPUTime :
% 0.12/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.40 Running first-order theorem proving
% 0.12/0.40 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/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...
% 0.76/1.09 % SZS status Started for theBenchmark.p
% 0.76/1.09 % SZS status Theorem for theBenchmark.p
% 0.76/1.09
% 0.76/1.09 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.76/1.09
% 0.76/1.09 % ------ iProver source info
% 0.76/1.09
% 0.76/1.09 % git: date: 2026-07-19 20:42:38 +0200
% 0.76/1.09 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.76/1.09 % git: non_committed_changes: false
% 0.76/1.09
% 0.76/1.09 % ------ Parsing...
% 0.76/1.09 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.76/1.09
% 0.76/1.09 % ------ 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 %
% 0.76/1.09
% 0.76/1.09 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.76/1.09 % ------ Proving...
% 0.76/1.09 % ------ Problem Properties
% 0.76/1.09
% 0.76/1.09 %
% 0.76/1.09 % clauses 14
% 0.76/1.09 % conjectures 1
% 0.76/1.09 % EPR 4
% 0.76/1.09 % Horn 7
% 0.76/1.09 % unary 1
% 0.76/1.09 % binary 1
% 0.76/1.09 % lits 43
% 0.76/1.09 % lits eq 0
% 0.76/1.09 % fd_pure 0
% 0.76/1.09 % fd_pseudo 0
% 0.76/1.09 % fd_cond 0
% 0.76/1.09 % fd_pseudo_cond 0
% 0.76/1.09 % AC symbols 0
% 0.76/1.09
% 0.76/1.09 % ------ Schedule dynamic 5 is on
% 0.76/1.09
% 0.76/1.09 % ------ no equalities: superposition off
% 0.76/1.09
% 0.76/1.09 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.76/1.09
% 0.76/1.09
% 0.76/1.09 % ------
% 0.76/1.09 % Current options:
% 0.76/1.09 % ------
% 0.76/1.09
% 0.76/1.09
% 0.76/1.09 %
% 0.76/1.09
% 0.76/1.09 % ------ Proving...
% 0.76/1.09 %
% 0.76/1.09
% 0.76/1.09 % SZS status Theorem for theBenchmark.p
% 0.76/1.09
% 0.76/1.09 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.76/1.09
% 0.76/1.09
%------------------------------------------------------------------------------