TSTP Solution File: SET801+4 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SET801+4 : TPTP v8.1.0. Released v3.2.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 : n018.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 18:22:18 EDT 2022
% Result : Theorem 0.19s 0.53s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 18
% Syntax : Number of formulae : 89 ( 1 unt; 0 def)
% Number of atoms : 382 ( 0 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 446 ( 153 ~; 158 |; 95 &)
% ( 21 <=>; 18 =>; 0 <=; 1 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 16 ( 15 usr; 9 prp; 0-4 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-4 aty)
% Number of variables : 183 ( 150 !; 33 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f315,plain,
$false,
inference(avatar_sat_refutation,[],[f159,f162,f164,f183,f190,f254,f268,f272,f309,f313,f314]) ).
fof(f314,plain,
( spl10_2
| ~ spl10_1 ),
inference(avatar_split_clause,[],[f257,f151,f154]) ).
fof(f154,plain,
( spl10_2
<=> member(sK8,sK7) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_2])]) ).
fof(f151,plain,
( spl10_1
<=> greatest(sK8,sK5,sK7) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_1])]) ).
fof(f257,plain,
( member(sK8,sK7)
| ~ spl10_1 ),
inference(resolution,[],[f161,f103]) ).
fof(f103,plain,
! [X2,X0,X1] :
( ~ greatest(X2,X0,X1)
| member(X2,X1) ),
inference(cnf_transformation,[],[f57]) ).
fof(f57,plain,
! [X0,X1,X2] :
( ( ( member(X2,X1)
& ! [X3] :
( ~ member(X3,X1)
| apply(X0,X3,X2) ) )
| ~ greatest(X2,X0,X1) )
& ( greatest(X2,X0,X1)
| ~ member(X2,X1)
| ( member(sK0(X0,X1,X2),X1)
& ~ apply(X0,sK0(X0,X1,X2),X2) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f55,f56]) ).
fof(f56,plain,
! [X0,X1,X2] :
( ? [X4] :
( member(X4,X1)
& ~ apply(X0,X4,X2) )
=> ( member(sK0(X0,X1,X2),X1)
& ~ apply(X0,sK0(X0,X1,X2),X2) ) ),
introduced(choice_axiom,[]) ).
fof(f55,plain,
! [X0,X1,X2] :
( ( ( member(X2,X1)
& ! [X3] :
( ~ member(X3,X1)
| apply(X0,X3,X2) ) )
| ~ greatest(X2,X0,X1) )
& ( greatest(X2,X0,X1)
| ~ member(X2,X1)
| ? [X4] :
( member(X4,X1)
& ~ apply(X0,X4,X2) ) ) ),
inference(rectify,[],[f54]) ).
fof(f54,plain,
! [X2,X1,X0] :
( ( ( member(X0,X1)
& ! [X3] :
( ~ member(X3,X1)
| apply(X2,X3,X0) ) )
| ~ greatest(X0,X2,X1) )
& ( greatest(X0,X2,X1)
| ~ member(X0,X1)
| ? [X3] :
( member(X3,X1)
& ~ apply(X2,X3,X0) ) ) ),
inference(flattening,[],[f53]) ).
fof(f53,plain,
! [X2,X1,X0] :
( ( ( member(X0,X1)
& ! [X3] :
( ~ member(X3,X1)
| apply(X2,X3,X0) ) )
| ~ greatest(X0,X2,X1) )
& ( greatest(X0,X2,X1)
| ~ member(X0,X1)
| ? [X3] :
( member(X3,X1)
& ~ apply(X2,X3,X0) ) ) ),
inference(nnf_transformation,[],[f49]) ).
fof(f49,plain,
! [X2,X1,X0] :
( ( member(X0,X1)
& ! [X3] :
( ~ member(X3,X1)
| apply(X2,X3,X0) ) )
<=> greatest(X0,X2,X1) ),
inference(ennf_transformation,[],[f42]) ).
fof(f42,plain,
! [X0,X1,X2] :
( ( member(X0,X1)
& ! [X3] :
( member(X3,X1)
=> apply(X2,X3,X0) ) )
<=> greatest(X0,X2,X1) ),
inference(rectify,[],[f16]) ).
fof(f16,axiom,
! [X7,X3,X5] :
( ( ! [X2] :
( member(X2,X3)
=> apply(X5,X2,X7) )
& member(X7,X3) )
<=> greatest(X7,X5,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',greatest) ).
fof(f161,plain,
( greatest(sK8,sK5,sK7)
| ~ spl10_1 ),
inference(avatar_component_clause,[],[f151]) ).
fof(f313,plain,
( ~ spl10_2
| spl10_10
| ~ spl10_11 ),
inference(avatar_contradiction_clause,[],[f311]) ).
fof(f311,plain,
( $false
| ~ spl10_2
| spl10_10
| ~ spl10_11 ),
inference(unit_resulting_resolution,[],[f160,f267,f271,f123]) ).
fof(f123,plain,
! [X2,X3,X0,X1] :
( ~ upper_bound(X2,X0,X1)
| apply(X0,X3,X2)
| ~ member(X3,X1) ),
inference(cnf_transformation,[],[f81]) ).
fof(f81,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( ~ member(X3,X1)
| apply(X0,X3,X2) )
| ~ upper_bound(X2,X0,X1) )
& ( upper_bound(X2,X0,X1)
| ( member(sK4(X0,X1,X2),X1)
& ~ apply(X0,sK4(X0,X1,X2),X2) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f79,f80]) ).
fof(f80,plain,
! [X0,X1,X2] :
( ? [X4] :
( member(X4,X1)
& ~ apply(X0,X4,X2) )
=> ( member(sK4(X0,X1,X2),X1)
& ~ apply(X0,sK4(X0,X1,X2),X2) ) ),
introduced(choice_axiom,[]) ).
fof(f79,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( ~ member(X3,X1)
| apply(X0,X3,X2) )
| ~ upper_bound(X2,X0,X1) )
& ( upper_bound(X2,X0,X1)
| ? [X4] :
( member(X4,X1)
& ~ apply(X0,X4,X2) ) ) ),
inference(rectify,[],[f78]) ).
fof(f78,plain,
! [X1,X2,X0] :
( ( ! [X3] :
( ~ member(X3,X2)
| apply(X1,X3,X0) )
| ~ upper_bound(X0,X1,X2) )
& ( upper_bound(X0,X1,X2)
| ? [X3] :
( member(X3,X2)
& ~ apply(X1,X3,X0) ) ) ),
inference(nnf_transformation,[],[f48]) ).
fof(f48,plain,
! [X1,X2,X0] :
( ! [X3] :
( ~ member(X3,X2)
| apply(X1,X3,X0) )
<=> upper_bound(X0,X1,X2) ),
inference(ennf_transformation,[],[f26]) ).
fof(f26,plain,
! [X1,X0,X2] :
( ! [X3] :
( member(X3,X2)
=> apply(X1,X3,X0) )
<=> upper_bound(X0,X1,X2) ),
inference(rectify,[],[f14]) ).
fof(f14,axiom,
! [X7,X5,X3] :
( ! [X2] :
( member(X2,X3)
=> apply(X5,X2,X7) )
<=> upper_bound(X7,X5,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',upper_bound) ).
fof(f271,plain,
( upper_bound(sK9(sK8,sK7,sK6,sK5),sK5,sK7)
| ~ spl10_11 ),
inference(avatar_component_clause,[],[f270]) ).
fof(f270,plain,
( spl10_11
<=> upper_bound(sK9(sK8,sK7,sK6,sK5),sK5,sK7) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_11])]) ).
fof(f267,plain,
( ~ apply(sK5,sK8,sK9(sK8,sK7,sK6,sK5))
| spl10_10 ),
inference(avatar_component_clause,[],[f266]) ).
fof(f266,plain,
( spl10_10
<=> apply(sK5,sK8,sK9(sK8,sK7,sK6,sK5)) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_10])]) ).
fof(f160,plain,
( member(sK8,sK7)
| ~ spl10_2 ),
inference(avatar_component_clause,[],[f154]) ).
fof(f309,plain,
( ~ spl10_1
| spl10_9 ),
inference(avatar_contradiction_clause,[],[f305]) ).
fof(f305,plain,
( $false
| ~ spl10_1
| spl10_9 ),
inference(unit_resulting_resolution,[],[f278,f277,f256]) ).
fof(f256,plain,
( ! [X0] :
( apply(sK5,X0,sK8)
| ~ member(X0,sK7) )
| ~ spl10_1 ),
inference(resolution,[],[f161,f102]) ).
fof(f102,plain,
! [X2,X3,X0,X1] :
( ~ greatest(X2,X0,X1)
| apply(X0,X3,X2)
| ~ member(X3,X1) ),
inference(cnf_transformation,[],[f57]) ).
fof(f277,plain,
( ~ apply(sK5,sK4(sK5,sK7,sK8),sK8)
| spl10_9 ),
inference(resolution,[],[f264,f121]) ).
fof(f121,plain,
! [X2,X0,X1] :
( upper_bound(X2,X0,X1)
| ~ apply(X0,sK4(X0,X1,X2),X2) ),
inference(cnf_transformation,[],[f81]) ).
fof(f264,plain,
( ~ upper_bound(sK8,sK5,sK7)
| spl10_9 ),
inference(avatar_component_clause,[],[f263]) ).
fof(f263,plain,
( spl10_9
<=> upper_bound(sK8,sK5,sK7) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_9])]) ).
fof(f278,plain,
( member(sK4(sK5,sK7,sK8),sK7)
| spl10_9 ),
inference(resolution,[],[f264,f122]) ).
fof(f122,plain,
! [X2,X0,X1] :
( upper_bound(X2,X0,X1)
| member(sK4(X0,X1,X2),X1) ),
inference(cnf_transformation,[],[f81]) ).
fof(f272,plain,
( ~ spl10_2
| spl10_11
| ~ spl10_9
| spl10_3 ),
inference(avatar_split_clause,[],[f260,f157,f263,f270,f154]) ).
fof(f157,plain,
( spl10_3
<=> least_upper_bound(sK8,sK7,sK5,sK6) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_3])]) ).
fof(f260,plain,
( ~ upper_bound(sK8,sK5,sK7)
| upper_bound(sK9(sK8,sK7,sK6,sK5),sK5,sK7)
| ~ member(sK8,sK7)
| spl10_3 ),
inference(resolution,[],[f158,f141]) ).
fof(f141,plain,
! [X2,X3,X0,X1] :
( least_upper_bound(X0,X1,X3,X2)
| upper_bound(sK9(X0,X1,X2,X3),X3,X1)
| ~ member(X0,X1)
| ~ upper_bound(X0,X3,X1) ),
inference(cnf_transformation,[],[f98]) ).
fof(f98,plain,
! [X0,X1,X2,X3] :
( ( least_upper_bound(X0,X1,X3,X2)
| ~ member(X0,X1)
| ( ~ apply(X3,X0,sK9(X0,X1,X2,X3))
& member(sK9(X0,X1,X2,X3),X2)
& upper_bound(sK9(X0,X1,X2,X3),X3,X1) )
| ~ upper_bound(X0,X3,X1) )
& ( ( member(X0,X1)
& ! [X5] :
( apply(X3,X0,X5)
| ~ member(X5,X2)
| ~ upper_bound(X5,X3,X1) )
& upper_bound(X0,X3,X1) )
| ~ least_upper_bound(X0,X1,X3,X2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK9])],[f96,f97]) ).
fof(f97,plain,
! [X0,X1,X2,X3] :
( ? [X4] :
( ~ apply(X3,X0,X4)
& member(X4,X2)
& upper_bound(X4,X3,X1) )
=> ( ~ apply(X3,X0,sK9(X0,X1,X2,X3))
& member(sK9(X0,X1,X2,X3),X2)
& upper_bound(sK9(X0,X1,X2,X3),X3,X1) ) ),
introduced(choice_axiom,[]) ).
fof(f96,plain,
! [X0,X1,X2,X3] :
( ( least_upper_bound(X0,X1,X3,X2)
| ~ member(X0,X1)
| ? [X4] :
( ~ apply(X3,X0,X4)
& member(X4,X2)
& upper_bound(X4,X3,X1) )
| ~ upper_bound(X0,X3,X1) )
& ( ( member(X0,X1)
& ! [X5] :
( apply(X3,X0,X5)
| ~ member(X5,X2)
| ~ upper_bound(X5,X3,X1) )
& upper_bound(X0,X3,X1) )
| ~ least_upper_bound(X0,X1,X3,X2) ) ),
inference(rectify,[],[f95]) ).
fof(f95,plain,
! [X3,X0,X1,X2] :
( ( least_upper_bound(X3,X0,X2,X1)
| ~ member(X3,X0)
| ? [X4] :
( ~ apply(X2,X3,X4)
& member(X4,X1)
& upper_bound(X4,X2,X0) )
| ~ upper_bound(X3,X2,X0) )
& ( ( member(X3,X0)
& ! [X4] :
( apply(X2,X3,X4)
| ~ member(X4,X1)
| ~ upper_bound(X4,X2,X0) )
& upper_bound(X3,X2,X0) )
| ~ least_upper_bound(X3,X0,X2,X1) ) ),
inference(flattening,[],[f94]) ).
fof(f94,plain,
! [X3,X0,X1,X2] :
( ( least_upper_bound(X3,X0,X2,X1)
| ~ member(X3,X0)
| ? [X4] :
( ~ apply(X2,X3,X4)
& member(X4,X1)
& upper_bound(X4,X2,X0) )
| ~ upper_bound(X3,X2,X0) )
& ( ( member(X3,X0)
& ! [X4] :
( apply(X2,X3,X4)
| ~ member(X4,X1)
| ~ upper_bound(X4,X2,X0) )
& upper_bound(X3,X2,X0) )
| ~ least_upper_bound(X3,X0,X2,X1) ) ),
inference(nnf_transformation,[],[f51]) ).
fof(f51,plain,
! [X3,X0,X1,X2] :
( least_upper_bound(X3,X0,X2,X1)
<=> ( member(X3,X0)
& ! [X4] :
( apply(X2,X3,X4)
| ~ member(X4,X1)
| ~ upper_bound(X4,X2,X0) )
& upper_bound(X3,X2,X0) ) ),
inference(flattening,[],[f50]) ).
fof(f50,plain,
! [X2,X3,X0,X1] :
( ( member(X3,X0)
& upper_bound(X3,X2,X0)
& ! [X4] :
( apply(X2,X3,X4)
| ~ upper_bound(X4,X2,X0)
| ~ member(X4,X1) ) )
<=> least_upper_bound(X3,X0,X2,X1) ),
inference(ennf_transformation,[],[f37]) ).
fof(f37,plain,
! [X2,X3,X0,X1] :
( ( member(X3,X0)
& upper_bound(X3,X2,X0)
& ! [X4] :
( ( upper_bound(X4,X2,X0)
& member(X4,X1) )
=> apply(X2,X3,X4) ) )
<=> least_upper_bound(X3,X0,X2,X1) ),
inference(rectify,[],[f20]) ).
fof(f20,axiom,
! [X2,X3,X5,X0] :
( least_upper_bound(X0,X2,X5,X3)
<=> ( member(X0,X2)
& upper_bound(X0,X5,X2)
& ! [X7] :
( ( member(X7,X3)
& upper_bound(X7,X5,X2) )
=> apply(X5,X0,X7) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',least_upper_bound) ).
fof(f158,plain,
( ~ least_upper_bound(sK8,sK7,sK5,sK6)
| spl10_3 ),
inference(avatar_component_clause,[],[f157]) ).
fof(f268,plain,
( ~ spl10_9
| ~ spl10_10
| ~ spl10_2
| spl10_3 ),
inference(avatar_split_clause,[],[f259,f157,f154,f266,f263]) ).
fof(f259,plain,
( ~ member(sK8,sK7)
| ~ apply(sK5,sK8,sK9(sK8,sK7,sK6,sK5))
| ~ upper_bound(sK8,sK5,sK7)
| spl10_3 ),
inference(resolution,[],[f158,f143]) ).
fof(f143,plain,
! [X2,X3,X0,X1] :
( least_upper_bound(X0,X1,X3,X2)
| ~ apply(X3,X0,sK9(X0,X1,X2,X3))
| ~ member(X0,X1)
| ~ upper_bound(X0,X3,X1) ),
inference(cnf_transformation,[],[f98]) ).
fof(f254,plain,
( ~ spl10_3
| ~ spl10_4
| spl10_5 ),
inference(avatar_contradiction_clause,[],[f250]) ).
fof(f250,plain,
( $false
| ~ spl10_3
| ~ spl10_4
| spl10_5 ),
inference(unit_resulting_resolution,[],[f182,f189,f175,f123]) ).
fof(f175,plain,
( upper_bound(sK8,sK5,sK7)
| ~ spl10_3 ),
inference(resolution,[],[f138,f163]) ).
fof(f163,plain,
( least_upper_bound(sK8,sK7,sK5,sK6)
| ~ spl10_3 ),
inference(avatar_component_clause,[],[f157]) ).
fof(f138,plain,
! [X2,X3,X0,X1] :
( ~ least_upper_bound(X0,X1,X3,X2)
| upper_bound(X0,X3,X1) ),
inference(cnf_transformation,[],[f98]) ).
fof(f189,plain,
( ~ apply(sK5,sK0(sK5,sK7,sK8),sK8)
| spl10_5 ),
inference(avatar_component_clause,[],[f188]) ).
fof(f188,plain,
( spl10_5
<=> apply(sK5,sK0(sK5,sK7,sK8),sK8) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_5])]) ).
fof(f182,plain,
( member(sK0(sK5,sK7,sK8),sK7)
| ~ spl10_4 ),
inference(avatar_component_clause,[],[f181]) ).
fof(f181,plain,
( spl10_4
<=> member(sK0(sK5,sK7,sK8),sK7) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_4])]) ).
fof(f190,plain,
( ~ spl10_5
| ~ spl10_2
| spl10_1 ),
inference(avatar_split_clause,[],[f184,f151,f154,f188]) ).
fof(f184,plain,
( ~ member(sK8,sK7)
| ~ apply(sK5,sK0(sK5,sK7,sK8),sK8)
| spl10_1 ),
inference(resolution,[],[f100,f152]) ).
fof(f152,plain,
( ~ greatest(sK8,sK5,sK7)
| spl10_1 ),
inference(avatar_component_clause,[],[f151]) ).
fof(f100,plain,
! [X2,X0,X1] :
( greatest(X2,X0,X1)
| ~ apply(X0,sK0(X0,X1,X2),X2)
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f57]) ).
fof(f183,plain,
( spl10_4
| ~ spl10_2
| spl10_1 ),
inference(avatar_split_clause,[],[f177,f151,f154,f181]) ).
fof(f177,plain,
( ~ member(sK8,sK7)
| member(sK0(sK5,sK7,sK8),sK7)
| spl10_1 ),
inference(resolution,[],[f101,f152]) ).
fof(f101,plain,
! [X2,X0,X1] :
( greatest(X2,X0,X1)
| ~ member(X2,X1)
| member(sK0(X0,X1,X2),X1) ),
inference(cnf_transformation,[],[f57]) ).
fof(f164,plain,
( spl10_1
| spl10_3 ),
inference(avatar_split_clause,[],[f128,f157,f151]) ).
fof(f128,plain,
( least_upper_bound(sK8,sK7,sK5,sK6)
| greatest(sK8,sK5,sK7) ),
inference(cnf_transformation,[],[f90]) ).
fof(f90,plain,
( subset(sK7,sK6)
& ( ~ greatest(sK8,sK5,sK7)
| ~ member(sK8,sK7)
| ~ least_upper_bound(sK8,sK7,sK5,sK6) )
& ( greatest(sK8,sK5,sK7)
| ( member(sK8,sK7)
& least_upper_bound(sK8,sK7,sK5,sK6) ) )
& order(sK5,sK6) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6,sK7,sK8])],[f86,f89,f88,f87]) ).
fof(f87,plain,
( ? [X0,X1] :
( ? [X2] :
( subset(X2,X1)
& ? [X3] :
( ( ~ greatest(X3,X0,X2)
| ~ member(X3,X2)
| ~ least_upper_bound(X3,X2,X0,X1) )
& ( greatest(X3,X0,X2)
| ( member(X3,X2)
& least_upper_bound(X3,X2,X0,X1) ) ) ) )
& order(X0,X1) )
=> ( ? [X2] :
( subset(X2,sK6)
& ? [X3] :
( ( ~ greatest(X3,sK5,X2)
| ~ member(X3,X2)
| ~ least_upper_bound(X3,X2,sK5,sK6) )
& ( greatest(X3,sK5,X2)
| ( member(X3,X2)
& least_upper_bound(X3,X2,sK5,sK6) ) ) ) )
& order(sK5,sK6) ) ),
introduced(choice_axiom,[]) ).
fof(f88,plain,
( ? [X2] :
( subset(X2,sK6)
& ? [X3] :
( ( ~ greatest(X3,sK5,X2)
| ~ member(X3,X2)
| ~ least_upper_bound(X3,X2,sK5,sK6) )
& ( greatest(X3,sK5,X2)
| ( member(X3,X2)
& least_upper_bound(X3,X2,sK5,sK6) ) ) ) )
=> ( subset(sK7,sK6)
& ? [X3] :
( ( ~ greatest(X3,sK5,sK7)
| ~ member(X3,sK7)
| ~ least_upper_bound(X3,sK7,sK5,sK6) )
& ( greatest(X3,sK5,sK7)
| ( member(X3,sK7)
& least_upper_bound(X3,sK7,sK5,sK6) ) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f89,plain,
( ? [X3] :
( ( ~ greatest(X3,sK5,sK7)
| ~ member(X3,sK7)
| ~ least_upper_bound(X3,sK7,sK5,sK6) )
& ( greatest(X3,sK5,sK7)
| ( member(X3,sK7)
& least_upper_bound(X3,sK7,sK5,sK6) ) ) )
=> ( ( ~ greatest(sK8,sK5,sK7)
| ~ member(sK8,sK7)
| ~ least_upper_bound(sK8,sK7,sK5,sK6) )
& ( greatest(sK8,sK5,sK7)
| ( member(sK8,sK7)
& least_upper_bound(sK8,sK7,sK5,sK6) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f86,plain,
? [X0,X1] :
( ? [X2] :
( subset(X2,X1)
& ? [X3] :
( ( ~ greatest(X3,X0,X2)
| ~ member(X3,X2)
| ~ least_upper_bound(X3,X2,X0,X1) )
& ( greatest(X3,X0,X2)
| ( member(X3,X2)
& least_upper_bound(X3,X2,X0,X1) ) ) ) )
& order(X0,X1) ),
inference(flattening,[],[f85]) ).
fof(f85,plain,
? [X0,X1] :
( ? [X2] :
( subset(X2,X1)
& ? [X3] :
( ( ~ greatest(X3,X0,X2)
| ~ member(X3,X2)
| ~ least_upper_bound(X3,X2,X0,X1) )
& ( greatest(X3,X0,X2)
| ( member(X3,X2)
& least_upper_bound(X3,X2,X0,X1) ) ) ) )
& order(X0,X1) ),
inference(nnf_transformation,[],[f52]) ).
fof(f52,plain,
? [X0,X1] :
( ? [X2] :
( subset(X2,X1)
& ? [X3] :
( ( member(X3,X2)
& least_upper_bound(X3,X2,X0,X1) )
<~> greatest(X3,X0,X2) ) )
& order(X0,X1) ),
inference(ennf_transformation,[],[f36]) ).
fof(f36,plain,
~ ! [X0,X1] :
( order(X0,X1)
=> ! [X2] :
( subset(X2,X1)
=> ! [X3] :
( greatest(X3,X0,X2)
<=> ( member(X3,X2)
& least_upper_bound(X3,X2,X0,X1) ) ) ) ),
inference(rectify,[],[f23]) ).
fof(f23,negated_conjecture,
~ ! [X5,X3] :
( order(X5,X3)
=> ! [X2] :
( subset(X2,X3)
=> ! [X7] :
( greatest(X7,X5,X2)
<=> ( member(X7,X2)
& least_upper_bound(X7,X2,X5,X3) ) ) ) ),
inference(negated_conjecture,[],[f22]) ).
fof(f22,conjecture,
! [X5,X3] :
( order(X5,X3)
=> ! [X2] :
( subset(X2,X3)
=> ! [X7] :
( greatest(X7,X5,X2)
<=> ( member(X7,X2)
& least_upper_bound(X7,X2,X5,X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thIV13) ).
fof(f162,plain,
( spl10_2
| spl10_1 ),
inference(avatar_split_clause,[],[f129,f151,f154]) ).
fof(f129,plain,
( greatest(sK8,sK5,sK7)
| member(sK8,sK7) ),
inference(cnf_transformation,[],[f90]) ).
fof(f159,plain,
( ~ spl10_1
| ~ spl10_2
| ~ spl10_3 ),
inference(avatar_split_clause,[],[f130,f157,f154,f151]) ).
fof(f130,plain,
( ~ least_upper_bound(sK8,sK7,sK5,sK6)
| ~ member(sK8,sK7)
| ~ greatest(sK8,sK5,sK7) ),
inference(cnf_transformation,[],[f90]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SET801+4 : TPTP v8.1.0. Released v3.2.0.
% 0.06/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 : n018.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 14:24:40 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.49 % (29129)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.50 % (29114)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.19/0.50 % (29113)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.50 % (29115)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.19/0.50 % (29115)Instruction limit reached!
% 0.19/0.50 % (29115)------------------------------
% 0.19/0.50 % (29115)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50 % (29115)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50 % (29115)Termination reason: Unknown
% 0.19/0.50 % (29115)Termination phase: Property scanning
% 0.19/0.50
% 0.19/0.50 % (29115)Memory used [KB]: 1535
% 0.19/0.50 % (29115)Time elapsed: 0.002 s
% 0.19/0.50 % (29115)Instructions burned: 3 (million)
% 0.19/0.50 % (29115)------------------------------
% 0.19/0.50 % (29115)------------------------------
% 0.19/0.51 % (29127)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.19/0.51 % (29121)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.51 % (29127)Instruction limit reached!
% 0.19/0.51 % (29127)------------------------------
% 0.19/0.51 % (29127)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51 % (29127)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51 % (29127)Termination reason: Unknown
% 0.19/0.51 % (29127)Termination phase: Saturation
% 0.19/0.51
% 0.19/0.51 % (29127)Memory used [KB]: 6012
% 0.19/0.51 % (29127)Time elapsed: 0.003 s
% 0.19/0.51 % (29127)Instructions burned: 4 (million)
% 0.19/0.51 % (29127)------------------------------
% 0.19/0.51 % (29127)------------------------------
% 0.19/0.51 % (29117)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.19/0.51 % (29124)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.51 % (29116)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.51 % (29124)Refutation not found, incomplete strategy% (29124)------------------------------
% 0.19/0.51 % (29124)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51 % (29119)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.19/0.51 % (29116)Refutation not found, incomplete strategy% (29116)------------------------------
% 0.19/0.51 % (29116)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51 % (29132)dis-10_3:2_amm=sco:ep=RS:fsr=off:nm=10:sd=2:sos=on:ss=axioms:st=3.0:i=11:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/11Mi)
% 0.19/0.52 % (29130)fmb+10_1:1_nm=2:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.19/0.52 % (29137)dis+21_1:1_ep=RS:nwc=10.0:s2a=on:s2at=1.5:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.52 % (29135)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.19/0.52 % (29122)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 0.19/0.52 % (29116)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52 % (29116)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.52
% 0.19/0.52 % (29116)Memory used [KB]: 6140
% 0.19/0.52 % (29116)Time elapsed: 0.116 s
% 0.19/0.52 % (29116)Instructions burned: 6 (million)
% 0.19/0.52 % (29116)------------------------------
% 0.19/0.52 % (29116)------------------------------
% 0.19/0.52 % (29133)dis+1010_1:1_bs=on:ep=RS:erd=off:newcnf=on:nwc=10.0:s2a=on:sgt=32:ss=axioms:i=30:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/30Mi)
% 0.19/0.52 % (29118)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.19/0.52 % (29132)Refutation not found, incomplete strategy% (29132)------------------------------
% 0.19/0.52 % (29132)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52 % (29140)dis+21_1:1_aac=none:abs=on:er=known:fde=none:fsr=off:nwc=5.0:s2a=on:s2at=4.0:sp=const_frequency:to=lpo:urr=ec_only:i=25:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/25Mi)
% 0.19/0.52 % (29130)Instruction limit reached!
% 0.19/0.52 % (29130)------------------------------
% 0.19/0.52 % (29130)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52 % (29142)lrs-11_1:1_nm=0:sac=on:sd=4:ss=axioms:st=3.0:i=24:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/24Mi)
% 0.19/0.52 % (29120)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.52 % (29130)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52 % (29130)Termination reason: Unknown
% 0.19/0.52 % (29130)Termination phase: Property scanning
% 0.19/0.52
% 0.19/0.52 % (29130)Memory used [KB]: 1535
% 0.19/0.52 % (29130)Time elapsed: 0.004 s
% 0.19/0.52 % (29130)Instructions burned: 3 (million)
% 0.19/0.52 % (29130)------------------------------
% 0.19/0.52 % (29130)------------------------------
% 0.19/0.52 % (29138)lrs+11_1:1_plsq=on:plsqc=1:plsqr=32,1:ss=included:i=95:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/95Mi)
% 0.19/0.52 % (29139)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.52 % (29114)Instruction limit reached!
% 0.19/0.52 % (29114)------------------------------
% 0.19/0.52 % (29114)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52 % (29114)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52 % (29114)Termination reason: Unknown
% 0.19/0.52 % (29114)Termination phase: Saturation
% 0.19/0.52
% 0.19/0.52 % (29114)Memory used [KB]: 6268
% 0.19/0.52 % (29114)Time elapsed: 0.101 s
% 0.19/0.52 % (29114)Instructions burned: 14 (million)
% 0.19/0.52 % (29114)------------------------------
% 0.19/0.52 % (29114)------------------------------
% 0.19/0.52 % (29122)Refutation not found, incomplete strategy% (29122)------------------------------
% 0.19/0.52 % (29122)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52 % (29122)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52 % (29122)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.52
% 0.19/0.52 % (29122)Memory used [KB]: 6012
% 0.19/0.52 % (29122)Time elapsed: 0.129 s
% 0.19/0.52 % (29122)Instructions burned: 3 (million)
% 0.19/0.52 % (29122)------------------------------
% 0.19/0.52 % (29122)------------------------------
% 0.19/0.53 % (29140)First to succeed.
% 0.19/0.53 % (29128)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.53 % (29132)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.53 % (29132)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.53
% 0.19/0.53 % (29132)Memory used [KB]: 6012
% 0.19/0.53 % (29132)Time elapsed: 0.129 s
% 0.19/0.53 % (29132)Instructions burned: 3 (million)
% 0.19/0.53 % (29132)------------------------------
% 0.19/0.53 % (29132)------------------------------
% 0.19/0.53 % (29134)ott+21_1:1_erd=off:s2a=on:sac=on:sd=1:sgt=64:sos=on:ss=included:st=3.0:to=lpo:urr=on:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.53 % (29124)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.53 % (29124)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.53
% 0.19/0.53 % (29124)Memory used [KB]: 6012
% 0.19/0.53 % (29124)Time elapsed: 0.120 s
% 0.19/0.53 % (29124)Instructions burned: 3 (million)
% 0.19/0.53 % (29124)------------------------------
% 0.19/0.53 % (29124)------------------------------
% 0.19/0.53 % (29131)ott+1010_1:1_sd=2:sos=on:sp=occurrence:ss=axioms:urr=on:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.19/0.53 % (29131)Instruction limit reached!
% 0.19/0.53 % (29131)------------------------------
% 0.19/0.53 % (29131)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.53 % (29131)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.53 % (29131)Termination reason: Unknown
% 0.19/0.53 % (29131)Termination phase: Saturation
% 0.19/0.53
% 0.19/0.53 % (29131)Memory used [KB]: 1535
% 0.19/0.53 % (29131)Time elapsed: 0.002 s
% 0.19/0.53 % (29131)Instructions burned: 3 (million)
% 0.19/0.53 % (29131)------------------------------
% 0.19/0.53 % (29131)------------------------------
% 0.19/0.53 % (29121)Also succeeded, but the first one will report.
% 0.19/0.53 % (29140)Refutation found. Thanks to Tanya!
% 0.19/0.53 % SZS status Theorem for theBenchmark
% 0.19/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.53 % (29140)------------------------------
% 0.19/0.53 % (29140)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.53 % (29140)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.53 % (29140)Termination reason: Refutation
% 0.19/0.53
% 0.19/0.53 % (29140)Memory used [KB]: 6140
% 0.19/0.53 % (29140)Time elapsed: 0.131 s
% 0.19/0.53 % (29140)Instructions burned: 11 (million)
% 0.19/0.53 % (29140)------------------------------
% 0.19/0.53 % (29140)------------------------------
% 0.19/0.53 % (29112)Success in time 0.181 s
%------------------------------------------------------------------------------