TSTP Solution File: SYN548+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---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 : n006.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:41:34 EDT 2023
% Result : Theorem 0.21s 0.47s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 14
% Syntax : Number of formulae : 106 ( 5 unt; 0 def)
% Number of atoms : 422 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 516 ( 200 ~; 232 |; 52 &)
% ( 8 <=>; 21 =>; 0 <=; 3 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 4 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-1 aty)
% Number of variables : 171 (; 148 !; 23 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1917,plain,
$false,
inference(avatar_sat_refutation,[],[f352,f515,f1903,f1907]) ).
fof(f1907,plain,
( ~ spl8_10
| spl8_94 ),
inference(avatar_contradiction_clause,[],[f1906]) ).
fof(f1906,plain,
( $false
| ~ spl8_10
| spl8_94 ),
inference(subsumption_resolution,[],[f1905,f956]) ).
fof(f956,plain,
( ~ sP1(sK7(initial_world))
| ~ spl8_10 ),
inference(subsumption_resolution,[],[f353,f292]) ).
fof(f292,plain,
! [X0] :
( sP0(X0)
| ~ sP1(X0) ),
inference(duplicate_literal_removal,[],[f289]) ).
fof(f289,plain,
! [X0] :
( ~ sP1(X0)
| sP0(X0)
| sP0(X0) ),
inference(resolution,[],[f288,f37]) ).
fof(f37,plain,
! [X0] :
( reachable(X0,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(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(f288,plain,
! [X14,X15] :
( ~ reachable(X14,sK5(X15))
| ~ sP1(X14)
| sP0(X15) ),
inference(subsumption_resolution,[],[f287,f40]) ).
fof(f40,plain,
! [X0] :
( ~ q(sK6(X0))
| sP0(X0) ),
inference(cnf_transformation,[],[f26]) ).
fof(f287,plain,
! [X14,X15] :
( ~ sP1(X14)
| q(sK6(X15))
| ~ reachable(X14,sK5(X15))
| sP0(X15) ),
inference(subsumption_resolution,[],[f284,f78]) ).
fof(f78,plain,
! [X14,X15] :
( ~ reachable(X15,sK5(X14))
| ~ sP0(X15)
| sP0(X14) ),
inference(subsumption_resolution,[],[f77,f38]) ).
fof(f38,plain,
! [X0] :
( ~ p(sK5(X0))
| sP0(X0) ),
inference(cnf_transformation,[],[f26]) ).
fof(f77,plain,
! [X14,X15] :
( p(sK5(X14))
| ~ reachable(X15,sK5(X14))
| ~ sP0(X15)
| sP0(X14) ),
inference(subsumption_resolution,[],[f74,f40]) ).
fof(f74,plain,
! [X14,X15] :
( q(sK6(X14))
| p(sK5(X14))
| ~ reachable(X15,sK5(X14))
| ~ sP0(X15)
| sP0(X14) ),
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(f284,plain,
! [X14,X15] :
( ~ sP1(X14)
| sP0(X14)
| q(sK6(X15))
| ~ reachable(X14,sK5(X15))
| sP0(X15) ),
inference(resolution,[],[f94,f39]) ).
fof(f94,plain,
! [X2,X3,X1] :
( ~ reachable(X3,X1)
| ~ sP1(X2)
| sP0(X2)
| q(X1)
| ~ reachable(X2,X3) ),
inference(resolution,[],[f55,f44]) ).
fof(f44,plain,
! [X2,X0,X1] :
( reachable(X0,X2)
| ~ reachable(X1,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.CcLt35AU1a/Vampire---4.8_32712',transitivity_of_reachable) ).
fof(f55,plain,
! [X10,X11] :
( ~ reachable(X10,X11)
| q(X11)
| ~ sP1(X10)
| sP0(X10) ),
inference(subsumption_resolution,[],[f51,f38]) ).
fof(f51,plain,
! [X10,X11] :
( ~ reachable(X10,X11)
| p(sK5(X10))
| q(X11)
| ~ sP1(X10)
| sP0(X10) ),
inference(resolution,[],[f31,f37]) ).
fof(f31,plain,
! [X3,X0,X4] :
( ~ reachable(X0,X4)
| ~ reachable(X0,X3)
| p(X4)
| q(X3)
| ~ 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(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(f353,plain,
( ~ sP0(sK7(initial_world))
| ~ sP1(sK7(initial_world))
| ~ spl8_10 ),
inference(resolution,[],[f342,f30]) ).
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(f12,plain,
! [X1] :
( ( sP0(X1)
<~> sP1(X1) )
| ~ sP2(X1) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP2])]) ).
fof(f342,plain,
( sP2(sK7(initial_world))
| ~ spl8_10 ),
inference(avatar_component_clause,[],[f341]) ).
fof(f341,plain,
( spl8_10
<=> sP2(sK7(initial_world)) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_10])]) ).
fof(f1905,plain,
( sP1(sK7(initial_world))
| ~ spl8_10
| spl8_94 ),
inference(subsumption_resolution,[],[f1756,f1904]) ).
fof(f1904,plain,
( sP0(sK7(initial_world))
| ~ spl8_10 ),
inference(subsumption_resolution,[],[f974,f342]) ).
fof(f974,plain,
( sP0(sK7(initial_world))
| ~ sP2(sK7(initial_world))
| ~ spl8_10 ),
inference(resolution,[],[f956,f29]) ).
fof(f29,plain,
! [X0] :
( sP1(X0)
| sP0(X0)
| ~ sP2(X0) ),
inference(cnf_transformation,[],[f15]) ).
fof(f1756,plain,
( ~ sP0(sK7(initial_world))
| sP1(sK7(initial_world))
| spl8_94 ),
inference(resolution,[],[f1665,f134]) ).
fof(f134,plain,
! [X5] :
( sP0(sK4(X5))
| ~ sP0(X5)
| sP1(X5) ),
inference(resolution,[],[f130,f32]) ).
fof(f32,plain,
! [X0] :
( reachable(X0,sK4(X0))
| sP1(X0) ),
inference(cnf_transformation,[],[f21]) ).
fof(f130,plain,
! [X0,X1] :
( ~ reachable(X1,X0)
| ~ sP0(X1)
| sP0(X0) ),
inference(duplicate_literal_removal,[],[f126]) ).
fof(f126,plain,
! [X0,X1] :
( sP0(X0)
| ~ sP0(X1)
| ~ reachable(X1,X0)
| sP0(X0) ),
inference(resolution,[],[f81,f37]) ).
fof(f81,plain,
! [X2,X3,X4] :
( ~ reachable(X4,sK5(X3))
| sP0(X3)
| ~ sP0(X2)
| ~ reachable(X2,X4) ),
inference(resolution,[],[f78,f44]) ).
fof(f1665,plain,
( ~ sP0(sK4(sK7(initial_world)))
| spl8_94 ),
inference(avatar_component_clause,[],[f1663]) ).
fof(f1663,plain,
( spl8_94
<=> sP0(sK4(sK7(initial_world))) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_94])]) ).
fof(f1903,plain,
( ~ spl8_10
| ~ spl8_17
| ~ spl8_94 ),
inference(avatar_contradiction_clause,[],[f1902]) ).
fof(f1902,plain,
( $false
| ~ spl8_10
| ~ spl8_17
| ~ spl8_94 ),
inference(subsumption_resolution,[],[f1901,f956]) ).
fof(f1901,plain,
( sP1(sK7(initial_world))
| ~ spl8_10
| ~ spl8_17
| ~ spl8_94 ),
inference(resolution,[],[f1900,f33]) ).
fof(f33,plain,
! [X0] :
( ~ p(sK4(X0))
| sP1(X0) ),
inference(cnf_transformation,[],[f21]) ).
fof(f1900,plain,
( p(sK4(sK7(initial_world)))
| ~ spl8_10
| ~ spl8_17
| ~ spl8_94 ),
inference(subsumption_resolution,[],[f1896,f956]) ).
fof(f1896,plain,
( p(sK4(sK7(initial_world)))
| sP1(sK7(initial_world))
| ~ spl8_17
| ~ spl8_94 ),
inference(subsumption_resolution,[],[f1893,f1664]) ).
fof(f1664,plain,
( sP0(sK4(sK7(initial_world)))
| ~ spl8_94 ),
inference(avatar_component_clause,[],[f1663]) ).
fof(f1893,plain,
( ~ sP0(sK4(sK7(initial_world)))
| p(sK4(sK7(initial_world)))
| sP1(sK7(initial_world))
| ~ spl8_17 ),
inference(resolution,[],[f1849,f32]) ).
fof(f1849,plain,
( ! [X3] :
( ~ reachable(sK7(initial_world),X3)
| ~ sP0(X3)
| p(X3) )
| ~ spl8_17 ),
inference(resolution,[],[f196,f473]) ).
fof(f473,plain,
( reachable(initial_world,sK7(initial_world))
| ~ spl8_17 ),
inference(avatar_component_clause,[],[f472]) ).
fof(f472,plain,
( spl8_17
<=> reachable(initial_world,sK7(initial_world)) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_17])]) ).
fof(f196,plain,
! [X0,X1] :
( ~ reachable(initial_world,X1)
| ~ sP0(X0)
| ~ reachable(X1,X0)
| p(X0) ),
inference(resolution,[],[f193,f44]) ).
fof(f193,plain,
! [X2] :
( ~ reachable(initial_world,X2)
| p(X2)
| ~ sP0(X2) ),
inference(subsumption_resolution,[],[f190,f111]) ).
fof(f111,plain,
! [X0] :
( sP1(X0)
| ~ sP0(X0)
| p(X0) ),
inference(resolution,[],[f76,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.CcLt35AU1a/Vampire---4.8_32712',reflexivity_of_reachable) ).
fof(f76,plain,
! [X6,X7] :
( ~ reachable(X7,X6)
| p(X6)
| ~ sP0(X7)
| sP1(X6) ),
inference(subsumption_resolution,[],[f70,f35]) ).
fof(f35,plain,
! [X0] :
( ~ q(sK3(X0))
| sP1(X0) ),
inference(cnf_transformation,[],[f21]) ).
fof(f70,plain,
! [X6,X7] :
( q(sK3(X6))
| p(X6)
| ~ reachable(X7,X6)
| ~ sP0(X7)
| sP1(X6) ),
inference(resolution,[],[f36,f34]) ).
fof(f34,plain,
! [X0] :
( reachable(X0,sK3(X0))
| sP1(X0) ),
inference(cnf_transformation,[],[f21]) ).
fof(f190,plain,
! [X2] :
( p(X2)
| ~ reachable(initial_world,X2)
| ~ sP1(X2)
| ~ sP0(X2) ),
inference(duplicate_literal_removal,[],[f187]) ).
fof(f187,plain,
! [X2] :
( p(X2)
| ~ reachable(initial_world,X2)
| ~ sP1(X2)
| ~ sP0(X2)
| ~ reachable(initial_world,X2) ),
inference(resolution,[],[f185,f136]) ).
fof(f136,plain,
! [X7] :
( sP0(sK7(X7))
| ~ sP0(X7)
| ~ reachable(initial_world,X7) ),
inference(resolution,[],[f130,f41]) ).
fof(f41,plain,
! [X0] :
( reachable(X0,sK7(X0))
| ~ reachable(initial_world,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(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.CcLt35AU1a/Vampire---4.8_32712',prove_this) ).
fof(f185,plain,
! [X0] :
( ~ sP0(sK7(X0))
| p(X0)
| ~ reachable(initial_world,X0)
| ~ sP1(X0) ),
inference(duplicate_literal_removal,[],[f184]) ).
fof(f184,plain,
! [X0] :
( ~ sP1(X0)
| p(X0)
| ~ reachable(initial_world,X0)
| ~ sP0(sK7(X0))
| ~ reachable(initial_world,X0) ),
inference(resolution,[],[f169,f45]) ).
fof(f45,plain,
! [X0] :
( ~ sP1(sK7(X0))
| ~ sP0(sK7(X0))
| ~ reachable(initial_world,X0) ),
inference(resolution,[],[f30,f42]) ).
fof(f42,plain,
! [X0] :
( sP2(sK7(X0))
| ~ reachable(initial_world,X0) ),
inference(cnf_transformation,[],[f28]) ).
fof(f169,plain,
! [X7] :
( sP1(sK7(X7))
| ~ sP1(X7)
| p(X7)
| ~ reachable(initial_world,X7) ),
inference(resolution,[],[f162,f41]) ).
fof(f162,plain,
! [X6,X7] :
( ~ reachable(X7,X6)
| p(X7)
| ~ sP1(X7)
| sP1(X6) ),
inference(subsumption_resolution,[],[f156,f35]) ).
fof(f156,plain,
! [X6,X7] :
( q(sK3(X6))
| ~ sP1(X7)
| p(X7)
| ~ reachable(X7,X6)
| sP1(X6) ),
inference(resolution,[],[f57,f34]) ).
fof(f57,plain,
! [X2,X3,X1] :
( ~ reachable(X3,X2)
| q(X2)
| ~ sP1(X1)
| p(X1)
| ~ reachable(X1,X3) ),
inference(resolution,[],[f47,f44]) ).
fof(f47,plain,
! [X0,X1] :
( ~ reachable(X0,X1)
| p(X0)
| q(X1)
| ~ sP1(X0) ),
inference(resolution,[],[f31,f43]) ).
fof(f515,plain,
spl8_17,
inference(avatar_contradiction_clause,[],[f514]) ).
fof(f514,plain,
( $false
| spl8_17 ),
inference(subsumption_resolution,[],[f512,f43]) ).
fof(f512,plain,
( ~ reachable(initial_world,initial_world)
| spl8_17 ),
inference(resolution,[],[f474,f41]) ).
fof(f474,plain,
( ~ reachable(initial_world,sK7(initial_world))
| spl8_17 ),
inference(avatar_component_clause,[],[f472]) ).
fof(f352,plain,
spl8_10,
inference(avatar_contradiction_clause,[],[f351]) ).
fof(f351,plain,
( $false
| spl8_10 ),
inference(subsumption_resolution,[],[f350,f43]) ).
fof(f350,plain,
( ~ reachable(initial_world,initial_world)
| spl8_10 ),
inference(resolution,[],[f343,f42]) ).
fof(f343,plain,
( ~ sP2(sK7(initial_world))
| spl8_10 ),
inference(avatar_component_clause,[],[f341]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN548+1 : TPTP v8.1.2. Released v2.2.0.
% 0.15/0.14 % Command : vampire --ignore_missing on --mode portfolio/casc [--schedule casc_hol_2020] -p tptp -om szs -t %d %s
% 0.15/0.35 % Computer : n006.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sat Aug 26 19:26:52 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.15/0.35 This is a FOF_THM_RFO_NEQ problem
% 0.15/0.36 Running vampire_casc2023 --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/tmp/tmp.CcLt35AU1a/Vampire---4.8_32712
% 0.15/0.36 % (450)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.42 % (453)dis-1002_1_av=off:bsr=on:cond=on:flr=on:fsr=off:gsp=on:nwc=2.0:sims=off_1218 on Vampire---4 for (1218ds/0Mi)
% 0.21/0.42 % (455)lrs+11_4:3_aac=none:add=off:amm=off:anc=none:bd=preordered:bs=on:bce=on:flr=on:fsd=off:fsr=off:fde=none:nwc=2.5:sims=off:sp=reverse_arity:tgt=full:stl=188_1106 on Vampire---4 for (1106ds/0Mi)
% 0.21/0.42 % (456)dis-1_128_add=large:amm=sco:anc=all_dependent:bs=on:bsr=on:bce=on:cond=fast:fsr=off:gsp=on:gs=on:gsem=off:lcm=predicate:lma=on:nm=32:nwc=4.0:nicw=on:sac=on:sp=weighted_frequency_692 on Vampire---4 for (692ds/0Mi)
% 0.21/0.42 % (459)ott+10_8_br=off:cond=on:fsr=off:gsp=on:nm=16:nwc=3.0:sims=off:sp=reverse_frequency:urr=on_415 on Vampire---4 for (415ds/0Mi)
% 0.21/0.42 % (460)dis+3_1024_av=off:fsr=off:gsp=on:lcm=predicate:nm=4:sos=all:sp=weighted_frequency_338 on Vampire---4 for (338ds/0Mi)
% 0.21/0.42 % (457)ott-1010_5_add=off:amm=off:anc=none:bce=on:cond=fast:flr=on:lma=on:nm=2:nwc=1.1:sp=occurrence:tgt=ground_470 on Vampire---4 for (470ds/0Mi)
% 0.21/0.44 % (451)lrs-1_7_acc=on:amm=off:anc=all:bs=on:bsr=on:cond=fast:flr=on:fsr=off:gsp=on:lcm=reverse:lma=on:msp=off:nm=0:nwc=1.2:sp=frequency:stl=188_1354 on Vampire---4 for (1354ds/0Mi)
% 0.21/0.47 % (457)First to succeed.
% 0.21/0.47 % (457)Refutation found. Thanks to Tanya!
% 0.21/0.47 % SZS status Theorem for Vampire---4
% 0.21/0.47 % SZS output start Proof for Vampire---4
% See solution above
% 0.21/0.47 % (457)------------------------------
% 0.21/0.47 % (457)Version: Vampire 4.7 (commit 05ef610bd on 2023-06-21 19:03:17 +0100)
% 0.21/0.47 % (457)Linked with Z3 4.9.1.0 6ed071b44407cf6623b8d3c0dceb2a8fb7040cee z3-4.8.4-6427-g6ed071b44
% 0.21/0.47 % (457)Termination reason: Refutation
% 0.21/0.47
% 0.21/0.47 % (457)Memory used [KB]: 6268
% 0.21/0.47 % (457)Time elapsed: 0.053 s
% 0.21/0.47 % (457)------------------------------
% 0.21/0.47 % (457)------------------------------
% 0.21/0.47 % (450)Success in time 0.113 s
% 0.21/0.47 % Vampire---4.8 exiting
%------------------------------------------------------------------------------