TSTP Solution File: SET796+4 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SET796+4 : TPTP v8.1.0. Bugfixed v4.0.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 : n023.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:25:40 EDT 2022
% Result : Theorem 1.63s 0.57s
% Output : Refutation 1.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 12
% Syntax : Number of formulae : 80 ( 6 unt; 0 def)
% Number of atoms : 348 ( 33 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 401 ( 133 ~; 132 |; 95 &)
% ( 13 <=>; 28 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 5 prp; 0-4 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-4 aty)
% Number of variables : 195 ( 172 !; 23 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f688,plain,
$false,
inference(avatar_sat_refutation,[],[f521,f586,f592,f601,f687]) ).
fof(f687,plain,
( ~ spl9_2
| ~ spl9_34 ),
inference(avatar_contradiction_clause,[],[f686]) ).
fof(f686,plain,
( $false
| ~ spl9_2
| ~ spl9_34 ),
inference(subsumption_resolution,[],[f685,f91]) ).
fof(f91,plain,
~ greatest_lower_bound(sK2,unordered_pair(sK2,sK1),sK0,sK3),
inference(cnf_transformation,[],[f56]) ).
fof(f56,plain,
( member(sK1,sK3)
& order(sK0,sK3)
& apply(sK0,sK2,sK1)
& ~ greatest_lower_bound(sK2,unordered_pair(sK2,sK1),sK0,sK3)
& member(sK2,sK3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f54,f55]) ).
fof(f55,plain,
( ? [X0,X1,X2,X3] :
( member(X1,X3)
& order(X0,X3)
& apply(X0,X2,X1)
& ~ greatest_lower_bound(X2,unordered_pair(X2,X1),X0,X3)
& member(X2,X3) )
=> ( member(sK1,sK3)
& order(sK0,sK3)
& apply(sK0,sK2,sK1)
& ~ greatest_lower_bound(sK2,unordered_pair(sK2,sK1),sK0,sK3)
& member(sK2,sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f54,plain,
? [X0,X1,X2,X3] :
( member(X1,X3)
& order(X0,X3)
& apply(X0,X2,X1)
& ~ greatest_lower_bound(X2,unordered_pair(X2,X1),X0,X3)
& member(X2,X3) ),
inference(rectify,[],[f46]) ).
fof(f46,plain,
? [X2,X1,X3,X0] :
( member(X1,X0)
& order(X2,X0)
& apply(X2,X3,X1)
& ~ greatest_lower_bound(X3,unordered_pair(X3,X1),X2,X0)
& member(X3,X0) ),
inference(flattening,[],[f45]) ).
fof(f45,plain,
? [X2,X1,X3,X0] :
( ~ greatest_lower_bound(X3,unordered_pair(X3,X1),X2,X0)
& apply(X2,X3,X1)
& member(X1,X0)
& member(X3,X0)
& order(X2,X0) ),
inference(ennf_transformation,[],[f31]) ).
fof(f31,plain,
~ ! [X2,X1,X3,X0] :
( ( apply(X2,X3,X1)
& member(X1,X0)
& member(X3,X0)
& order(X2,X0) )
=> greatest_lower_bound(X3,unordered_pair(X3,X1),X2,X0) ),
inference(rectify,[],[f23]) ).
fof(f23,negated_conjecture,
~ ! [X3,X1,X5,X0] :
( ( order(X5,X3)
& apply(X5,X0,X1)
& member(X0,X3)
& member(X1,X3) )
=> greatest_lower_bound(X0,unordered_pair(X0,X1),X5,X3) ),
inference(negated_conjecture,[],[f22]) ).
fof(f22,conjecture,
! [X3,X1,X5,X0] :
( ( order(X5,X3)
& apply(X5,X0,X1)
& member(X0,X3)
& member(X1,X3) )
=> greatest_lower_bound(X0,unordered_pair(X0,X1),X5,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thIV8) ).
fof(f685,plain,
( greatest_lower_bound(sK2,unordered_pair(sK2,sK1),sK0,sK3)
| ~ spl9_2
| ~ spl9_34 ),
inference(subsumption_resolution,[],[f684,f130]) ).
fof(f130,plain,
! [X2,X0] : member(X2,unordered_pair(X2,X0)),
inference(equality_resolution,[],[f115]) ).
fof(f115,plain,
! [X2,X0,X1] :
( member(X1,unordered_pair(X2,X0))
| X1 != X2 ),
inference(cnf_transformation,[],[f76]) ).
fof(f76,plain,
! [X0,X1,X2] :
( ( member(X1,unordered_pair(X2,X0))
| ( X0 != X1
& X1 != X2 ) )
& ( X0 = X1
| X1 = X2
| ~ member(X1,unordered_pair(X2,X0)) ) ),
inference(rectify,[],[f75]) ).
fof(f75,plain,
! [X0,X2,X1] :
( ( member(X2,unordered_pair(X1,X0))
| ( X0 != X2
& X1 != X2 ) )
& ( X0 = X2
| X1 = X2
| ~ member(X2,unordered_pair(X1,X0)) ) ),
inference(flattening,[],[f74]) ).
fof(f74,plain,
! [X0,X2,X1] :
( ( member(X2,unordered_pair(X1,X0))
| ( X0 != X2
& X1 != X2 ) )
& ( X0 = X2
| X1 = X2
| ~ member(X2,unordered_pair(X1,X0)) ) ),
inference(nnf_transformation,[],[f25]) ).
fof(f25,plain,
! [X0,X2,X1] :
( member(X2,unordered_pair(X1,X0))
<=> ( X0 = X2
| X1 = X2 ) ),
inference(rectify,[],[f9]) ).
fof(f9,axiom,
! [X1,X0,X2] :
( member(X2,unordered_pair(X0,X1))
<=> ( X1 = X2
| X0 = X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unordered_pair) ).
fof(f684,plain,
( ~ member(sK2,unordered_pair(sK2,sK1))
| greatest_lower_bound(sK2,unordered_pair(sK2,sK1),sK0,sK3)
| ~ spl9_2
| ~ spl9_34 ),
inference(subsumption_resolution,[],[f683,f188]) ).
fof(f188,plain,
( lower_bound(sK2,sK0,unordered_pair(sK2,sK1))
| ~ spl9_2 ),
inference(avatar_component_clause,[],[f187]) ).
fof(f187,plain,
( spl9_2
<=> lower_bound(sK2,sK0,unordered_pair(sK2,sK1)) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_2])]) ).
fof(f683,plain,
( ~ lower_bound(sK2,sK0,unordered_pair(sK2,sK1))
| greatest_lower_bound(sK2,unordered_pair(sK2,sK1),sK0,sK3)
| ~ member(sK2,unordered_pair(sK2,sK1))
| ~ spl9_34 ),
inference(duplicate_literal_removal,[],[f679]) ).
fof(f679,plain,
( ~ member(sK2,unordered_pair(sK2,sK1))
| ~ lower_bound(sK2,sK0,unordered_pair(sK2,sK1))
| greatest_lower_bound(sK2,unordered_pair(sK2,sK1),sK0,sK3)
| ~ member(sK2,unordered_pair(sK2,sK1))
| ~ spl9_34 ),
inference(resolution,[],[f621,f107]) ).
fof(f107,plain,
! [X2,X3,X0,X1] :
( ~ apply(X2,sK6(X0,X1,X2,X3),X3)
| ~ member(X3,X0)
| ~ lower_bound(X3,X2,X0)
| greatest_lower_bound(X3,X0,X2,X1) ),
inference(cnf_transformation,[],[f71]) ).
fof(f71,plain,
! [X0,X1,X2,X3] :
( ~ member(X3,X0)
| ~ lower_bound(X3,X2,X0)
| ( lower_bound(sK6(X0,X1,X2,X3),X2,X0)
& member(sK6(X0,X1,X2,X3),X1)
& ~ apply(X2,sK6(X0,X1,X2,X3),X3) )
| greatest_lower_bound(X3,X0,X2,X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6])],[f69,f70]) ).
fof(f70,plain,
! [X0,X1,X2,X3] :
( ? [X4] :
( lower_bound(X4,X2,X0)
& member(X4,X1)
& ~ apply(X2,X4,X3) )
=> ( lower_bound(sK6(X0,X1,X2,X3),X2,X0)
& member(sK6(X0,X1,X2,X3),X1)
& ~ apply(X2,sK6(X0,X1,X2,X3),X3) ) ),
introduced(choice_axiom,[]) ).
fof(f69,plain,
! [X0,X1,X2,X3] :
( ~ member(X3,X0)
| ~ lower_bound(X3,X2,X0)
| ? [X4] :
( lower_bound(X4,X2,X0)
& member(X4,X1)
& ~ apply(X2,X4,X3) )
| greatest_lower_bound(X3,X0,X2,X1) ),
inference(rectify,[],[f49]) ).
fof(f49,plain,
! [X0,X2,X3,X1] :
( ~ member(X1,X0)
| ~ lower_bound(X1,X3,X0)
| ? [X4] :
( lower_bound(X4,X3,X0)
& member(X4,X2)
& ~ apply(X3,X4,X1) )
| greatest_lower_bound(X1,X0,X3,X2) ),
inference(flattening,[],[f48]) ).
fof(f48,plain,
! [X2,X0,X1,X3] :
( greatest_lower_bound(X1,X0,X3,X2)
| ~ lower_bound(X1,X3,X0)
| ~ member(X1,X0)
| ? [X4] :
( ~ apply(X3,X4,X1)
& lower_bound(X4,X3,X0)
& member(X4,X2) ) ),
inference(ennf_transformation,[],[f42]) ).
fof(f42,plain,
! [X2,X0,X1,X3] :
( ( lower_bound(X1,X3,X0)
& member(X1,X0)
& ! [X4] :
( ( lower_bound(X4,X3,X0)
& member(X4,X2) )
=> apply(X3,X4,X1) ) )
=> greatest_lower_bound(X1,X0,X3,X2) ),
inference(unused_predicate_definition_removal,[],[f24]) ).
fof(f24,plain,
! [X2,X0,X1,X3] :
( ( lower_bound(X1,X3,X0)
& member(X1,X0)
& ! [X4] :
( ( lower_bound(X4,X3,X0)
& member(X4,X2) )
=> apply(X3,X4,X1) ) )
<=> greatest_lower_bound(X1,X0,X3,X2) ),
inference(rectify,[],[f21]) ).
fof(f21,axiom,
! [X2,X0,X3,X5] :
( ( member(X0,X2)
& ! [X7] :
( ( lower_bound(X7,X5,X2)
& member(X7,X3) )
=> apply(X5,X7,X0) )
& lower_bound(X0,X5,X2) )
<=> greatest_lower_bound(X0,X2,X5,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',greatest_lower_bound) ).
fof(f621,plain,
( ! [X0] :
( apply(sK0,sK6(unordered_pair(sK2,sK1),sK3,sK0,sK2),X0)
| ~ member(X0,unordered_pair(sK2,sK1)) )
| ~ spl9_34 ),
inference(resolution,[],[f585,f103]) ).
fof(f103,plain,
! [X2,X3,X0,X1] :
( ~ lower_bound(X1,X0,X2)
| ~ member(X3,X2)
| apply(X0,X1,X3) ),
inference(cnf_transformation,[],[f65]) ).
fof(f65,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])],[f63,f64]) ).
fof(f64,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(f63,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,[],[f62]) ).
fof(f62,plain,
! [X1,X2,X0] :
( ( ! [X3] :
( apply(X1,X2,X3)
| ~ member(X3,X0) )
| ~ lower_bound(X2,X1,X0) )
& ( lower_bound(X2,X1,X0)
| ? [X3] :
( ~ apply(X1,X2,X3)
& member(X3,X0) ) ) ),
inference(nnf_transformation,[],[f47]) ).
fof(f47,plain,
! [X1,X2,X0] :
( ! [X3] :
( apply(X1,X2,X3)
| ~ member(X3,X0) )
<=> lower_bound(X2,X1,X0) ),
inference(ennf_transformation,[],[f41]) ).
fof(f41,plain,
! [X1,X0,X2] :
( ! [X3] :
( member(X3,X0)
=> apply(X1,X2,X3) )
<=> lower_bound(X2,X1,X0) ),
inference(rectify,[],[f15]) ).
fof(f15,axiom,
! [X3,X5,X7] :
( lower_bound(X7,X5,X3)
<=> ! [X2] :
( member(X2,X3)
=> apply(X5,X7,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lower_bound) ).
fof(f585,plain,
( lower_bound(sK6(unordered_pair(sK2,sK1),sK3,sK0,sK2),sK0,unordered_pair(sK2,sK1))
| ~ spl9_34 ),
inference(avatar_component_clause,[],[f583]) ).
fof(f583,plain,
( spl9_34
<=> lower_bound(sK6(unordered_pair(sK2,sK1),sK3,sK0,sK2),sK0,unordered_pair(sK2,sK1)) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_34])]) ).
fof(f601,plain,
( spl9_2
| ~ spl9_28 ),
inference(avatar_contradiction_clause,[],[f600]) ).
fof(f600,plain,
( $false
| spl9_2
| ~ spl9_28 ),
inference(subsumption_resolution,[],[f599,f90]) ).
fof(f90,plain,
member(sK2,sK3),
inference(cnf_transformation,[],[f56]) ).
fof(f599,plain,
( ~ member(sK2,sK3)
| spl9_2
| ~ spl9_28 ),
inference(resolution,[],[f598,f93]) ).
fof(f93,plain,
order(sK0,sK3),
inference(cnf_transformation,[],[f56]) ).
fof(f598,plain,
( ! [X0] :
( ~ order(sK0,X0)
| ~ member(sK2,X0) )
| spl9_2
| ~ spl9_28 ),
inference(resolution,[],[f597,f100]) ).
fof(f100,plain,
! [X2,X0,X1] :
( apply(X0,X2,X2)
| ~ order(X0,X1)
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f61]) ).
fof(f61,plain,
! [X0,X1] :
( ( ! [X2] :
( apply(X0,X2,X2)
| ~ member(X2,X1) )
& ! [X3,X4,X5] :
( ~ member(X3,X1)
| apply(X0,X5,X3)
| ~ apply(X0,X5,X4)
| ~ member(X5,X1)
| ~ apply(X0,X4,X3)
| ~ member(X4,X1) )
& ! [X6,X7] :
( ~ member(X6,X1)
| X6 = X7
| ~ apply(X0,X7,X6)
| ~ apply(X0,X6,X7)
| ~ member(X7,X1) ) )
| ~ order(X0,X1) ),
inference(rectify,[],[f51]) ).
fof(f51,plain,
! [X0,X1] :
( ( ! [X2] :
( apply(X0,X2,X2)
| ~ member(X2,X1) )
& ! [X7,X6,X5] :
( ~ member(X7,X1)
| apply(X0,X5,X7)
| ~ apply(X0,X5,X6)
| ~ member(X5,X1)
| ~ apply(X0,X6,X7)
| ~ member(X6,X1) )
& ! [X4,X3] :
( ~ member(X4,X1)
| X3 = X4
| ~ apply(X0,X3,X4)
| ~ apply(X0,X4,X3)
| ~ member(X3,X1) ) )
| ~ order(X0,X1) ),
inference(flattening,[],[f50]) ).
fof(f50,plain,
! [X1,X0] :
( ( ! [X2] :
( apply(X0,X2,X2)
| ~ member(X2,X1) )
& ! [X6,X7,X5] :
( apply(X0,X5,X7)
| ~ apply(X0,X5,X6)
| ~ apply(X0,X6,X7)
| ~ member(X7,X1)
| ~ member(X6,X1)
| ~ member(X5,X1) )
& ! [X4,X3] :
( X3 = X4
| ~ apply(X0,X4,X3)
| ~ apply(X0,X3,X4)
| ~ member(X3,X1)
| ~ member(X4,X1) ) )
| ~ order(X0,X1) ),
inference(ennf_transformation,[],[f43]) ).
fof(f43,plain,
! [X1,X0] :
( order(X0,X1)
=> ( ! [X2] :
( member(X2,X1)
=> apply(X0,X2,X2) )
& ! [X6,X7,X5] :
( ( member(X7,X1)
& member(X6,X1)
& member(X5,X1) )
=> ( ( apply(X0,X5,X6)
& apply(X0,X6,X7) )
=> apply(X0,X5,X7) ) )
& ! [X4,X3] :
( ( member(X3,X1)
& member(X4,X1) )
=> ( ( apply(X0,X4,X3)
& apply(X0,X3,X4) )
=> X3 = X4 ) ) ) ),
inference(unused_predicate_definition_removal,[],[f38]) ).
fof(f38,plain,
! [X1,X0] :
( ( ! [X2] :
( member(X2,X1)
=> apply(X0,X2,X2) )
& ! [X6,X7,X5] :
( ( member(X7,X1)
& member(X6,X1)
& member(X5,X1) )
=> ( ( apply(X0,X5,X6)
& apply(X0,X6,X7) )
=> apply(X0,X5,X7) ) )
& ! [X4,X3] :
( ( member(X3,X1)
& member(X4,X1) )
=> ( ( apply(X0,X4,X3)
& apply(X0,X3,X4) )
=> X3 = X4 ) ) )
<=> order(X0,X1) ),
inference(rectify,[],[f12]) ).
fof(f12,axiom,
! [X5,X3] :
( order(X5,X3)
<=> ( ! [X2] :
( member(X2,X3)
=> apply(X5,X2,X2) )
& ! [X4,X2] :
( ( member(X2,X3)
& member(X4,X3) )
=> ( ( apply(X5,X2,X4)
& apply(X5,X4,X2) )
=> X2 = X4 ) )
& ! [X2,X4,X6] :
( ( member(X6,X3)
& member(X2,X3)
& member(X4,X3) )
=> ( ( apply(X5,X4,X6)
& apply(X5,X2,X4) )
=> apply(X5,X2,X6) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',order) ).
fof(f597,plain,
( ~ apply(sK0,sK2,sK2)
| spl9_2
| ~ spl9_28 ),
inference(subsumption_resolution,[],[f594,f189]) ).
fof(f189,plain,
( ~ lower_bound(sK2,sK0,unordered_pair(sK2,sK1))
| spl9_2 ),
inference(avatar_component_clause,[],[f187]) ).
fof(f594,plain,
( ~ apply(sK0,sK2,sK2)
| lower_bound(sK2,sK0,unordered_pair(sK2,sK1))
| ~ spl9_28 ),
inference(superposition,[],[f102,f520]) ).
fof(f520,plain,
( sK2 = sK5(sK0,sK2,unordered_pair(sK2,sK1))
| ~ spl9_28 ),
inference(avatar_component_clause,[],[f518]) ).
fof(f518,plain,
( spl9_28
<=> sK2 = sK5(sK0,sK2,unordered_pair(sK2,sK1)) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_28])]) ).
fof(f102,plain,
! [X2,X0,X1] :
( ~ apply(X0,X1,sK5(X0,X1,X2))
| lower_bound(X1,X0,X2) ),
inference(cnf_transformation,[],[f65]) ).
fof(f592,plain,
( spl9_2
| ~ spl9_27 ),
inference(avatar_contradiction_clause,[],[f591]) ).
fof(f591,plain,
( $false
| spl9_2
| ~ spl9_27 ),
inference(subsumption_resolution,[],[f590,f92]) ).
fof(f92,plain,
apply(sK0,sK2,sK1),
inference(cnf_transformation,[],[f56]) ).
fof(f590,plain,
( ~ apply(sK0,sK2,sK1)
| spl9_2
| ~ spl9_27 ),
inference(subsumption_resolution,[],[f588,f189]) ).
fof(f588,plain,
( lower_bound(sK2,sK0,unordered_pair(sK2,sK1))
| ~ apply(sK0,sK2,sK1)
| ~ spl9_27 ),
inference(superposition,[],[f102,f516]) ).
fof(f516,plain,
( sK1 = sK5(sK0,sK2,unordered_pair(sK2,sK1))
| ~ spl9_27 ),
inference(avatar_component_clause,[],[f514]) ).
fof(f514,plain,
( spl9_27
<=> sK1 = sK5(sK0,sK2,unordered_pair(sK2,sK1)) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_27])]) ).
fof(f586,plain,
( ~ spl9_2
| spl9_34 ),
inference(avatar_split_clause,[],[f581,f583,f187]) ).
fof(f581,plain,
( lower_bound(sK6(unordered_pair(sK2,sK1),sK3,sK0,sK2),sK0,unordered_pair(sK2,sK1))
| ~ lower_bound(sK2,sK0,unordered_pair(sK2,sK1)) ),
inference(subsumption_resolution,[],[f328,f130]) ).
fof(f328,plain,
( ~ member(sK2,unordered_pair(sK2,sK1))
| ~ lower_bound(sK2,sK0,unordered_pair(sK2,sK1))
| lower_bound(sK6(unordered_pair(sK2,sK1),sK3,sK0,sK2),sK0,unordered_pair(sK2,sK1)) ),
inference(resolution,[],[f109,f91]) ).
fof(f109,plain,
! [X2,X3,X0,X1] :
( greatest_lower_bound(X3,X0,X2,X1)
| lower_bound(sK6(X0,X1,X2,X3),X2,X0)
| ~ lower_bound(X3,X2,X0)
| ~ member(X3,X0) ),
inference(cnf_transformation,[],[f71]) ).
fof(f521,plain,
( spl9_27
| spl9_28
| spl9_2 ),
inference(avatar_split_clause,[],[f511,f187,f518,f514]) ).
fof(f511,plain,
( sK2 = sK5(sK0,sK2,unordered_pair(sK2,sK1))
| sK1 = sK5(sK0,sK2,unordered_pair(sK2,sK1))
| spl9_2 ),
inference(resolution,[],[f296,f189]) ).
fof(f296,plain,
! [X31,X28,X29,X30] :
( lower_bound(X28,X29,unordered_pair(X30,X31))
| sK5(X29,X28,unordered_pair(X30,X31)) = X31
| sK5(X29,X28,unordered_pair(X30,X31)) = X30 ),
inference(resolution,[],[f101,f114]) ).
fof(f114,plain,
! [X2,X0,X1] :
( ~ member(X1,unordered_pair(X2,X0))
| X1 = X2
| X0 = X1 ),
inference(cnf_transformation,[],[f76]) ).
fof(f101,plain,
! [X2,X0,X1] :
( member(sK5(X0,X1,X2),X2)
| lower_bound(X1,X0,X2) ),
inference(cnf_transformation,[],[f65]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : SET796+4 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.09/0.11 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.11/0.31 % Computer : n023.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Tue Aug 30 14:41:35 EDT 2022
% 0.17/0.31 % CPUTime :
% 0.17/0.46 % (11640)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.17/0.46 % (11640)Instruction limit reached!
% 0.17/0.46 % (11640)------------------------------
% 0.17/0.46 % (11640)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.17/0.47 % (11656)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.17/0.48 % (11640)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.17/0.48 % (11640)Termination reason: Unknown
% 0.17/0.48 % (11640)Termination phase: Saturation
% 0.17/0.48
% 0.17/0.48 % (11640)Memory used [KB]: 5500
% 0.17/0.48 % (11640)Time elapsed: 0.084 s
% 0.17/0.48 % (11640)Instructions burned: 7 (million)
% 0.17/0.48 % (11640)------------------------------
% 0.17/0.48 % (11640)------------------------------
% 0.17/0.49 % (11648)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.17/0.49 % (11637)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.17/0.49 % (11647)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 (2999ds/68Mi)
% 0.17/0.49 % (11636)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.17/0.49 % (11633)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 0.17/0.49 % (11635)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.17/0.50 % (11658)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.17/0.50 % (11638)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.17/0.50 % (11639)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.17/0.50 % (11634)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.17/0.50 % (11661)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.17/0.50 % (11657)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.17/0.50 TRYING [1]
% 0.17/0.50 % (11646)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.17/0.50 TRYING [2]
% 0.17/0.50 % (11634)Refutation not found, incomplete strategy% (11634)------------------------------
% 0.17/0.50 % (11634)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.17/0.50 % (11634)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.17/0.50 % (11634)Termination reason: Refutation not found, incomplete strategy
% 0.17/0.50
% 0.17/0.50 % (11634)Memory used [KB]: 5500
% 0.17/0.50 % (11634)Time elapsed: 0.125 s
% 0.17/0.50 % (11634)Instructions burned: 5 (million)
% 0.17/0.50 % (11634)------------------------------
% 0.17/0.50 % (11634)------------------------------
% 0.17/0.50 % (11660)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/177Mi)
% 0.17/0.50 % (11659)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 (2999ds/68Mi)
% 0.17/0.50 % (11655)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 (2999ds/498Mi)
% 0.17/0.51 % (11653)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 0.17/0.51 % (11650)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.17/0.51 % (11652)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.17/0.51 % (11662)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/355Mi)
% 0.17/0.51 % (11651)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.17/0.51 % (11642)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.17/0.51 % (11645)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.17/0.51 % (11644)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.17/0.52 % (11654)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.17/0.52 % (11643)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 1.49/0.52 % (11649)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 1.49/0.52 TRYING [1]
% 1.49/0.52 TRYING [2]
% 1.49/0.52 TRYING [3]
% 1.49/0.52 TRYING [3]
% 1.49/0.53 TRYING [4]
% 1.49/0.53 TRYING [4]
% 1.49/0.53 TRYING [1]
% 1.49/0.53 TRYING [2]
% 1.49/0.53 TRYING [3]
% 1.63/0.53 % (11641)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 1.63/0.53 % (11641)Instruction limit reached!
% 1.63/0.53 % (11641)------------------------------
% 1.63/0.53 % (11641)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.63/0.53 % (11641)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.63/0.53 % (11641)Termination reason: Unknown
% 1.63/0.53 % (11641)Termination phase: Preprocessing 3
% 1.63/0.53
% 1.63/0.53 % (11641)Memory used [KB]: 895
% 1.63/0.53 % (11641)Time elapsed: 0.003 s
% 1.63/0.53 % (11641)Instructions burned: 2 (million)
% 1.63/0.53 % (11641)------------------------------
% 1.63/0.53 % (11641)------------------------------
% 1.63/0.55 % (11635)Instruction limit reached!
% 1.63/0.55 % (11635)------------------------------
% 1.63/0.55 % (11635)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.63/0.55 % (11635)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.63/0.55 % (11635)Termination reason: Unknown
% 1.63/0.55 % (11635)Termination phase: Saturation
% 1.63/0.55
% 1.63/0.55 % (11635)Memory used [KB]: 1535
% 1.63/0.55 % (11635)Time elapsed: 0.166 s
% 1.63/0.55 % (11635)Instructions burned: 38 (million)
% 1.63/0.55 % (11635)------------------------------
% 1.63/0.55 % (11635)------------------------------
% 1.63/0.56 TRYING [4]
% 1.63/0.56 % (11653)First to succeed.
% 1.63/0.57 % (11653)Refutation found. Thanks to Tanya!
% 1.63/0.57 % SZS status Theorem for theBenchmark
% 1.63/0.57 % SZS output start Proof for theBenchmark
% See solution above
% 1.63/0.57 % (11653)------------------------------
% 1.63/0.57 % (11653)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.63/0.57 % (11653)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.63/0.57 % (11653)Termination reason: Refutation
% 1.63/0.57
% 1.63/0.57 % (11653)Memory used [KB]: 6012
% 1.63/0.57 % (11653)Time elapsed: 0.181 s
% 1.63/0.57 % (11653)Instructions burned: 26 (million)
% 1.63/0.57 % (11653)------------------------------
% 1.63/0.57 % (11653)------------------------------
% 1.63/0.57 % (11632)Success in time 0.245 s
%------------------------------------------------------------------------------