TSTP Solution File: SYN415+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SYN415+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% Computer : n004.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 : Wed Aug 31 19:26:32 EDT 2022
% Result : Theorem 0.19s 0.48s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of formulae : 63 ( 1 unt; 0 def)
% Number of atoms : 251 ( 50 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 303 ( 115 ~; 116 |; 48 &)
% ( 11 <=>; 10 =>; 0 <=; 3 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 9 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 83 ( 53 !; 30 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f236,plain,
$false,
inference(avatar_sat_refutation,[],[f35,f39,f43,f48,f96,f104,f117,f235]) ).
fof(f235,plain,
( ~ spl6_1
| ~ spl6_2
| ~ spl6_3 ),
inference(avatar_contradiction_clause,[],[f234]) ).
fof(f234,plain,
( $false
| ~ spl6_1
| ~ spl6_2
| ~ spl6_3 ),
inference(subsumption_resolution,[],[f219,f203]) ).
fof(f203,plain,
( sK3 != sK4(sK3)
| ~ spl6_1
| ~ spl6_2 ),
inference(unit_resulting_resolution,[],[f162,f30]) ).
fof(f30,plain,
( ! [X0] :
( sK4(X0) != X0
| ~ f(X0) )
| ~ spl6_1 ),
inference(avatar_component_clause,[],[f29]) ).
fof(f29,plain,
( spl6_1
<=> ! [X0] :
( ~ f(X0)
| sK4(X0) != X0 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_1])]) ).
fof(f162,plain,
( f(sK3)
| ~ spl6_2 ),
inference(subsumption_resolution,[],[f20,f33]) ).
fof(f33,plain,
( sP0
| ~ spl6_2 ),
inference(avatar_component_clause,[],[f32]) ).
fof(f32,plain,
( spl6_2
<=> sP0 ),
introduced(avatar_definition,[new_symbols(naming,[spl6_2])]) ).
fof(f20,plain,
( f(sK3)
| ~ sP0 ),
inference(cnf_transformation,[],[f13]) ).
fof(f13,plain,
( ( sP0
| ! [X0] : ~ f(X0)
| ( sK1 != sK2
& f(sK1)
& f(sK2) ) )
& ( ( f(sK3)
& ! [X4,X5] :
( X4 = X5
| ~ f(X4)
| ~ f(X5) ) )
| ~ sP0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f10,f12,f11]) ).
fof(f11,plain,
( ? [X1,X2] :
( X1 != X2
& f(X1)
& f(X2) )
=> ( sK1 != sK2
& f(sK1)
& f(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f12,plain,
( ? [X3] : f(X3)
=> f(sK3) ),
introduced(choice_axiom,[]) ).
fof(f10,plain,
( ( sP0
| ! [X0] : ~ f(X0)
| ? [X1,X2] :
( X1 != X2
& f(X1)
& f(X2) ) )
& ( ( ? [X3] : f(X3)
& ! [X4,X5] :
( X4 = X5
| ~ f(X4)
| ~ f(X5) ) )
| ~ sP0 ) ),
inference(rectify,[],[f9]) ).
fof(f9,plain,
( ( sP0
| ! [X2] : ~ f(X2)
| ? [X4,X3] :
( X3 != X4
& f(X4)
& f(X3) ) )
& ( ( ? [X2] : f(X2)
& ! [X4,X3] :
( X3 = X4
| ~ f(X4)
| ~ f(X3) ) )
| ~ sP0 ) ),
inference(flattening,[],[f8]) ).
fof(f8,plain,
( ( sP0
| ! [X2] : ~ f(X2)
| ? [X4,X3] :
( X3 != X4
& f(X4)
& f(X3) ) )
& ( ( ? [X2] : f(X2)
& ! [X4,X3] :
( X3 = X4
| ~ f(X4)
| ~ f(X3) ) )
| ~ sP0 ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f6,plain,
( sP0
<=> ( ? [X2] : f(X2)
& ! [X4,X3] :
( X3 = X4
| ~ f(X4)
| ~ f(X3) ) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f219,plain,
( sK3 = sK4(sK3)
| ~ spl6_2
| ~ spl6_3 ),
inference(unit_resulting_resolution,[],[f33,f162,f204,f19]) ).
fof(f19,plain,
! [X4,X5] :
( ~ f(X4)
| ~ f(X5)
| X4 = X5
| ~ sP0 ),
inference(cnf_transformation,[],[f13]) ).
fof(f204,plain,
( f(sK4(sK3))
| ~ spl6_2
| ~ spl6_3 ),
inference(unit_resulting_resolution,[],[f162,f38]) ).
fof(f38,plain,
( ! [X0] :
( f(sK4(X0))
| ~ f(X0) )
| ~ spl6_3 ),
inference(avatar_component_clause,[],[f37]) ).
fof(f37,plain,
( spl6_3
<=> ! [X0] :
( ~ f(X0)
| f(sK4(X0)) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_3])]) ).
fof(f117,plain,
( spl6_2
| ~ spl6_5
| ~ spl6_6
| ~ spl6_8 ),
inference(avatar_split_clause,[],[f116,f99,f88,f45,f32]) ).
fof(f45,plain,
( spl6_5
<=> f(sK5) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_5])]) ).
fof(f88,plain,
( spl6_6
<=> sK2 = sK5 ),
introduced(avatar_definition,[new_symbols(naming,[spl6_6])]) ).
fof(f99,plain,
( spl6_8
<=> sK1 = sK5 ),
introduced(avatar_definition,[new_symbols(naming,[spl6_8])]) ).
fof(f116,plain,
( sP0
| ~ spl6_5
| ~ spl6_6
| ~ spl6_8 ),
inference(subsumption_resolution,[],[f57,f107]) ).
fof(f107,plain,
( sK1 = sK2
| ~ spl6_6
| ~ spl6_8 ),
inference(backward_demodulation,[],[f90,f101]) ).
fof(f101,plain,
( sK1 = sK5
| ~ spl6_8 ),
inference(avatar_component_clause,[],[f99]) ).
fof(f90,plain,
( sK2 = sK5
| ~ spl6_6 ),
inference(avatar_component_clause,[],[f88]) ).
fof(f57,plain,
( sP0
| sK1 != sK2
| ~ spl6_5 ),
inference(resolution,[],[f47,f23]) ).
fof(f23,plain,
! [X0] :
( sP0
| sK1 != sK2
| ~ f(X0) ),
inference(cnf_transformation,[],[f13]) ).
fof(f47,plain,
( f(sK5)
| ~ spl6_5 ),
inference(avatar_component_clause,[],[f45]) ).
fof(f104,plain,
( spl6_8
| spl6_2
| ~ spl6_4
| ~ spl6_5 ),
inference(avatar_split_clause,[],[f79,f45,f41,f32,f99]) ).
fof(f41,plain,
( spl6_4
<=> ! [X3] :
( sK5 = X3
| ~ f(X3) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_4])]) ).
fof(f79,plain,
( sK1 = sK5
| spl6_2
| ~ spl6_4
| ~ spl6_5 ),
inference(unit_resulting_resolution,[],[f53,f42]) ).
fof(f42,plain,
( ! [X3] :
( ~ f(X3)
| sK5 = X3 )
| ~ spl6_4 ),
inference(avatar_component_clause,[],[f41]) ).
fof(f53,plain,
( f(sK1)
| spl6_2
| ~ spl6_5 ),
inference(unit_resulting_resolution,[],[f34,f47,f22]) ).
fof(f22,plain,
! [X0] :
( f(sK1)
| sP0
| ~ f(X0) ),
inference(cnf_transformation,[],[f13]) ).
fof(f34,plain,
( ~ sP0
| spl6_2 ),
inference(avatar_component_clause,[],[f32]) ).
fof(f96,plain,
( spl6_6
| spl6_2
| ~ spl6_4
| ~ spl6_5 ),
inference(avatar_split_clause,[],[f82,f45,f41,f32,f88]) ).
fof(f82,plain,
( sK2 = sK5
| spl6_2
| ~ spl6_4
| ~ spl6_5 ),
inference(resolution,[],[f42,f52]) ).
fof(f52,plain,
( f(sK2)
| spl6_2
| ~ spl6_5 ),
inference(unit_resulting_resolution,[],[f34,f47,f21]) ).
fof(f21,plain,
! [X0] :
( f(sK2)
| sP0
| ~ f(X0) ),
inference(cnf_transformation,[],[f13]) ).
fof(f48,plain,
( spl6_2
| spl6_5 ),
inference(avatar_split_clause,[],[f24,f45,f32]) ).
fof(f24,plain,
( f(sK5)
| sP0 ),
inference(cnf_transformation,[],[f18]) ).
fof(f18,plain,
( ( ! [X0] :
( ( f(sK4(X0))
& sK4(X0) != X0 )
| ~ f(X0) )
| ~ sP0 )
& ( ( ! [X3] :
( ~ f(X3)
| sK5 = X3 )
& f(sK5) )
| sP0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5])],[f15,f17,f16]) ).
fof(f16,plain,
! [X0] :
( ? [X1] :
( f(X1)
& X0 != X1 )
=> ( f(sK4(X0))
& sK4(X0) != X0 ) ),
introduced(choice_axiom,[]) ).
fof(f17,plain,
( ? [X2] :
( ! [X3] :
( ~ f(X3)
| X2 = X3 )
& f(X2) )
=> ( ! [X3] :
( ~ f(X3)
| sK5 = X3 )
& f(sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f15,plain,
( ( ! [X0] :
( ? [X1] :
( f(X1)
& X0 != X1 )
| ~ f(X0) )
| ~ sP0 )
& ( ? [X2] :
( ! [X3] :
( ~ f(X3)
| X2 = X3 )
& f(X2) )
| sP0 ) ),
inference(rectify,[],[f14]) ).
fof(f14,plain,
( ( ! [X0] :
( ? [X1] :
( f(X1)
& X0 != X1 )
| ~ f(X0) )
| ~ sP0 )
& ( ? [X0] :
( ! [X1] :
( ~ f(X1)
| X0 = X1 )
& f(X0) )
| sP0 ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f7,plain,
( sP0
<~> ? [X0] :
( ! [X1] :
( ~ f(X1)
| X0 = X1 )
& f(X0) ) ),
inference(definition_folding,[],[f5,f6]) ).
fof(f5,plain,
( ( ? [X2] : f(X2)
& ! [X4,X3] :
( X3 = X4
| ~ f(X4)
| ~ f(X3) ) )
<~> ? [X0] :
( ! [X1] :
( ~ f(X1)
| X0 = X1 )
& f(X0) ) ),
inference(flattening,[],[f4]) ).
fof(f4,plain,
( ( ? [X2] : f(X2)
& ! [X3,X4] :
( X3 = X4
| ~ f(X4)
| ~ f(X3) ) )
<~> ? [X0] :
( ! [X1] :
( ~ f(X1)
| X0 = X1 )
& f(X0) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,plain,
~ ( ( ? [X2] : f(X2)
& ! [X3,X4] :
( ( f(X4)
& f(X3) )
=> X3 = X4 ) )
<=> ? [X0] :
( ! [X1] :
( f(X1)
=> X0 = X1 )
& f(X0) ) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ( ? [X3] :
( f(X3)
& ! [X4] :
( f(X4)
=> X3 = X4 ) )
<=> ( ? [X0] : f(X0)
& ! [X2,X1] :
( ( f(X2)
& f(X1) )
=> X1 = X2 ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
( ? [X3] :
( f(X3)
& ! [X4] :
( f(X4)
=> X3 = X4 ) )
<=> ( ? [X0] : f(X0)
& ! [X2,X1] :
( ( f(X2)
& f(X1) )
=> X1 = X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kalish317) ).
fof(f43,plain,
( spl6_4
| spl6_2 ),
inference(avatar_split_clause,[],[f25,f32,f41]) ).
fof(f25,plain,
! [X3] :
( sP0
| sK5 = X3
| ~ f(X3) ),
inference(cnf_transformation,[],[f18]) ).
fof(f39,plain,
( ~ spl6_2
| spl6_3 ),
inference(avatar_split_clause,[],[f27,f37,f32]) ).
fof(f27,plain,
! [X0] :
( ~ f(X0)
| ~ sP0
| f(sK4(X0)) ),
inference(cnf_transformation,[],[f18]) ).
fof(f35,plain,
( spl6_1
| ~ spl6_2 ),
inference(avatar_split_clause,[],[f26,f32,f29]) ).
fof(f26,plain,
! [X0] :
( ~ sP0
| ~ f(X0)
| sK4(X0) != X0 ),
inference(cnf_transformation,[],[f18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN415+1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.33 % Computer : n004.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Tue Aug 30 21:49:04 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.47 % (20886)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.19/0.47 % (20879)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 0.19/0.48 % (20886)First to succeed.
% 0.19/0.48 % (20887)dis+10_1:1_newcnf=on:sgt=8:sos=on:ss=axioms:to=lpo:urr=on:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.19/0.48 % (20879)Refutation not found, incomplete strategy% (20879)------------------------------
% 0.19/0.48 % (20879)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.48 % (20886)Refutation found. Thanks to Tanya!
% 0.19/0.48 % SZS status Theorem for theBenchmark
% 0.19/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.48 % (20886)------------------------------
% 0.19/0.48 % (20886)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.48 % (20886)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.48 % (20886)Termination reason: Refutation
% 0.19/0.48
% 0.19/0.48 % (20886)Memory used [KB]: 6012
% 0.19/0.48 % (20886)Time elapsed: 0.083 s
% 0.19/0.48 % (20886)Instructions burned: 4 (million)
% 0.19/0.48 % (20886)------------------------------
% 0.19/0.48 % (20886)------------------------------
% 0.19/0.48 % (20878)Success in time 0.139 s
%------------------------------------------------------------------------------