TSTP Solution File: SET802+4 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SET802+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 : n005.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.22s 0.53s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 15
% Syntax : Number of formulae : 88 ( 2 unt; 0 def)
% Number of atoms : 378 ( 0 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 439 ( 149 ~; 154 |; 99 &)
% ( 18 <=>; 18 =>; 0 <=; 1 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 13 ( 12 usr; 6 prp; 0-4 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-4 aty)
% Number of variables : 193 ( 156 !; 37 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f336,plain,
$false,
inference(avatar_sat_refutation,[],[f93,f95,f183,f214,f220,f284,f335]) ).
fof(f335,plain,
( ~ spl7_5
| spl7_6 ),
inference(avatar_contradiction_clause,[],[f334]) ).
fof(f334,plain,
( $false
| ~ spl7_5
| spl7_6 ),
inference(subsumption_resolution,[],[f322,f219]) ).
fof(f219,plain,
( ~ apply(sK0,sK4(sK0,sK3,sK1,sK2),sK3)
| spl7_6 ),
inference(avatar_component_clause,[],[f217]) ).
fof(f217,plain,
( spl7_6
<=> apply(sK0,sK4(sK0,sK3,sK1,sK2),sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_6])]) ).
fof(f322,plain,
( apply(sK0,sK4(sK0,sK3,sK1,sK2),sK3)
| ~ spl7_5 ),
inference(unit_resulting_resolution,[],[f213,f112]) ).
fof(f112,plain,
! [X24,X25] :
( ~ lower_bound(X24,X25,sK2)
| apply(X25,X24,sK3) ),
inference(resolution,[],[f94,f79]) ).
fof(f79,plain,
! [X2,X3,X0,X1] :
( ~ lower_bound(X1,X0,X2)
| ~ member(X3,X2)
| apply(X0,X1,X3) ),
inference(cnf_transformation,[],[f56]) ).
fof(f56,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( apply(X0,X1,X3)
| ~ member(X3,X2) )
| ~ lower_bound(X1,X0,X2) )
& ( lower_bound(X1,X0,X2)
| ( ~ apply(X0,X1,sK5(X0,X1,X2))
& member(sK5(X0,X1,X2),X2) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5])],[f54,f55]) ).
fof(f55,plain,
! [X0,X1,X2] :
( ? [X4] :
( ~ apply(X0,X1,X4)
& member(X4,X2) )
=> ( ~ apply(X0,X1,sK5(X0,X1,X2))
& member(sK5(X0,X1,X2),X2) ) ),
introduced(choice_axiom,[]) ).
fof(f54,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( apply(X0,X1,X3)
| ~ member(X3,X2) )
| ~ lower_bound(X1,X0,X2) )
& ( lower_bound(X1,X0,X2)
| ? [X4] :
( ~ apply(X0,X1,X4)
& member(X4,X2) ) ) ),
inference(rectify,[],[f53]) ).
fof(f53,plain,
! [X0,X2,X1] :
( ( ! [X3] :
( apply(X0,X2,X3)
| ~ member(X3,X1) )
| ~ lower_bound(X2,X0,X1) )
& ( lower_bound(X2,X0,X1)
| ? [X3] :
( ~ apply(X0,X2,X3)
& member(X3,X1) ) ) ),
inference(nnf_transformation,[],[f34]) ).
fof(f34,plain,
! [X0,X2,X1] :
( ! [X3] :
( apply(X0,X2,X3)
| ~ member(X3,X1) )
<=> lower_bound(X2,X0,X1) ),
inference(ennf_transformation,[],[f29]) ).
fof(f29,plain,
! [X1,X2,X0] :
( lower_bound(X2,X0,X1)
<=> ! [X3] :
( member(X3,X1)
=> apply(X0,X2,X3) ) ),
inference(rectify,[],[f15]) ).
fof(f15,axiom,
! [X5,X3,X7] :
( ! [X2] :
( member(X2,X3)
=> apply(X5,X7,X2) )
<=> lower_bound(X7,X5,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lower_bound) ).
fof(f94,plain,
member(sK3,sK2),
inference(subsumption_resolution,[],[f67,f82]) ).
fof(f82,plain,
! [X2,X0,X1] :
( member(X1,X2)
| ~ least(X1,X0,X2) ),
inference(cnf_transformation,[],[f61]) ).
fof(f61,plain,
! [X0,X1,X2] :
( ( ( ! [X3] :
( apply(X0,X1,X3)
| ~ member(X3,X2) )
& member(X1,X2) )
| ~ least(X1,X0,X2) )
& ( least(X1,X0,X2)
| ( ~ apply(X0,X1,sK6(X0,X1,X2))
& member(sK6(X0,X1,X2),X2) )
| ~ member(X1,X2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6])],[f59,f60]) ).
fof(f60,plain,
! [X0,X1,X2] :
( ? [X4] :
( ~ apply(X0,X1,X4)
& member(X4,X2) )
=> ( ~ apply(X0,X1,sK6(X0,X1,X2))
& member(sK6(X0,X1,X2),X2) ) ),
introduced(choice_axiom,[]) ).
fof(f59,plain,
! [X0,X1,X2] :
( ( ( ! [X3] :
( apply(X0,X1,X3)
| ~ member(X3,X2) )
& member(X1,X2) )
| ~ least(X1,X0,X2) )
& ( least(X1,X0,X2)
| ? [X4] :
( ~ apply(X0,X1,X4)
& member(X4,X2) )
| ~ member(X1,X2) ) ),
inference(rectify,[],[f58]) ).
fof(f58,plain,
! [X2,X1,X0] :
( ( ( ! [X3] :
( apply(X2,X1,X3)
| ~ member(X3,X0) )
& member(X1,X0) )
| ~ least(X1,X2,X0) )
& ( least(X1,X2,X0)
| ? [X3] :
( ~ apply(X2,X1,X3)
& member(X3,X0) )
| ~ member(X1,X0) ) ),
inference(flattening,[],[f57]) ).
fof(f57,plain,
! [X2,X1,X0] :
( ( ( ! [X3] :
( apply(X2,X1,X3)
| ~ member(X3,X0) )
& member(X1,X0) )
| ~ least(X1,X2,X0) )
& ( least(X1,X2,X0)
| ? [X3] :
( ~ apply(X2,X1,X3)
& member(X3,X0) )
| ~ member(X1,X0) ) ),
inference(nnf_transformation,[],[f32]) ).
fof(f32,plain,
! [X2,X1,X0] :
( ( ! [X3] :
( apply(X2,X1,X3)
| ~ member(X3,X0) )
& member(X1,X0) )
<=> least(X1,X2,X0) ),
inference(ennf_transformation,[],[f25]) ).
fof(f25,plain,
! [X1,X2,X0] :
( ( member(X1,X0)
& ! [X3] :
( member(X3,X0)
=> apply(X2,X1,X3) ) )
<=> least(X1,X2,X0) ),
inference(rectify,[],[f17]) ).
fof(f17,axiom,
! [X3,X7,X5] :
( least(X7,X5,X3)
<=> ( member(X7,X3)
& ! [X2] :
( member(X2,X3)
=> apply(X5,X7,X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',least) ).
fof(f67,plain,
( least(sK3,sK0,sK2)
| member(sK3,sK2) ),
inference(cnf_transformation,[],[f47]) ).
fof(f47,plain,
( ( ~ greatest_lower_bound(sK3,sK2,sK0,sK1)
| ~ member(sK3,sK2)
| ~ least(sK3,sK0,sK2) )
& ( ( greatest_lower_bound(sK3,sK2,sK0,sK1)
& member(sK3,sK2) )
| least(sK3,sK0,sK2) )
& subset(sK2,sK1)
& order(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f43,f46,f45,f44]) ).
fof(f44,plain,
( ? [X0,X1] :
( ? [X2] :
( ? [X3] :
( ( ~ greatest_lower_bound(X3,X2,X0,X1)
| ~ member(X3,X2)
| ~ least(X3,X0,X2) )
& ( ( greatest_lower_bound(X3,X2,X0,X1)
& member(X3,X2) )
| least(X3,X0,X2) ) )
& subset(X2,X1) )
& order(X0,X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ~ greatest_lower_bound(X3,X2,sK0,sK1)
| ~ member(X3,X2)
| ~ least(X3,sK0,X2) )
& ( ( greatest_lower_bound(X3,X2,sK0,sK1)
& member(X3,X2) )
| least(X3,sK0,X2) ) )
& subset(X2,sK1) )
& order(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f45,plain,
( ? [X2] :
( ? [X3] :
( ( ~ greatest_lower_bound(X3,X2,sK0,sK1)
| ~ member(X3,X2)
| ~ least(X3,sK0,X2) )
& ( ( greatest_lower_bound(X3,X2,sK0,sK1)
& member(X3,X2) )
| least(X3,sK0,X2) ) )
& subset(X2,sK1) )
=> ( ? [X3] :
( ( ~ greatest_lower_bound(X3,sK2,sK0,sK1)
| ~ member(X3,sK2)
| ~ least(X3,sK0,sK2) )
& ( ( greatest_lower_bound(X3,sK2,sK0,sK1)
& member(X3,sK2) )
| least(X3,sK0,sK2) ) )
& subset(sK2,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f46,plain,
( ? [X3] :
( ( ~ greatest_lower_bound(X3,sK2,sK0,sK1)
| ~ member(X3,sK2)
| ~ least(X3,sK0,sK2) )
& ( ( greatest_lower_bound(X3,sK2,sK0,sK1)
& member(X3,sK2) )
| least(X3,sK0,sK2) ) )
=> ( ( ~ greatest_lower_bound(sK3,sK2,sK0,sK1)
| ~ member(sK3,sK2)
| ~ least(sK3,sK0,sK2) )
& ( ( greatest_lower_bound(sK3,sK2,sK0,sK1)
& member(sK3,sK2) )
| least(sK3,sK0,sK2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f43,plain,
? [X0,X1] :
( ? [X2] :
( ? [X3] :
( ( ~ greatest_lower_bound(X3,X2,X0,X1)
| ~ member(X3,X2)
| ~ least(X3,X0,X2) )
& ( ( greatest_lower_bound(X3,X2,X0,X1)
& member(X3,X2) )
| least(X3,X0,X2) ) )
& subset(X2,X1) )
& order(X0,X1) ),
inference(rectify,[],[f42]) ).
fof(f42,plain,
? [X1,X0] :
( ? [X2] :
( ? [X3] :
( ( ~ greatest_lower_bound(X3,X2,X1,X0)
| ~ member(X3,X2)
| ~ least(X3,X1,X2) )
& ( ( greatest_lower_bound(X3,X2,X1,X0)
& member(X3,X2) )
| least(X3,X1,X2) ) )
& subset(X2,X0) )
& order(X1,X0) ),
inference(flattening,[],[f41]) ).
fof(f41,plain,
? [X1,X0] :
( ? [X2] :
( ? [X3] :
( ( ~ greatest_lower_bound(X3,X2,X1,X0)
| ~ member(X3,X2)
| ~ least(X3,X1,X2) )
& ( ( greatest_lower_bound(X3,X2,X1,X0)
& member(X3,X2) )
| least(X3,X1,X2) ) )
& subset(X2,X0) )
& order(X1,X0) ),
inference(nnf_transformation,[],[f33]) ).
fof(f33,plain,
? [X1,X0] :
( ? [X2] :
( ? [X3] :
( least(X3,X1,X2)
<~> ( greatest_lower_bound(X3,X2,X1,X0)
& member(X3,X2) ) )
& subset(X2,X0) )
& order(X1,X0) ),
inference(ennf_transformation,[],[f24]) ).
fof(f24,plain,
~ ! [X1,X0] :
( order(X1,X0)
=> ! [X2] :
( subset(X2,X0)
=> ! [X3] :
( least(X3,X1,X2)
<=> ( greatest_lower_bound(X3,X2,X1,X0)
& member(X3,X2) ) ) ) ),
inference(rectify,[],[f23]) ).
fof(f23,negated_conjecture,
~ ! [X3,X5] :
( order(X5,X3)
=> ! [X2] :
( subset(X2,X3)
=> ! [X7] :
( ( member(X7,X2)
& greatest_lower_bound(X7,X2,X5,X3) )
<=> least(X7,X5,X2) ) ) ),
inference(negated_conjecture,[],[f22]) ).
fof(f22,conjecture,
! [X3,X5] :
( order(X5,X3)
=> ! [X2] :
( subset(X2,X3)
=> ! [X7] :
( ( member(X7,X2)
& greatest_lower_bound(X7,X2,X5,X3) )
<=> least(X7,X5,X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thIV14) ).
fof(f213,plain,
( lower_bound(sK4(sK0,sK3,sK1,sK2),sK0,sK2)
| ~ spl7_5 ),
inference(avatar_component_clause,[],[f211]) ).
fof(f211,plain,
( spl7_5
<=> lower_bound(sK4(sK0,sK3,sK1,sK2),sK0,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_5])]) ).
fof(f284,plain,
( ~ spl7_1
| spl7_3 ),
inference(avatar_contradiction_clause,[],[f283]) ).
fof(f283,plain,
( $false
| ~ spl7_1
| spl7_3 ),
inference(subsumption_resolution,[],[f259,f226]) ).
fof(f226,plain,
( ~ apply(sK0,sK3,sK5(sK0,sK3,sK2))
| spl7_3 ),
inference(resolution,[],[f203,f78]) ).
fof(f78,plain,
! [X2,X0,X1] :
( lower_bound(X1,X0,X2)
| ~ apply(X0,X1,sK5(X0,X1,X2)) ),
inference(cnf_transformation,[],[f56]) ).
fof(f203,plain,
( ~ lower_bound(sK3,sK0,sK2)
| spl7_3 ),
inference(avatar_component_clause,[],[f201]) ).
fof(f201,plain,
( spl7_3
<=> lower_bound(sK3,sK0,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_3])]) ).
fof(f259,plain,
( apply(sK0,sK3,sK5(sK0,sK3,sK2))
| ~ spl7_1
| spl7_3 ),
inference(unit_resulting_resolution,[],[f221,f187]) ).
fof(f187,plain,
( ! [X0] :
( ~ member(X0,sK2)
| apply(sK0,sK3,X0) )
| ~ spl7_1 ),
inference(resolution,[],[f87,f83]) ).
fof(f83,plain,
! [X2,X3,X0,X1] :
( apply(X0,X1,X3)
| ~ least(X1,X0,X2)
| ~ member(X3,X2) ),
inference(cnf_transformation,[],[f61]) ).
fof(f87,plain,
( least(sK3,sK0,sK2)
| ~ spl7_1 ),
inference(avatar_component_clause,[],[f86]) ).
fof(f86,plain,
( spl7_1
<=> least(sK3,sK0,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_1])]) ).
fof(f221,plain,
( member(sK5(sK0,sK3,sK2),sK2)
| spl7_3 ),
inference(unit_resulting_resolution,[],[f203,f77]) ).
fof(f77,plain,
! [X2,X0,X1] :
( lower_bound(X1,X0,X2)
| member(sK5(X0,X1,X2),X2) ),
inference(cnf_transformation,[],[f56]) ).
fof(f220,plain,
( ~ spl7_6
| ~ spl7_3
| spl7_2 ),
inference(avatar_split_clause,[],[f215,f90,f201,f217]) ).
fof(f90,plain,
( spl7_2
<=> greatest_lower_bound(sK3,sK2,sK0,sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_2])]) ).
fof(f215,plain,
( ~ lower_bound(sK3,sK0,sK2)
| ~ apply(sK0,sK4(sK0,sK3,sK1,sK2),sK3)
| spl7_2 ),
inference(subsumption_resolution,[],[f196,f94]) ).
fof(f196,plain,
( ~ lower_bound(sK3,sK0,sK2)
| ~ apply(sK0,sK4(sK0,sK3,sK1,sK2),sK3)
| ~ member(sK3,sK2)
| spl7_2 ),
inference(resolution,[],[f92,f71]) ).
fof(f71,plain,
! [X2,X3,X0,X1] :
( ~ apply(X0,sK4(X0,X1,X2,X3),X1)
| greatest_lower_bound(X1,X3,X0,X2)
| ~ member(X1,X3)
| ~ lower_bound(X1,X0,X3) ),
inference(cnf_transformation,[],[f52]) ).
fof(f52,plain,
! [X0,X1,X2,X3] :
( ( ( lower_bound(X1,X0,X3)
& member(X1,X3)
& ! [X4] :
( ~ member(X4,X2)
| ~ lower_bound(X4,X0,X3)
| apply(X0,X4,X1) ) )
| ~ greatest_lower_bound(X1,X3,X0,X2) )
& ( greatest_lower_bound(X1,X3,X0,X2)
| ~ lower_bound(X1,X0,X3)
| ~ member(X1,X3)
| ( member(sK4(X0,X1,X2,X3),X2)
& lower_bound(sK4(X0,X1,X2,X3),X0,X3)
& ~ apply(X0,sK4(X0,X1,X2,X3),X1) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f50,f51]) ).
fof(f51,plain,
! [X0,X1,X2,X3] :
( ? [X5] :
( member(X5,X2)
& lower_bound(X5,X0,X3)
& ~ apply(X0,X5,X1) )
=> ( member(sK4(X0,X1,X2,X3),X2)
& lower_bound(sK4(X0,X1,X2,X3),X0,X3)
& ~ apply(X0,sK4(X0,X1,X2,X3),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f50,plain,
! [X0,X1,X2,X3] :
( ( ( lower_bound(X1,X0,X3)
& member(X1,X3)
& ! [X4] :
( ~ member(X4,X2)
| ~ lower_bound(X4,X0,X3)
| apply(X0,X4,X1) ) )
| ~ greatest_lower_bound(X1,X3,X0,X2) )
& ( greatest_lower_bound(X1,X3,X0,X2)
| ~ lower_bound(X1,X0,X3)
| ~ member(X1,X3)
| ? [X5] :
( member(X5,X2)
& lower_bound(X5,X0,X3)
& ~ apply(X0,X5,X1) ) ) ),
inference(rectify,[],[f49]) ).
fof(f49,plain,
! [X2,X1,X3,X0] :
( ( ( lower_bound(X1,X2,X0)
& member(X1,X0)
& ! [X4] :
( ~ member(X4,X3)
| ~ lower_bound(X4,X2,X0)
| apply(X2,X4,X1) ) )
| ~ greatest_lower_bound(X1,X0,X2,X3) )
& ( greatest_lower_bound(X1,X0,X2,X3)
| ~ lower_bound(X1,X2,X0)
| ~ member(X1,X0)
| ? [X4] :
( member(X4,X3)
& lower_bound(X4,X2,X0)
& ~ apply(X2,X4,X1) ) ) ),
inference(flattening,[],[f48]) ).
fof(f48,plain,
! [X2,X1,X3,X0] :
( ( ( lower_bound(X1,X2,X0)
& member(X1,X0)
& ! [X4] :
( ~ member(X4,X3)
| ~ lower_bound(X4,X2,X0)
| apply(X2,X4,X1) ) )
| ~ greatest_lower_bound(X1,X0,X2,X3) )
& ( greatest_lower_bound(X1,X0,X2,X3)
| ~ lower_bound(X1,X2,X0)
| ~ member(X1,X0)
| ? [X4] :
( member(X4,X3)
& lower_bound(X4,X2,X0)
& ~ apply(X2,X4,X1) ) ) ),
inference(nnf_transformation,[],[f39]) ).
fof(f39,plain,
! [X2,X1,X3,X0] :
( ( lower_bound(X1,X2,X0)
& member(X1,X0)
& ! [X4] :
( ~ member(X4,X3)
| ~ lower_bound(X4,X2,X0)
| apply(X2,X4,X1) ) )
<=> greatest_lower_bound(X1,X0,X2,X3) ),
inference(flattening,[],[f38]) ).
fof(f38,plain,
! [X3,X0,X2,X1] :
( greatest_lower_bound(X1,X0,X2,X3)
<=> ( member(X1,X0)
& ! [X4] :
( apply(X2,X4,X1)
| ~ member(X4,X3)
| ~ lower_bound(X4,X2,X0) )
& lower_bound(X1,X2,X0) ) ),
inference(ennf_transformation,[],[f26]) ).
fof(f26,plain,
! [X3,X0,X2,X1] :
( greatest_lower_bound(X1,X0,X2,X3)
<=> ( member(X1,X0)
& ! [X4] :
( ( member(X4,X3)
& lower_bound(X4,X2,X0) )
=> apply(X2,X4,X1) )
& lower_bound(X1,X2,X0) ) ),
inference(rectify,[],[f21]) ).
fof(f21,axiom,
! [X2,X0,X5,X3] :
( ( ! [X7] :
( ( member(X7,X3)
& lower_bound(X7,X5,X2) )
=> apply(X5,X7,X0) )
& lower_bound(X0,X5,X2)
& member(X0,X2) )
<=> greatest_lower_bound(X0,X2,X5,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',greatest_lower_bound) ).
fof(f92,plain,
( ~ greatest_lower_bound(sK3,sK2,sK0,sK1)
| spl7_2 ),
inference(avatar_component_clause,[],[f90]) ).
fof(f214,plain,
( ~ spl7_3
| spl7_5
| spl7_2 ),
inference(avatar_split_clause,[],[f209,f90,f211,f201]) ).
fof(f209,plain,
( lower_bound(sK4(sK0,sK3,sK1,sK2),sK0,sK2)
| ~ lower_bound(sK3,sK0,sK2)
| spl7_2 ),
inference(subsumption_resolution,[],[f198,f94]) ).
fof(f198,plain,
( ~ lower_bound(sK3,sK0,sK2)
| lower_bound(sK4(sK0,sK3,sK1,sK2),sK0,sK2)
| ~ member(sK3,sK2)
| spl7_2 ),
inference(resolution,[],[f92,f72]) ).
fof(f72,plain,
! [X2,X3,X0,X1] :
( ~ lower_bound(X1,X0,X3)
| lower_bound(sK4(X0,X1,X2,X3),X0,X3)
| ~ member(X1,X3)
| greatest_lower_bound(X1,X3,X0,X2) ),
inference(cnf_transformation,[],[f52]) ).
fof(f183,plain,
( spl7_1
| ~ spl7_2 ),
inference(avatar_contradiction_clause,[],[f182]) ).
fof(f182,plain,
( $false
| spl7_1
| ~ spl7_2 ),
inference(subsumption_resolution,[],[f166,f116]) ).
fof(f116,plain,
( ~ apply(sK0,sK3,sK6(sK0,sK3,sK2))
| spl7_1 ),
inference(unit_resulting_resolution,[],[f94,f88,f81]) ).
fof(f81,plain,
! [X2,X0,X1] :
( ~ apply(X0,X1,sK6(X0,X1,X2))
| ~ member(X1,X2)
| least(X1,X0,X2) ),
inference(cnf_transformation,[],[f61]) ).
fof(f88,plain,
( ~ least(sK3,sK0,sK2)
| spl7_1 ),
inference(avatar_component_clause,[],[f86]) ).
fof(f166,plain,
( apply(sK0,sK3,sK6(sK0,sK3,sK2))
| spl7_1
| ~ spl7_2 ),
inference(unit_resulting_resolution,[],[f120,f117,f79]) ).
fof(f117,plain,
( member(sK6(sK0,sK3,sK2),sK2)
| spl7_1 ),
inference(unit_resulting_resolution,[],[f94,f88,f80]) ).
fof(f80,plain,
! [X2,X0,X1] :
( ~ member(X1,X2)
| member(sK6(X0,X1,X2),X2)
| least(X1,X0,X2) ),
inference(cnf_transformation,[],[f61]) ).
fof(f120,plain,
( lower_bound(sK3,sK0,sK2)
| ~ spl7_2 ),
inference(unit_resulting_resolution,[],[f91,f76]) ).
fof(f76,plain,
! [X2,X3,X0,X1] :
( lower_bound(X1,X0,X3)
| ~ greatest_lower_bound(X1,X3,X0,X2) ),
inference(cnf_transformation,[],[f52]) ).
fof(f91,plain,
( greatest_lower_bound(sK3,sK2,sK0,sK1)
| ~ spl7_2 ),
inference(avatar_component_clause,[],[f90]) ).
fof(f95,plain,
( spl7_1
| spl7_2 ),
inference(avatar_split_clause,[],[f68,f90,f86]) ).
fof(f68,plain,
( greatest_lower_bound(sK3,sK2,sK0,sK1)
| least(sK3,sK0,sK2) ),
inference(cnf_transformation,[],[f47]) ).
fof(f93,plain,
( ~ spl7_1
| ~ spl7_2 ),
inference(avatar_split_clause,[],[f84,f90,f86]) ).
fof(f84,plain,
( ~ greatest_lower_bound(sK3,sK2,sK0,sK1)
| ~ least(sK3,sK0,sK2) ),
inference(subsumption_resolution,[],[f69,f75]) ).
fof(f75,plain,
! [X2,X3,X0,X1] :
( ~ greatest_lower_bound(X1,X3,X0,X2)
| member(X1,X3) ),
inference(cnf_transformation,[],[f52]) ).
fof(f69,plain,
( ~ least(sK3,sK0,sK2)
| ~ member(sK3,sK2)
| ~ greatest_lower_bound(sK3,sK2,sK0,sK1) ),
inference(cnf_transformation,[],[f47]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SET802+4 : TPTP v8.1.0. Released v3.2.0.
% 0.13/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.14/0.35 % Computer : n005.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 : Tue Aug 30 14:20:33 EDT 2022
% 0.21/0.35 % CPUTime :
% 0.22/0.51 % (32304)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.22/0.51 % (32288)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.22/0.51 % (32288)First to succeed.
% 0.22/0.52 % (32292)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.22/0.52 % (32296)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.22/0.52 % (32300)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.22/0.52 % (32300)Refutation not found, incomplete strategy% (32300)------------------------------
% 0.22/0.52 % (32300)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.22/0.53 % (32308)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.22/0.53 % (32300)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.22/0.53 % (32300)Termination reason: Refutation not found, incomplete strategy
% 0.22/0.53
% 0.22/0.53 % (32300)Memory used [KB]: 6012
% 0.22/0.53 % (32300)Time elapsed: 0.110 s
% 0.22/0.53 % (32300)Instructions burned: 3 (million)
% 0.22/0.53 % (32300)------------------------------
% 0.22/0.53 % (32300)------------------------------
% 0.22/0.53 % (32289)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.22/0.53 % (32288)Refutation found. Thanks to Tanya!
% 0.22/0.53 % SZS status Theorem for theBenchmark
% 0.22/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.53 % (32288)------------------------------
% 0.22/0.53 % (32288)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.22/0.53 % (32288)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.22/0.53 % (32288)Termination reason: Refutation
% 0.22/0.53
% 0.22/0.53 % (32288)Memory used [KB]: 6140
% 0.22/0.53 % (32288)Time elapsed: 0.110 s
% 0.22/0.53 % (32288)Instructions burned: 8 (million)
% 0.22/0.53 % (32288)------------------------------
% 0.22/0.53 % (32288)------------------------------
% 0.22/0.53 % (32280)Success in time 0.169 s
%------------------------------------------------------------------------------