TSTP Solution File: SYN551+3 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SYN551+3 : TPTP v8.1.0. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -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 : Wed Aug 31 19:38:53 EDT 2022
% Result : Theorem 0.20s 0.52s
% Output : Refutation 1.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 23
% Syntax : Number of formulae : 110 ( 1 unt; 0 def)
% Number of atoms : 413 ( 224 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 563 ( 260 ~; 240 |; 31 &)
% ( 21 <=>; 10 =>; 0 <=; 1 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 20 ( 18 usr; 19 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-1 aty)
% Number of variables : 95 ( 75 !; 20 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f206,plain,
$false,
inference(avatar_sat_refutation,[],[f37,f45,f53,f61,f65,f70,f71,f76,f77,f82,f83,f87,f88,f103,f131,f186,f205]) ).
fof(f205,plain,
( ~ spl9_3
| ~ spl9_9
| ~ spl9_11
| ~ spl9_13 ),
inference(avatar_contradiction_clause,[],[f204]) ).
fof(f204,plain,
( $false
| ~ spl9_3
| ~ spl9_9
| ~ spl9_11
| ~ spl9_13 ),
inference(trivial_inequality_removal,[],[f200]) ).
fof(f200,plain,
( sK2 != sK2
| ~ spl9_3
| ~ spl9_9
| ~ spl9_11
| ~ spl9_13 ),
inference(superposition,[],[f133,f199]) ).
fof(f199,plain,
( sK0(sK2) = sK2
| ~ spl9_3
| ~ spl9_11
| ~ spl9_13 ),
inference(trivial_inequality_removal,[],[f196]) ).
fof(f196,plain,
( sK2 != sK2
| sK0(sK2) = sK2
| ~ spl9_3
| ~ spl9_11
| ~ spl9_13 ),
inference(superposition,[],[f195,f75]) ).
fof(f75,plain,
( f(g(sK2)) = sK2
| ~ spl9_11 ),
inference(avatar_component_clause,[],[f73]) ).
fof(f73,plain,
( spl9_11
<=> f(g(sK2)) = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl9_11])]) ).
fof(f195,plain,
( ! [X0] :
( f(g(X0)) != X0
| sK0(X0) = sK2 )
| ~ spl9_3
| ~ spl9_13 ),
inference(trivial_inequality_removal,[],[f190]) ).
fof(f190,plain,
( ! [X0] :
( f(g(X0)) != X0
| sK0(X0) != sK0(X0)
| sK0(X0) = sK2 )
| ~ spl9_3
| ~ spl9_13 ),
inference(superposition,[],[f40,f86]) ).
fof(f86,plain,
( ! [X0] :
( sK0(X0) = f(g(sK0(X0)))
| f(g(X0)) != X0 )
| ~ spl9_13 ),
inference(avatar_component_clause,[],[f85]) ).
fof(f85,plain,
( spl9_13
<=> ! [X0] :
( sK0(X0) = f(g(sK0(X0)))
| f(g(X0)) != X0 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_13])]) ).
fof(f40,plain,
( ! [X5] :
( f(g(X5)) != X5
| sK2 = X5 )
| ~ spl9_3 ),
inference(avatar_component_clause,[],[f39]) ).
fof(f39,plain,
( spl9_3
<=> ! [X5] :
( sK2 = X5
| f(g(X5)) != X5 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_3])]) ).
fof(f133,plain,
( sK0(sK2) != sK2
| ~ spl9_9
| ~ spl9_11 ),
inference(trivial_inequality_removal,[],[f132]) ).
fof(f132,plain,
( sK0(sK2) != sK2
| sK2 != sK2
| ~ spl9_9
| ~ spl9_11 ),
inference(superposition,[],[f64,f75]) ).
fof(f64,plain,
( ! [X0] :
( f(g(X0)) != X0
| sK0(X0) != X0 )
| ~ spl9_9 ),
inference(avatar_component_clause,[],[f63]) ).
fof(f63,plain,
( spl9_9
<=> ! [X0] :
( sK0(X0) != X0
| f(g(X0)) != X0 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_9])]) ).
fof(f186,plain,
( ~ spl9_2
| ~ spl9_3
| ~ spl9_8
| ~ spl9_11 ),
inference(avatar_contradiction_clause,[],[f185]) ).
fof(f185,plain,
( $false
| ~ spl9_2
| ~ spl9_3
| ~ spl9_8
| ~ spl9_11 ),
inference(trivial_inequality_removal,[],[f180]) ).
fof(f180,plain,
( g(sK2) != g(sK2)
| ~ spl9_2
| ~ spl9_3
| ~ spl9_8
| ~ spl9_11 ),
inference(superposition,[],[f174,f179]) ).
fof(f179,plain,
( g(sK2) = sK1(g(sK2))
| ~ spl9_2
| ~ spl9_3
| ~ spl9_11 ),
inference(trivial_inequality_removal,[],[f176]) ).
fof(f176,plain,
( g(sK2) = sK1(g(sK2))
| g(sK2) != g(sK2)
| ~ spl9_2
| ~ spl9_3
| ~ spl9_11 ),
inference(superposition,[],[f153,f75]) ).
fof(f153,plain,
( ! [X1] :
( g(f(X1)) != X1
| g(sK2) = sK1(X1) )
| ~ spl9_2
| ~ spl9_3 ),
inference(duplicate_literal_removal,[],[f150]) ).
fof(f150,plain,
( ! [X1] :
( g(sK2) = sK1(X1)
| g(f(X1)) != X1
| g(f(X1)) != X1 )
| ~ spl9_2
| ~ spl9_3 ),
inference(superposition,[],[f36,f137]) ).
fof(f137,plain,
( ! [X0] :
( f(sK1(X0)) = sK2
| g(f(X0)) != X0 )
| ~ spl9_2
| ~ spl9_3 ),
inference(trivial_inequality_removal,[],[f135]) ).
fof(f135,plain,
( ! [X0] :
( f(sK1(X0)) = sK2
| g(f(X0)) != X0
| f(sK1(X0)) != f(sK1(X0)) )
| ~ spl9_2
| ~ spl9_3 ),
inference(superposition,[],[f40,f36]) ).
fof(f36,plain,
( ! [X2] :
( sK1(X2) = g(f(sK1(X2)))
| g(f(X2)) != X2 )
| ~ spl9_2 ),
inference(avatar_component_clause,[],[f35]) ).
fof(f35,plain,
( spl9_2
<=> ! [X2] :
( sK1(X2) = g(f(sK1(X2)))
| g(f(X2)) != X2 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_2])]) ).
fof(f174,plain,
( g(sK2) != sK1(g(sK2))
| ~ spl9_8
| ~ spl9_11 ),
inference(trivial_inequality_removal,[],[f172]) ).
fof(f172,plain,
( g(sK2) != g(sK2)
| g(sK2) != sK1(g(sK2))
| ~ spl9_8
| ~ spl9_11 ),
inference(superposition,[],[f60,f75]) ).
fof(f60,plain,
( ! [X2] :
( g(f(X2)) != X2
| sK1(X2) != X2 )
| ~ spl9_8 ),
inference(avatar_component_clause,[],[f59]) ).
fof(f59,plain,
( spl9_8
<=> ! [X2] :
( g(f(X2)) != X2
| sK1(X2) != X2 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_8])]) ).
fof(f131,plain,
( ~ spl9_4
| ~ spl9_6
| ~ spl9_9
| ~ spl9_13 ),
inference(avatar_contradiction_clause,[],[f130]) ).
fof(f130,plain,
( $false
| ~ spl9_4
| ~ spl9_6
| ~ spl9_9
| ~ spl9_13 ),
inference(trivial_inequality_removal,[],[f127]) ).
fof(f127,plain,
( f(sK3) != f(sK3)
| ~ spl9_4
| ~ spl9_6
| ~ spl9_9
| ~ spl9_13 ),
inference(superposition,[],[f106,f125]) ).
fof(f125,plain,
( f(sK3) = sK0(f(sK3))
| ~ spl9_4
| ~ spl9_6
| ~ spl9_13 ),
inference(trivial_inequality_removal,[],[f124]) ).
fof(f124,plain,
( f(sK3) = sK0(f(sK3))
| f(sK3) != f(sK3)
| ~ spl9_4
| ~ spl9_6
| ~ spl9_13 ),
inference(forward_demodulation,[],[f121,f44]) ).
fof(f44,plain,
( sK3 = g(f(sK3))
| ~ spl9_4 ),
inference(avatar_component_clause,[],[f42]) ).
fof(f42,plain,
( spl9_4
<=> sK3 = g(f(sK3)) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_4])]) ).
fof(f121,plain,
( f(sK3) = sK0(f(sK3))
| f(sK3) != f(g(f(sK3)))
| ~ spl9_4
| ~ spl9_6
| ~ spl9_13 ),
inference(superposition,[],[f86,f118]) ).
fof(f118,plain,
( sK3 = g(sK0(f(sK3)))
| ~ spl9_4
| ~ spl9_6
| ~ spl9_13 ),
inference(trivial_inequality_removal,[],[f114]) ).
fof(f114,plain,
( f(sK3) != f(sK3)
| sK3 = g(sK0(f(sK3)))
| ~ spl9_4
| ~ spl9_6
| ~ spl9_13 ),
inference(superposition,[],[f112,f44]) ).
fof(f112,plain,
( ! [X2] :
( f(g(X2)) != X2
| sK3 = g(sK0(X2)) )
| ~ spl9_6
| ~ spl9_13 ),
inference(trivial_inequality_removal,[],[f110]) ).
fof(f110,plain,
( ! [X2] :
( f(g(X2)) != X2
| g(sK0(X2)) != g(sK0(X2))
| sK3 = g(sK0(X2)) )
| ~ spl9_6
| ~ spl9_13 ),
inference(superposition,[],[f52,f86]) ).
fof(f52,plain,
( ! [X7] :
( g(f(X7)) != X7
| sK3 = X7 )
| ~ spl9_6 ),
inference(avatar_component_clause,[],[f51]) ).
fof(f51,plain,
( spl9_6
<=> ! [X7] :
( g(f(X7)) != X7
| sK3 = X7 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_6])]) ).
fof(f106,plain,
( f(sK3) != sK0(f(sK3))
| ~ spl9_4
| ~ spl9_9 ),
inference(trivial_inequality_removal,[],[f104]) ).
fof(f104,plain,
( f(sK3) != sK0(f(sK3))
| f(sK3) != f(sK3)
| ~ spl9_4
| ~ spl9_9 ),
inference(superposition,[],[f64,f44]) ).
fof(f103,plain,
( ~ spl9_2
| ~ spl9_4
| ~ spl9_6
| ~ spl9_8 ),
inference(avatar_contradiction_clause,[],[f102]) ).
fof(f102,plain,
( $false
| ~ spl9_2
| ~ spl9_4
| ~ spl9_6
| ~ spl9_8 ),
inference(trivial_inequality_removal,[],[f100]) ).
fof(f100,plain,
( sK3 != sK3
| ~ spl9_2
| ~ spl9_4
| ~ spl9_6
| ~ spl9_8 ),
inference(superposition,[],[f91,f98]) ).
fof(f98,plain,
( sK1(sK3) = sK3
| ~ spl9_2
| ~ spl9_4
| ~ spl9_6 ),
inference(trivial_inequality_removal,[],[f96]) ).
fof(f96,plain,
( sK1(sK3) = sK3
| sK3 != sK3
| ~ spl9_2
| ~ spl9_4
| ~ spl9_6 ),
inference(superposition,[],[f94,f44]) ).
fof(f94,plain,
( ! [X1] :
( g(f(X1)) != X1
| sK3 = sK1(X1) )
| ~ spl9_2
| ~ spl9_6 ),
inference(trivial_inequality_removal,[],[f93]) ).
fof(f93,plain,
( ! [X1] :
( g(f(X1)) != X1
| sK1(X1) != sK1(X1)
| sK3 = sK1(X1) )
| ~ spl9_2
| ~ spl9_6 ),
inference(superposition,[],[f52,f36]) ).
fof(f91,plain,
( sK1(sK3) != sK3
| ~ spl9_4
| ~ spl9_8 ),
inference(trivial_inequality_removal,[],[f90]) ).
fof(f90,plain,
( sK1(sK3) != sK3
| sK3 != sK3
| ~ spl9_4
| ~ spl9_8 ),
inference(superposition,[],[f60,f44]) ).
fof(f88,plain,
( spl9_13
| ~ spl9_12 ),
inference(avatar_split_clause,[],[f23,f79,f85]) ).
fof(f79,plain,
( spl9_12
<=> sP5 ),
introduced(avatar_definition,[new_symbols(naming,[spl9_12])]) ).
fof(f23,plain,
! [X0] :
( ~ sP5
| f(g(X0)) != X0
| sK0(X0) = f(g(sK0(X0))) ),
inference(general_splitting,[],[f18,f22_D]) ).
fof(f22,plain,
! [X2] :
( sP5
| sK1(X2) = g(f(sK1(X2)))
| g(f(X2)) != X2 ),
inference(cnf_transformation,[],[f22_D]) ).
fof(f22_D,plain,
( ! [X2] :
( sK1(X2) = g(f(sK1(X2)))
| g(f(X2)) != X2 )
<=> ~ sP5 ),
introduced(general_splitting_component_introduction,[new_symbols(naming,[sP5])]) ).
fof(f18,plain,
! [X2,X0] :
( sK0(X0) = f(g(sK0(X0)))
| f(g(X0)) != X0
| g(f(X2)) != X2
| sK1(X2) = g(f(sK1(X2))) ),
inference(cnf_transformation,[],[f11]) ).
fof(f11,plain,
( ( ! [X0] :
( ( sK0(X0) = f(g(sK0(X0)))
& sK0(X0) != X0 )
| f(g(X0)) != X0 )
| ! [X2] :
( g(f(X2)) != X2
| ( sK1(X2) != X2
& sK1(X2) = g(f(sK1(X2))) ) ) )
& ( ( ! [X5] :
( f(g(X5)) != X5
| sK2 = X5 )
& f(g(sK2)) = sK2 )
| ( sK3 = g(f(sK3))
& ! [X7] :
( sK3 = X7
| g(f(X7)) != X7 ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f6,f10,f9,f8,f7]) ).
fof(f7,plain,
! [X0] :
( ? [X1] :
( f(g(X1)) = X1
& X0 != X1 )
=> ( sK0(X0) = f(g(sK0(X0)))
& sK0(X0) != X0 ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
! [X2] :
( ? [X3] :
( X2 != X3
& g(f(X3)) = X3 )
=> ( sK1(X2) != X2
& sK1(X2) = g(f(sK1(X2))) ) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
( ? [X4] :
( ! [X5] :
( f(g(X5)) != X5
| X4 = X5 )
& f(g(X4)) = X4 )
=> ( ! [X5] :
( f(g(X5)) != X5
| sK2 = X5 )
& f(g(sK2)) = sK2 ) ),
introduced(choice_axiom,[]) ).
fof(f10,plain,
( ? [X6] :
( g(f(X6)) = X6
& ! [X7] :
( X6 = X7
| g(f(X7)) != X7 ) )
=> ( sK3 = g(f(sK3))
& ! [X7] :
( sK3 = X7
| g(f(X7)) != X7 ) ) ),
introduced(choice_axiom,[]) ).
fof(f6,plain,
( ( ! [X0] :
( ? [X1] :
( f(g(X1)) = X1
& X0 != X1 )
| f(g(X0)) != X0 )
| ! [X2] :
( g(f(X2)) != X2
| ? [X3] :
( X2 != X3
& g(f(X3)) = X3 ) ) )
& ( ? [X4] :
( ! [X5] :
( f(g(X5)) != X5
| X4 = X5 )
& f(g(X4)) = X4 )
| ? [X6] :
( g(f(X6)) = X6
& ! [X7] :
( X6 = X7
| g(f(X7)) != X7 ) ) ) ),
inference(rectify,[],[f5]) ).
fof(f5,plain,
( ( ! [X2] :
( ? [X3] :
( f(g(X3)) = X3
& X2 != X3 )
| f(g(X2)) != X2 )
| ! [X0] :
( g(f(X0)) != X0
| ? [X1] :
( X0 != X1
& g(f(X1)) = X1 ) ) )
& ( ? [X2] :
( ! [X3] :
( f(g(X3)) != X3
| X2 = X3 )
& f(g(X2)) = X2 )
| ? [X0] :
( g(f(X0)) = X0
& ! [X1] :
( X0 = X1
| g(f(X1)) != X1 ) ) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f4,plain,
( ? [X0] :
( g(f(X0)) = X0
& ! [X1] :
( X0 = X1
| g(f(X1)) != X1 ) )
<~> ? [X2] :
( ! [X3] :
( f(g(X3)) != X3
| X2 = X3 )
& f(g(X2)) = X2 ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,plain,
~ ( ? [X0] :
( ! [X1] :
( g(f(X1)) = X1
=> X0 = X1 )
& g(f(X0)) = X0 )
<=> ? [X2] :
( ! [X3] :
( f(g(X3)) = X3
=> X2 = X3 )
& f(g(X2)) = X2 ) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ( ? [X0] :
( ! [X1] :
( g(f(X1)) = X1
=> X0 = X1 )
& g(f(X0)) = X0 )
<=> ? [X0] :
( f(g(X0)) = X0
& ! [X1] :
( f(g(X1)) = X1
=> X0 = X1 ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
( ? [X0] :
( ! [X1] :
( g(f(X1)) = X1
=> X0 = X1 )
& g(f(X0)) = X0 )
<=> ? [X0] :
( f(g(X0)) = X0
& ! [X1] :
( f(g(X1)) = X1
=> X0 = X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_cute_thing) ).
fof(f87,plain,
( spl9_13
| ~ spl9_10 ),
inference(avatar_split_clause,[],[f21,f67,f85]) ).
fof(f67,plain,
( spl9_10
<=> sP4 ),
introduced(avatar_definition,[new_symbols(naming,[spl9_10])]) ).
fof(f21,plain,
! [X0] :
( ~ sP4
| sK0(X0) = f(g(sK0(X0)))
| f(g(X0)) != X0 ),
inference(general_splitting,[],[f19,f20_D]) ).
fof(f20,plain,
! [X2] :
( g(f(X2)) != X2
| sP4
| sK1(X2) != X2 ),
inference(cnf_transformation,[],[f20_D]) ).
fof(f20_D,plain,
( ! [X2] :
( g(f(X2)) != X2
| sK1(X2) != X2 )
<=> ~ sP4 ),
introduced(general_splitting_component_introduction,[new_symbols(naming,[sP4])]) ).
fof(f19,plain,
! [X2,X0] :
( sK0(X0) = f(g(sK0(X0)))
| f(g(X0)) != X0
| g(f(X2)) != X2
| sK1(X2) != X2 ),
inference(cnf_transformation,[],[f11]) ).
fof(f83,plain,
( spl9_9
| ~ spl9_7 ),
inference(avatar_split_clause,[],[f25,f55,f63]) ).
fof(f55,plain,
( spl9_7
<=> sP6 ),
introduced(avatar_definition,[new_symbols(naming,[spl9_7])]) ).
fof(f25,plain,
! [X0] :
( ~ sP6
| f(g(X0)) != X0
| sK0(X0) != X0 ),
inference(general_splitting,[],[f17,f24_D]) ).
fof(f24,plain,
! [X2] :
( g(f(X2)) != X2
| sP6
| sK1(X2) != X2 ),
inference(cnf_transformation,[],[f24_D]) ).
fof(f24_D,plain,
( ! [X2] :
( g(f(X2)) != X2
| sK1(X2) != X2 )
<=> ~ sP6 ),
introduced(general_splitting_component_introduction,[new_symbols(naming,[sP6])]) ).
fof(f17,plain,
! [X2,X0] :
( sK0(X0) != X0
| f(g(X0)) != X0
| g(f(X2)) != X2
| sK1(X2) != X2 ),
inference(cnf_transformation,[],[f11]) ).
fof(f82,plain,
( spl9_2
| spl9_12 ),
inference(avatar_split_clause,[],[f22,f79,f35]) ).
fof(f77,plain,
( spl9_11
| spl9_6 ),
inference(avatar_split_clause,[],[f12,f51,f73]) ).
fof(f12,plain,
! [X7] :
( g(f(X7)) != X7
| sK3 = X7
| f(g(sK2)) = sK2 ),
inference(cnf_transformation,[],[f11]) ).
fof(f76,plain,
( spl9_11
| spl9_4 ),
inference(avatar_split_clause,[],[f13,f42,f73]) ).
fof(f13,plain,
( sK3 = g(f(sK3))
| f(g(sK2)) = sK2 ),
inference(cnf_transformation,[],[f11]) ).
fof(f71,plain,
( ~ spl9_5
| spl9_3 ),
inference(avatar_split_clause,[],[f29,f39,f47]) ).
fof(f47,plain,
( spl9_5
<=> sP8 ),
introduced(avatar_definition,[new_symbols(naming,[spl9_5])]) ).
fof(f29,plain,
! [X5] :
( f(g(X5)) != X5
| sK2 = X5
| ~ sP8 ),
inference(general_splitting,[],[f14,f28_D]) ).
fof(f28,plain,
! [X7] :
( g(f(X7)) != X7
| sP8
| sK3 = X7 ),
inference(cnf_transformation,[],[f28_D]) ).
fof(f28_D,plain,
( ! [X7] :
( g(f(X7)) != X7
| sK3 = X7 )
<=> ~ sP8 ),
introduced(general_splitting_component_introduction,[new_symbols(naming,[sP8])]) ).
fof(f14,plain,
! [X7,X5] :
( f(g(X5)) != X5
| sK2 = X5
| sK3 = X7
| g(f(X7)) != X7 ),
inference(cnf_transformation,[],[f11]) ).
fof(f70,plain,
( spl9_10
| spl9_8 ),
inference(avatar_split_clause,[],[f20,f59,f67]) ).
fof(f65,plain,
( ~ spl9_1
| spl9_9 ),
inference(avatar_split_clause,[],[f27,f63,f31]) ).
fof(f31,plain,
( spl9_1
<=> sP7 ),
introduced(avatar_definition,[new_symbols(naming,[spl9_1])]) ).
fof(f27,plain,
! [X0] :
( sK0(X0) != X0
| ~ sP7
| f(g(X0)) != X0 ),
inference(general_splitting,[],[f16,f26_D]) ).
fof(f26,plain,
! [X2] :
( sK1(X2) = g(f(sK1(X2)))
| sP7
| g(f(X2)) != X2 ),
inference(cnf_transformation,[],[f26_D]) ).
fof(f26_D,plain,
( ! [X2] :
( sK1(X2) = g(f(sK1(X2)))
| g(f(X2)) != X2 )
<=> ~ sP7 ),
introduced(general_splitting_component_introduction,[new_symbols(naming,[sP7])]) ).
fof(f16,plain,
! [X2,X0] :
( sK0(X0) != X0
| f(g(X0)) != X0
| g(f(X2)) != X2
| sK1(X2) = g(f(sK1(X2))) ),
inference(cnf_transformation,[],[f11]) ).
fof(f61,plain,
( spl9_7
| spl9_8 ),
inference(avatar_split_clause,[],[f24,f59,f55]) ).
fof(f53,plain,
( spl9_5
| spl9_6 ),
inference(avatar_split_clause,[],[f28,f51,f47]) ).
fof(f45,plain,
( spl9_3
| spl9_4 ),
inference(avatar_split_clause,[],[f15,f42,f39]) ).
fof(f15,plain,
! [X5] :
( sK3 = g(f(sK3))
| sK2 = X5
| f(g(X5)) != X5 ),
inference(cnf_transformation,[],[f11]) ).
fof(f37,plain,
( spl9_1
| spl9_2 ),
inference(avatar_split_clause,[],[f26,f35,f31]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SYN551+3 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.07/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.35 % Computer : n001.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 30 22:28:47 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.50 % (11118)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/50Mi)
% 0.20/0.50 % (11109)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/50Mi)
% 0.20/0.50 % (11118)First to succeed.
% 0.20/0.51 % (11116)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.20/0.51 % (11116)Instruction limit reached!
% 0.20/0.51 % (11116)------------------------------
% 0.20/0.51 % (11116)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51 % (11116)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51 % (11116)Termination reason: Unknown
% 0.20/0.51 % (11116)Termination phase: Saturation
% 0.20/0.51
% 0.20/0.51 % (11116)Memory used [KB]: 5373
% 0.20/0.51 % (11116)Time elapsed: 0.095 s
% 0.20/0.51 % (11116)Instructions burned: 2 (million)
% 0.20/0.51 % (11116)------------------------------
% 0.20/0.51 % (11116)------------------------------
% 0.20/0.51 % (11126)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/100Mi)
% 0.20/0.51 % (11120)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/101Mi)
% 0.20/0.51 % (11134)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/68Mi)
% 0.20/0.51 % (11130)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/498Mi)
% 0.20/0.51 % (11109)Also succeeded, but the first one will report.
% 0.20/0.52 % (11118)Refutation found. Thanks to Tanya!
% 0.20/0.52 % SZS status Theorem for theBenchmark
% 0.20/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 1.27/0.52 % (11118)------------------------------
% 1.27/0.52 % (11118)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.27/0.52 % (11118)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.27/0.52 % (11118)Termination reason: Refutation
% 1.27/0.52
% 1.27/0.52 % (11118)Memory used [KB]: 5500
% 1.27/0.52 % (11118)Time elapsed: 0.101 s
% 1.27/0.52 % (11118)Instructions burned: 6 (million)
% 1.27/0.52 % (11118)------------------------------
% 1.27/0.52 % (11118)------------------------------
% 1.27/0.52 % (11107)Success in time 0.16 s
%------------------------------------------------------------------------------