TSTP Solution File: SYN548+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SYN548+1 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --ignore_missing on --mode portfolio/casc [--schedule casc_hol_2020] -p tptp -om szs -t %d %s
% Computer : n001.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 : Sat Sep 2 14:26:51 EDT 2023
% Result : Theorem 6.28s 1.38s
% Output : Refutation 6.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 30
% Number of leaves : 11
% Syntax : Number of formulae : 114 ( 12 unt; 0 def)
% Number of atoms : 417 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 450 ( 147 ~; 222 |; 52 &)
% ( 5 <=>; 21 =>; 0 <=; 3 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-1 aty)
% Number of variables : 153 (; 130 !; 23 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f119159,plain,
$false,
inference(subsumption_resolution,[],[f119133,f4200]) ).
fof(f4200,plain,
sP0(sK7(initial_world)),
inference(resolution,[],[f4199,f3268]) ).
fof(f3268,plain,
( ~ sP0(sK7(sK7(initial_world)))
| sP0(sK7(initial_world)) ),
inference(resolution,[],[f3258,f52]) ).
fof(f52,plain,
( ~ sP1(sK7(sK7(initial_world)))
| ~ sP0(sK7(sK7(initial_world))) ),
inference(resolution,[],[f30,f48]) ).
fof(f48,plain,
sP2(sK7(sK7(initial_world))),
inference(resolution,[],[f46,f42]) ).
fof(f42,plain,
! [X0] :
( ~ reachable(initial_world,X0)
| sP2(sK7(X0)) ),
inference(cnf_transformation,[],[f28]) ).
fof(f28,plain,
! [X0] :
( ( sP2(sK7(X0))
& reachable(X0,sK7(X0)) )
| ~ reachable(initial_world,X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK7])],[f13,f27]) ).
fof(f27,plain,
! [X0] :
( ? [X1] :
( sP2(X1)
& reachable(X0,X1) )
=> ( sP2(sK7(X0))
& reachable(X0,sK7(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f13,plain,
! [X0] :
( ? [X1] :
( sP2(X1)
& reachable(X0,X1) )
| ~ reachable(initial_world,X0) ),
inference(definition_folding,[],[f7,f12,f11,f10]) ).
fof(f10,plain,
! [X1] :
( sP0(X1)
<=> ! [X2] :
( ! [X3] :
( q(X3)
| ~ reachable(X2,X3) )
| p(X2)
| ~ reachable(X1,X2) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f11,plain,
! [X1] :
( sP1(X1)
<=> ( ! [X4] :
( q(X4)
| ~ reachable(X1,X4) )
| ! [X5] :
( p(X5)
| ~ reachable(X1,X5) ) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP1])]) ).
fof(f12,plain,
! [X1] :
( ( sP0(X1)
<~> sP1(X1) )
| ~ sP2(X1) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP2])]) ).
fof(f7,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,[],[f6]) ).
fof(f6,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(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(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(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/tmp/tmp.Z1i7dXoCxe/Vampire---4.8_24256',prove_this) ).
fof(f46,plain,
reachable(initial_world,sK7(initial_world)),
inference(resolution,[],[f41,f43]) ).
fof(f43,plain,
! [X0] : reachable(X0,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0] : reachable(X0,X0),
file('/export/starexec/sandbox2/tmp/tmp.Z1i7dXoCxe/Vampire---4.8_24256',reflexivity_of_reachable) ).
fof(f41,plain,
! [X0] :
( ~ reachable(initial_world,X0)
| reachable(X0,sK7(X0)) ),
inference(cnf_transformation,[],[f28]) ).
fof(f30,plain,
! [X0] :
( ~ sP2(X0)
| ~ sP0(X0)
| ~ sP1(X0) ),
inference(cnf_transformation,[],[f15]) ).
fof(f15,plain,
! [X0] :
( ( ( ~ sP1(X0)
| ~ sP0(X0) )
& ( sP1(X0)
| sP0(X0) ) )
| ~ sP2(X0) ),
inference(rectify,[],[f14]) ).
fof(f14,plain,
! [X1] :
( ( ( ~ sP1(X1)
| ~ sP0(X1) )
& ( sP1(X1)
| sP0(X1) ) )
| ~ sP2(X1) ),
inference(nnf_transformation,[],[f12]) ).
fof(f3258,plain,
( sP1(sK7(sK7(initial_world)))
| sP0(sK7(initial_world)) ),
inference(resolution,[],[f3254,f49]) ).
fof(f49,plain,
( sP1(sK7(initial_world))
| sP0(sK7(initial_world)) ),
inference(resolution,[],[f29,f45]) ).
fof(f45,plain,
sP2(sK7(initial_world)),
inference(resolution,[],[f43,f42]) ).
fof(f29,plain,
! [X0] :
( ~ sP2(X0)
| sP0(X0)
| sP1(X0) ),
inference(cnf_transformation,[],[f15]) ).
fof(f3254,plain,
( ~ sP1(sK7(initial_world))
| sP1(sK7(sK7(initial_world))) ),
inference(subsumption_resolution,[],[f3252,f33]) ).
fof(f33,plain,
! [X0] :
( ~ p(sK4(X0))
| sP1(X0) ),
inference(cnf_transformation,[],[f21]) ).
fof(f21,plain,
! [X0] :
( ( sP1(X0)
| ( ~ q(sK3(X0))
& reachable(X0,sK3(X0))
& ~ p(sK4(X0))
& reachable(X0,sK4(X0)) ) )
& ( ! [X3] :
( q(X3)
| ~ reachable(X0,X3) )
| ! [X4] :
( p(X4)
| ~ reachable(X0,X4) )
| ~ sP1(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f18,f20,f19]) ).
fof(f19,plain,
! [X0] :
( ? [X1] :
( ~ q(X1)
& reachable(X0,X1) )
=> ( ~ q(sK3(X0))
& reachable(X0,sK3(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f20,plain,
! [X0] :
( ? [X2] :
( ~ p(X2)
& reachable(X0,X2) )
=> ( ~ p(sK4(X0))
& reachable(X0,sK4(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f18,plain,
! [X0] :
( ( sP1(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) )
| ~ sP1(X0) ) ),
inference(rectify,[],[f17]) ).
fof(f17,plain,
! [X1] :
( ( sP1(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) )
| ~ sP1(X1) ) ),
inference(flattening,[],[f16]) ).
fof(f16,plain,
! [X1] :
( ( sP1(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) )
| ~ sP1(X1) ) ),
inference(nnf_transformation,[],[f11]) ).
fof(f3252,plain,
( p(sK4(sK7(sK7(initial_world))))
| sP1(sK7(sK7(initial_world)))
| ~ sP1(sK7(initial_world)) ),
inference(duplicate_literal_removal,[],[f3239]) ).
fof(f3239,plain,
( p(sK4(sK7(sK7(initial_world))))
| sP1(sK7(sK7(initial_world)))
| ~ sP1(sK7(initial_world))
| sP1(sK7(sK7(initial_world))) ),
inference(resolution,[],[f310,f336]) ).
fof(f336,plain,
( reachable(sK7(initial_world),sK4(sK7(sK7(initial_world))))
| sP1(sK7(sK7(initial_world))) ),
inference(resolution,[],[f75,f47]) ).
fof(f47,plain,
reachable(sK7(initial_world),sK7(sK7(initial_world))),
inference(resolution,[],[f46,f41]) ).
fof(f75,plain,
! [X4,X5] :
( ~ reachable(X4,X5)
| reachable(X4,sK4(X5))
| sP1(X5) ),
inference(resolution,[],[f44,f32]) ).
fof(f32,plain,
! [X0] :
( reachable(X0,sK4(X0))
| sP1(X0) ),
inference(cnf_transformation,[],[f21]) ).
fof(f44,plain,
! [X2,X0,X1] :
( ~ reachable(X1,X2)
| reachable(X0,X2)
| ~ reachable(X0,X1) ),
inference(cnf_transformation,[],[f9]) ).
fof(f9,plain,
! [X0,X1,X2] :
( reachable(X0,X2)
| ~ reachable(X1,X2)
| ~ reachable(X0,X1) ),
inference(flattening,[],[f8]) ).
fof(f8,plain,
! [X0,X1,X2] :
( reachable(X0,X2)
| ~ reachable(X1,X2)
| ~ reachable(X0,X1) ),
inference(ennf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0,X1,X2] :
( ( reachable(X1,X2)
& reachable(X0,X1) )
=> reachable(X0,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.Z1i7dXoCxe/Vampire---4.8_24256',transitivity_of_reachable) ).
fof(f310,plain,
! [X1] :
( ~ reachable(sK7(initial_world),X1)
| p(X1)
| sP1(sK7(sK7(initial_world)))
| ~ sP1(sK7(initial_world)) ),
inference(subsumption_resolution,[],[f307,f35]) ).
fof(f35,plain,
! [X0] :
( ~ q(sK3(X0))
| sP1(X0) ),
inference(cnf_transformation,[],[f21]) ).
fof(f307,plain,
! [X1] :
( sP1(sK7(sK7(initial_world)))
| q(sK3(sK7(sK7(initial_world))))
| p(X1)
| ~ reachable(sK7(initial_world),X1)
| ~ sP1(sK7(initial_world)) ),
inference(resolution,[],[f255,f31]) ).
fof(f31,plain,
! [X3,X0,X4] :
( ~ reachable(X0,X3)
| q(X3)
| p(X4)
| ~ reachable(X0,X4)
| ~ sP1(X0) ),
inference(cnf_transformation,[],[f21]) ).
fof(f255,plain,
( reachable(sK7(initial_world),sK3(sK7(sK7(initial_world))))
| sP1(sK7(sK7(initial_world))) ),
inference(resolution,[],[f74,f47]) ).
fof(f74,plain,
! [X2,X3] :
( ~ reachable(X2,X3)
| reachable(X2,sK3(X3))
| sP1(X3) ),
inference(resolution,[],[f44,f34]) ).
fof(f34,plain,
! [X0] :
( reachable(X0,sK3(X0))
| sP1(X0) ),
inference(cnf_transformation,[],[f21]) ).
fof(f4199,plain,
sP0(sK7(sK7(initial_world))),
inference(subsumption_resolution,[],[f4183,f507]) ).
fof(f507,plain,
( ~ sP0(sK7(initial_world))
| sP0(sK7(sK7(initial_world))) ),
inference(duplicate_literal_removal,[],[f500]) ).
fof(f500,plain,
( sP0(sK7(sK7(initial_world)))
| ~ sP0(sK7(initial_world))
| sP0(sK7(sK7(initial_world))) ),
inference(resolution,[],[f432,f185]) ).
fof(f185,plain,
! [X16,X17] :
( ~ reachable(X17,sK5(X16))
| ~ sP0(X17)
| sP0(X16) ),
inference(subsumption_resolution,[],[f184,f38]) ).
fof(f38,plain,
! [X0] :
( ~ p(sK5(X0))
| sP0(X0) ),
inference(cnf_transformation,[],[f26]) ).
fof(f26,plain,
! [X0] :
( ( sP0(X0)
| ( ~ q(sK6(X0))
& reachable(sK5(X0),sK6(X0))
& ~ p(sK5(X0))
& reachable(X0,sK5(X0)) ) )
& ( ! [X3] :
( ! [X4] :
( q(X4)
| ~ reachable(X3,X4) )
| p(X3)
| ~ reachable(X0,X3) )
| ~ sP0(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6])],[f23,f25,f24]) ).
fof(f24,plain,
! [X0] :
( ? [X1] :
( ? [X2] :
( ~ q(X2)
& reachable(X1,X2) )
& ~ p(X1)
& reachable(X0,X1) )
=> ( ? [X2] :
( ~ q(X2)
& reachable(sK5(X0),X2) )
& ~ p(sK5(X0))
& reachable(X0,sK5(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f25,plain,
! [X0] :
( ? [X2] :
( ~ q(X2)
& reachable(sK5(X0),X2) )
=> ( ~ q(sK6(X0))
& reachable(sK5(X0),sK6(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f23,plain,
! [X0] :
( ( sP0(X0)
| ? [X1] :
( ? [X2] :
( ~ q(X2)
& reachable(X1,X2) )
& ~ p(X1)
& reachable(X0,X1) ) )
& ( ! [X3] :
( ! [X4] :
( q(X4)
| ~ reachable(X3,X4) )
| p(X3)
| ~ reachable(X0,X3) )
| ~ sP0(X0) ) ),
inference(rectify,[],[f22]) ).
fof(f22,plain,
! [X1] :
( ( sP0(X1)
| ? [X2] :
( ? [X3] :
( ~ q(X3)
& reachable(X2,X3) )
& ~ p(X2)
& reachable(X1,X2) ) )
& ( ! [X2] :
( ! [X3] :
( q(X3)
| ~ reachable(X2,X3) )
| p(X2)
| ~ reachable(X1,X2) )
| ~ sP0(X1) ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f184,plain,
! [X16,X17] :
( p(sK5(X16))
| ~ reachable(X17,sK5(X16))
| ~ sP0(X17)
| sP0(X16) ),
inference(subsumption_resolution,[],[f175,f40]) ).
fof(f40,plain,
! [X0] :
( ~ q(sK6(X0))
| sP0(X0) ),
inference(cnf_transformation,[],[f26]) ).
fof(f175,plain,
! [X16,X17] :
( q(sK6(X16))
| p(sK5(X16))
| ~ reachable(X17,sK5(X16))
| ~ sP0(X17)
| sP0(X16) ),
inference(resolution,[],[f36,f39]) ).
fof(f39,plain,
! [X0] :
( reachable(sK5(X0),sK6(X0))
| sP0(X0) ),
inference(cnf_transformation,[],[f26]) ).
fof(f36,plain,
! [X3,X0,X4] :
( ~ reachable(X3,X4)
| q(X4)
| p(X3)
| ~ reachable(X0,X3)
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f26]) ).
fof(f432,plain,
( reachable(sK7(initial_world),sK5(sK7(sK7(initial_world))))
| sP0(sK7(sK7(initial_world))) ),
inference(resolution,[],[f76,f47]) ).
fof(f76,plain,
! [X6,X7] :
( ~ reachable(X6,X7)
| reachable(X6,sK5(X7))
| sP0(X7) ),
inference(resolution,[],[f44,f37]) ).
fof(f37,plain,
! [X0] :
( reachable(X0,sK5(X0))
| sP0(X0) ),
inference(cnf_transformation,[],[f26]) ).
fof(f4183,plain,
( sP0(sK7(sK7(initial_world)))
| sP0(sK7(initial_world)) ),
inference(resolution,[],[f4179,f49]) ).
fof(f4179,plain,
( ~ sP1(sK7(initial_world))
| sP0(sK7(sK7(initial_world))) ),
inference(subsumption_resolution,[],[f4178,f38]) ).
fof(f4178,plain,
( p(sK5(sK7(sK7(initial_world))))
| sP0(sK7(sK7(initial_world)))
| ~ sP1(sK7(initial_world)) ),
inference(duplicate_literal_removal,[],[f4163]) ).
fof(f4163,plain,
( p(sK5(sK7(sK7(initial_world))))
| sP0(sK7(sK7(initial_world)))
| ~ sP1(sK7(initial_world))
| sP0(sK7(sK7(initial_world))) ),
inference(resolution,[],[f988,f432]) ).
fof(f988,plain,
! [X0] :
( ~ reachable(sK7(initial_world),X0)
| p(X0)
| sP0(sK7(sK7(initial_world)))
| ~ sP1(sK7(initial_world)) ),
inference(subsumption_resolution,[],[f979,f40]) ).
fof(f979,plain,
! [X0] :
( sP0(sK7(sK7(initial_world)))
| q(sK6(sK7(sK7(initial_world))))
| p(X0)
| ~ reachable(sK7(initial_world),X0)
| ~ sP1(sK7(initial_world)) ),
inference(resolution,[],[f860,f31]) ).
fof(f860,plain,
( reachable(sK7(initial_world),sK6(sK7(sK7(initial_world))))
| sP0(sK7(sK7(initial_world))) ),
inference(duplicate_literal_removal,[],[f859]) ).
fof(f859,plain,
( reachable(sK7(initial_world),sK6(sK7(sK7(initial_world))))
| sP0(sK7(sK7(initial_world)))
| sP0(sK7(sK7(initial_world))) ),
inference(resolution,[],[f81,f432]) ).
fof(f81,plain,
! [X12,X13] :
( ~ reachable(X12,sK5(X13))
| reachable(X12,sK6(X13))
| sP0(X13) ),
inference(resolution,[],[f44,f39]) ).
fof(f119133,plain,
~ sP0(sK7(initial_world)),
inference(resolution,[],[f119132,f51]) ).
fof(f51,plain,
( ~ sP1(sK7(initial_world))
| ~ sP0(sK7(initial_world)) ),
inference(resolution,[],[f30,f45]) ).
fof(f119132,plain,
sP1(sK7(initial_world)),
inference(subsumption_resolution,[],[f119130,f16843]) ).
fof(f16843,plain,
sP0(sK7(sK4(sK7(initial_world)))),
inference(subsumption_resolution,[],[f16818,f4200]) ).
fof(f16818,plain,
( sP0(sK7(sK4(sK7(initial_world))))
| ~ sP0(sK7(initial_world)) ),
inference(resolution,[],[f15998,f51]) ).
fof(f15998,plain,
( sP1(sK7(initial_world))
| sP0(sK7(sK4(sK7(initial_world)))) ),
inference(duplicate_literal_removal,[],[f15937]) ).
fof(f15937,plain,
( sP0(sK7(sK4(sK7(initial_world))))
| sP0(sK7(sK4(sK7(initial_world))))
| sP1(sK7(initial_world)) ),
inference(resolution,[],[f15665,f361]) ).
fof(f361,plain,
( sP1(sK7(sK4(sK7(initial_world))))
| sP0(sK7(sK4(sK7(initial_world))))
| sP1(sK7(initial_world)) ),
inference(resolution,[],[f349,f29]) ).
fof(f349,plain,
( sP2(sK7(sK4(sK7(initial_world))))
| sP1(sK7(initial_world)) ),
inference(resolution,[],[f323,f42]) ).
fof(f323,plain,
( reachable(initial_world,sK4(sK7(initial_world)))
| sP1(sK7(initial_world)) ),
inference(resolution,[],[f75,f46]) ).
fof(f15665,plain,
! [X9] :
( ~ sP1(X9)
| sP0(X9) ),
inference(subsumption_resolution,[],[f15662,f38]) ).
fof(f15662,plain,
! [X9] :
( p(sK5(X9))
| sP0(X9)
| ~ sP1(X9) ),
inference(duplicate_literal_removal,[],[f15389]) ).
fof(f15389,plain,
! [X9] :
( p(sK5(X9))
| sP0(X9)
| ~ sP1(X9)
| sP0(X9) ),
inference(resolution,[],[f1062,f37]) ).
fof(f1062,plain,
! [X0,X1] :
( ~ reachable(X0,X1)
| p(X1)
| sP0(X0)
| ~ sP1(X0) ),
inference(subsumption_resolution,[],[f1043,f40]) ).
fof(f1043,plain,
! [X0,X1] :
( sP0(X0)
| q(sK6(X0))
| p(X1)
| ~ reachable(X0,X1)
| ~ sP1(X0) ),
inference(resolution,[],[f863,f31]) ).
fof(f863,plain,
! [X0] :
( reachable(X0,sK6(X0))
| sP0(X0) ),
inference(duplicate_literal_removal,[],[f853]) ).
fof(f853,plain,
! [X0] :
( reachable(X0,sK6(X0))
| sP0(X0)
| sP0(X0) ),
inference(resolution,[],[f81,f37]) ).
fof(f119130,plain,
( sP1(sK7(initial_world))
| ~ sP0(sK7(sK4(sK7(initial_world)))) ),
inference(duplicate_literal_removal,[],[f119125]) ).
fof(f119125,plain,
( sP1(sK7(initial_world))
| ~ sP0(sK7(sK4(sK7(initial_world))))
| sP1(sK7(initial_world)) ),
inference(resolution,[],[f119121,f360]) ).
fof(f360,plain,
( ~ sP1(sK7(sK4(sK7(initial_world))))
| ~ sP0(sK7(sK4(sK7(initial_world))))
| sP1(sK7(initial_world)) ),
inference(resolution,[],[f349,f30]) ).
fof(f119121,plain,
( sP1(sK7(sK4(sK7(initial_world))))
| sP1(sK7(initial_world)) ),
inference(subsumption_resolution,[],[f119118,f33]) ).
fof(f119118,plain,
( sP1(sK7(sK4(sK7(initial_world))))
| p(sK4(sK7(sK4(sK7(initial_world)))))
| sP1(sK7(initial_world)) ),
inference(duplicate_literal_removal,[],[f119040]) ).
fof(f119040,plain,
( sP1(sK7(sK4(sK7(initial_world))))
| p(sK4(sK7(sK4(sK7(initial_world)))))
| sP1(sK7(initial_world))
| sP1(sK7(initial_world))
| sP1(sK7(sK4(sK7(initial_world)))) ),
inference(resolution,[],[f74606,f385]) ).
fof(f385,plain,
( reachable(sK4(sK7(initial_world)),sK4(sK7(sK4(sK7(initial_world)))))
| sP1(sK7(initial_world))
| sP1(sK7(sK4(sK7(initial_world)))) ),
inference(resolution,[],[f348,f75]) ).
fof(f348,plain,
( reachable(sK4(sK7(initial_world)),sK7(sK4(sK7(initial_world))))
| sP1(sK7(initial_world)) ),
inference(resolution,[],[f323,f41]) ).
fof(f74606,plain,
! [X0] :
( ~ reachable(sK4(sK7(initial_world)),X0)
| sP1(sK7(sK4(sK7(initial_world))))
| p(X0)
| sP1(sK7(initial_world)) ),
inference(subsumption_resolution,[],[f74605,f4214]) ).
fof(f4214,plain,
( sP1(sK4(sK7(initial_world)))
| sP1(sK7(initial_world)) ),
inference(resolution,[],[f4200,f773]) ).
fof(f773,plain,
! [X2] :
( ~ sP0(X2)
| sP1(sK4(X2))
| sP1(X2) ),
inference(subsumption_resolution,[],[f740,f33]) ).
fof(f740,plain,
! [X2] :
( p(sK4(X2))
| ~ sP0(X2)
| sP1(sK4(X2))
| sP1(X2) ),
inference(resolution,[],[f181,f32]) ).
fof(f181,plain,
! [X2,X3] :
( ~ reachable(X3,X2)
| p(X2)
| ~ sP0(X3)
| sP1(X2) ),
inference(subsumption_resolution,[],[f164,f35]) ).
fof(f164,plain,
! [X2,X3] :
( q(sK3(X2))
| p(X2)
| ~ reachable(X3,X2)
| ~ sP0(X3)
| sP1(X2) ),
inference(resolution,[],[f36,f34]) ).
fof(f74605,plain,
! [X0] :
( sP1(sK7(initial_world))
| sP1(sK7(sK4(sK7(initial_world))))
| p(X0)
| ~ reachable(sK4(sK7(initial_world)),X0)
| ~ sP1(sK4(sK7(initial_world))) ),
inference(subsumption_resolution,[],[f74582,f35]) ).
fof(f74582,plain,
! [X0] :
( sP1(sK7(initial_world))
| sP1(sK7(sK4(sK7(initial_world))))
| q(sK3(sK7(sK4(sK7(initial_world)))))
| p(X0)
| ~ reachable(sK4(sK7(initial_world)),X0)
| ~ sP1(sK4(sK7(initial_world))) ),
inference(resolution,[],[f386,f31]) ).
fof(f386,plain,
( reachable(sK4(sK7(initial_world)),sK3(sK7(sK4(sK7(initial_world)))))
| sP1(sK7(initial_world))
| sP1(sK7(sK4(sK7(initial_world)))) ),
inference(resolution,[],[f348,f74]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN548+1 : TPTP v8.1.2. Released v2.2.0.
% 0.14/0.14 % Command : vampire --ignore_missing on --mode portfolio/casc [--schedule casc_hol_2020] -p tptp -om szs -t %d %s
% 0.14/0.35 % Computer : n001.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Wed Aug 30 16:29:25 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.41 % (24589)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.42 % (24659)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on Vampire---4 for (1451ds/0Mi)
% 0.21/0.42 % (24660)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on Vampire---4 for (569ds/0Mi)
% 0.21/0.42 % (24671)dis-2_2:3_amm=sco:anc=none:bce=on:fsr=off:gsp=on:nm=16:nwc=1.2:nicw=on:sac=on:sp=weighted_frequency_476 on Vampire---4 for (476ds/0Mi)
% 0.21/0.42 % (24680)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on Vampire---4 for (396ds/0Mi)
% 0.21/0.42 % (24674)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on Vampire---4 for (470ds/0Mi)
% 0.21/0.42 % (24684)dis+11_4:5_nm=4_216 on Vampire---4 for (216ds/0Mi)
% 0.21/0.42 % (24687)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2:si=on:rtra=on:rawr=on:rp=on:fmbksg=on_1451 on Vampire---4 for (1451ds/0Mi)
% 0.21/0.42 TRYING [1]
% 0.21/0.42 TRYING [2]
% 0.21/0.42 TRYING [1]
% 0.21/0.42 TRYING [1]
% 0.21/0.42 TRYING [2]
% 0.21/0.42 TRYING [1]
% 0.21/0.42 TRYING [2]
% 0.21/0.42 TRYING [2]
% 0.21/0.42 TRYING [3]
% 0.21/0.42 TRYING [3]
% 0.21/0.42 TRYING [3]
% 0.21/0.42 TRYING [3]
% 0.21/0.42 TRYING [4]
% 0.21/0.42 TRYING [4]
% 0.21/0.42 TRYING [4]
% 0.21/0.43 TRYING [4]
% 0.21/0.43 TRYING [5]
% 0.22/0.44 TRYING [5]
% 0.22/0.44 TRYING [5]
% 0.22/0.45 TRYING [5]
% 0.22/0.52 TRYING [6]
% 0.22/0.53 TRYING [6]
% 0.22/0.55 TRYING [6]
% 0.22/0.61 TRYING [6]
% 3.56/0.92 TRYING [7]
% 3.56/0.93 TRYING [7]
% 3.56/0.96 TRYING [7]
% 6.28/1.37 % (24680)First to succeed.
% 6.28/1.38 % (24680)Refutation found. Thanks to Tanya!
% 6.28/1.38 % SZS status Theorem for Vampire---4
% 6.28/1.38 % SZS output start Proof for Vampire---4
% See solution above
% 6.28/1.38 % (24680)------------------------------
% 6.28/1.38 % (24680)Version: Vampire 4.7 (commit 05ef610bd on 2023-06-21 19:03:17 +0100)
% 6.28/1.38 % (24680)Linked with Z3 4.9.1.0 6ed071b44407cf6623b8d3c0dceb2a8fb7040cee z3-4.8.4-6427-g6ed071b44
% 6.28/1.38 % (24680)Termination reason: Refutation
% 6.28/1.38
% 6.28/1.38 % (24680)Memory used [KB]: 11897
% 6.28/1.38 % (24680)Time elapsed: 0.958 s
% 6.28/1.38 % (24680)------------------------------
% 6.28/1.38 % (24680)------------------------------
% 6.28/1.38 % (24589)Success in time 0.998 s
% 6.28/1.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------