TSTP Solution File: SEU240+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU240+1 : TPTP v8.2.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n008.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 : Tue May 21 03:46:00 EDT 2024
% Result : Theorem 0.59s 0.76s
% Output : Refutation 0.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 12
% Syntax : Number of formulae : 79 ( 2 unt; 0 def)
% Number of atoms : 378 ( 0 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 504 ( 205 ~; 205 |; 68 &)
% ( 12 <=>; 12 =>; 0 <=; 2 <~>)
% Maximal formula depth : 15 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 6 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 153 ( 120 !; 33 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f165,plain,
$false,
inference(avatar_sat_refutation,[],[f92,f97,f102,f106,f128,f164]) ).
fof(f164,plain,
( ~ spl9_1
| spl9_2
| ~ spl9_3
| ~ spl9_4 ),
inference(avatar_contradiction_clause,[],[f163]) ).
fof(f163,plain,
( $false
| ~ spl9_1
| spl9_2
| ~ spl9_3
| ~ spl9_4 ),
inference(subsumption_resolution,[],[f162,f63]) ).
fof(f63,plain,
relation(sK0),
inference(cnf_transformation,[],[f53]) ).
fof(f53,plain,
( ( ( ~ in(ordered_pair(sK1,sK3),sK0)
& in(ordered_pair(sK2,sK3),sK0)
& in(ordered_pair(sK1,sK2),sK0) )
| ~ transitive(sK0) )
& ( ! [X4,X5,X6] :
( in(ordered_pair(X4,X6),sK0)
| ~ in(ordered_pair(X5,X6),sK0)
| ~ in(ordered_pair(X4,X5),sK0) )
| transitive(sK0) )
& relation(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f50,f52,f51]) ).
fof(f51,plain,
( ? [X0] :
( ( ? [X1,X2,X3] :
( ~ in(ordered_pair(X1,X3),X0)
& in(ordered_pair(X2,X3),X0)
& in(ordered_pair(X1,X2),X0) )
| ~ transitive(X0) )
& ( ! [X4,X5,X6] :
( in(ordered_pair(X4,X6),X0)
| ~ in(ordered_pair(X5,X6),X0)
| ~ in(ordered_pair(X4,X5),X0) )
| transitive(X0) )
& relation(X0) )
=> ( ( ? [X3,X2,X1] :
( ~ in(ordered_pair(X1,X3),sK0)
& in(ordered_pair(X2,X3),sK0)
& in(ordered_pair(X1,X2),sK0) )
| ~ transitive(sK0) )
& ( ! [X6,X5,X4] :
( in(ordered_pair(X4,X6),sK0)
| ~ in(ordered_pair(X5,X6),sK0)
| ~ in(ordered_pair(X4,X5),sK0) )
| transitive(sK0) )
& relation(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f52,plain,
( ? [X3,X2,X1] :
( ~ in(ordered_pair(X1,X3),sK0)
& in(ordered_pair(X2,X3),sK0)
& in(ordered_pair(X1,X2),sK0) )
=> ( ~ in(ordered_pair(sK1,sK3),sK0)
& in(ordered_pair(sK2,sK3),sK0)
& in(ordered_pair(sK1,sK2),sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f50,plain,
? [X0] :
( ( ? [X1,X2,X3] :
( ~ in(ordered_pair(X1,X3),X0)
& in(ordered_pair(X2,X3),X0)
& in(ordered_pair(X1,X2),X0) )
| ~ transitive(X0) )
& ( ! [X4,X5,X6] :
( in(ordered_pair(X4,X6),X0)
| ~ in(ordered_pair(X5,X6),X0)
| ~ in(ordered_pair(X4,X5),X0) )
| transitive(X0) )
& relation(X0) ),
inference(rectify,[],[f49]) ).
fof(f49,plain,
? [X0] :
( ( ? [X1,X2,X3] :
( ~ in(ordered_pair(X1,X3),X0)
& in(ordered_pair(X2,X3),X0)
& in(ordered_pair(X1,X2),X0) )
| ~ transitive(X0) )
& ( ! [X1,X2,X3] :
( in(ordered_pair(X1,X3),X0)
| ~ in(ordered_pair(X2,X3),X0)
| ~ in(ordered_pair(X1,X2),X0) )
| transitive(X0) )
& relation(X0) ),
inference(flattening,[],[f48]) ).
fof(f48,plain,
? [X0] :
( ( ? [X1,X2,X3] :
( ~ in(ordered_pair(X1,X3),X0)
& in(ordered_pair(X2,X3),X0)
& in(ordered_pair(X1,X2),X0) )
| ~ transitive(X0) )
& ( ! [X1,X2,X3] :
( in(ordered_pair(X1,X3),X0)
| ~ in(ordered_pair(X2,X3),X0)
| ~ in(ordered_pair(X1,X2),X0) )
| transitive(X0) )
& relation(X0) ),
inference(nnf_transformation,[],[f40]) ).
fof(f40,plain,
? [X0] :
( ( transitive(X0)
<~> ! [X1,X2,X3] :
( in(ordered_pair(X1,X3),X0)
| ~ in(ordered_pair(X2,X3),X0)
| ~ in(ordered_pair(X1,X2),X0) ) )
& relation(X0) ),
inference(flattening,[],[f39]) ).
fof(f39,plain,
? [X0] :
( ( transitive(X0)
<~> ! [X1,X2,X3] :
( in(ordered_pair(X1,X3),X0)
| ~ in(ordered_pair(X2,X3),X0)
| ~ in(ordered_pair(X1,X2),X0) ) )
& relation(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f26,negated_conjecture,
~ ! [X0] :
( relation(X0)
=> ( transitive(X0)
<=> ! [X1,X2,X3] :
( ( in(ordered_pair(X2,X3),X0)
& in(ordered_pair(X1,X2),X0) )
=> in(ordered_pair(X1,X3),X0) ) ) ),
inference(negated_conjecture,[],[f25]) ).
fof(f25,conjecture,
! [X0] :
( relation(X0)
=> ( transitive(X0)
<=> ! [X1,X2,X3] :
( ( in(ordered_pair(X2,X3),X0)
& in(ordered_pair(X1,X2),X0) )
=> in(ordered_pair(X1,X3),X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l2_wellord1) ).
fof(f162,plain,
( ~ relation(sK0)
| ~ spl9_1
| spl9_2
| ~ spl9_3
| ~ spl9_4 ),
inference(subsumption_resolution,[],[f161,f86]) ).
fof(f86,plain,
( transitive(sK0)
| ~ spl9_1 ),
inference(avatar_component_clause,[],[f85]) ).
fof(f85,plain,
( spl9_1
<=> transitive(sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_1])]) ).
fof(f161,plain,
( ~ transitive(sK0)
| ~ relation(sK0)
| spl9_2
| ~ spl9_3
| ~ spl9_4 ),
inference(subsumption_resolution,[],[f160,f136]) ).
fof(f136,plain,
( in(sK3,relation_field(sK0))
| ~ spl9_3 ),
inference(subsumption_resolution,[],[f132,f63]) ).
fof(f132,plain,
( in(sK3,relation_field(sK0))
| ~ relation(sK0)
| ~ spl9_3 ),
inference(resolution,[],[f96,f76]) ).
fof(f76,plain,
! [X2,X0,X1] :
( ~ in(ordered_pair(X0,X1),X2)
| in(X1,relation_field(X2))
| ~ relation(X2) ),
inference(cnf_transformation,[],[f45]) ).
fof(f45,plain,
! [X0,X1,X2] :
( ( in(X1,relation_field(X2))
& in(X0,relation_field(X2)) )
| ~ in(ordered_pair(X0,X1),X2)
| ~ relation(X2) ),
inference(flattening,[],[f44]) ).
fof(f44,plain,
! [X0,X1,X2] :
( ( in(X1,relation_field(X2))
& in(X0,relation_field(X2)) )
| ~ in(ordered_pair(X0,X1),X2)
| ~ relation(X2) ),
inference(ennf_transformation,[],[f35]) ).
fof(f35,axiom,
! [X0,X1,X2] :
( relation(X2)
=> ( in(ordered_pair(X0,X1),X2)
=> ( in(X1,relation_field(X2))
& in(X0,relation_field(X2)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t30_relat_1) ).
fof(f96,plain,
( in(ordered_pair(sK2,sK3),sK0)
| ~ spl9_3 ),
inference(avatar_component_clause,[],[f94]) ).
fof(f94,plain,
( spl9_3
<=> in(ordered_pair(sK2,sK3),sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_3])]) ).
fof(f160,plain,
( ~ in(sK3,relation_field(sK0))
| ~ transitive(sK0)
| ~ relation(sK0)
| spl9_2
| ~ spl9_3
| ~ spl9_4 ),
inference(subsumption_resolution,[],[f159,f145]) ).
fof(f145,plain,
( in(sK1,relation_field(sK0))
| ~ spl9_4 ),
inference(subsumption_resolution,[],[f141,f63]) ).
fof(f141,plain,
( in(sK1,relation_field(sK0))
| ~ relation(sK0)
| ~ spl9_4 ),
inference(resolution,[],[f101,f75]) ).
fof(f75,plain,
! [X2,X0,X1] :
( ~ in(ordered_pair(X0,X1),X2)
| in(X0,relation_field(X2))
| ~ relation(X2) ),
inference(cnf_transformation,[],[f45]) ).
fof(f101,plain,
( in(ordered_pair(sK1,sK2),sK0)
| ~ spl9_4 ),
inference(avatar_component_clause,[],[f99]) ).
fof(f99,plain,
( spl9_4
<=> in(ordered_pair(sK1,sK2),sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_4])]) ).
fof(f159,plain,
( ~ in(sK1,relation_field(sK0))
| ~ in(sK3,relation_field(sK0))
| ~ transitive(sK0)
| ~ relation(sK0)
| spl9_2
| ~ spl9_3
| ~ spl9_4 ),
inference(subsumption_resolution,[],[f158,f135]) ).
fof(f135,plain,
( in(sK2,relation_field(sK0))
| ~ spl9_3 ),
inference(subsumption_resolution,[],[f131,f63]) ).
fof(f131,plain,
( in(sK2,relation_field(sK0))
| ~ relation(sK0)
| ~ spl9_3 ),
inference(resolution,[],[f96,f75]) ).
fof(f158,plain,
( ~ in(sK2,relation_field(sK0))
| ~ in(sK1,relation_field(sK0))
| ~ in(sK3,relation_field(sK0))
| ~ transitive(sK0)
| ~ relation(sK0)
| spl9_2
| ~ spl9_3
| ~ spl9_4 ),
inference(resolution,[],[f156,f71]) ).
fof(f71,plain,
! [X0] :
( is_transitive_in(X0,relation_field(X0))
| ~ transitive(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f54]) ).
fof(f54,plain,
! [X0] :
( ( ( transitive(X0)
| ~ is_transitive_in(X0,relation_field(X0)) )
& ( is_transitive_in(X0,relation_field(X0))
| ~ transitive(X0) ) )
| ~ relation(X0) ),
inference(nnf_transformation,[],[f43]) ).
fof(f43,plain,
! [X0] :
( ( transitive(X0)
<=> is_transitive_in(X0,relation_field(X0)) )
| ~ relation(X0) ),
inference(ennf_transformation,[],[f6]) ).
fof(f6,axiom,
! [X0] :
( relation(X0)
=> ( transitive(X0)
<=> is_transitive_in(X0,relation_field(X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d16_relat_2) ).
fof(f156,plain,
( ! [X0] :
( ~ is_transitive_in(sK0,X0)
| ~ in(sK2,X0)
| ~ in(sK1,X0)
| ~ in(sK3,X0) )
| spl9_2
| ~ spl9_3
| ~ spl9_4 ),
inference(subsumption_resolution,[],[f154,f96]) ).
fof(f154,plain,
( ! [X0] :
( ~ in(ordered_pair(sK2,sK3),sK0)
| ~ in(sK3,X0)
| ~ in(sK2,X0)
| ~ in(sK1,X0)
| ~ is_transitive_in(sK0,X0) )
| spl9_2
| ~ spl9_4 ),
inference(resolution,[],[f153,f101]) ).
fof(f153,plain,
( ! [X0,X1] :
( ~ in(ordered_pair(sK1,X0),sK0)
| ~ in(ordered_pair(X0,sK3),sK0)
| ~ in(sK3,X1)
| ~ in(X0,X1)
| ~ in(sK1,X1)
| ~ is_transitive_in(sK0,X1) )
| spl9_2 ),
inference(subsumption_resolution,[],[f130,f63]) ).
fof(f130,plain,
( ! [X0,X1] :
( ~ in(ordered_pair(X0,sK3),sK0)
| ~ in(ordered_pair(sK1,X0),sK0)
| ~ in(sK3,X1)
| ~ in(X0,X1)
| ~ in(sK1,X1)
| ~ is_transitive_in(sK0,X1)
| ~ relation(sK0) )
| spl9_2 ),
inference(resolution,[],[f91,f77]) ).
fof(f77,plain,
! [X0,X1,X6,X7,X5] :
( in(ordered_pair(X5,X7),X0)
| ~ in(ordered_pair(X6,X7),X0)
| ~ in(ordered_pair(X5,X6),X0)
| ~ in(X7,X1)
| ~ in(X6,X1)
| ~ in(X5,X1)
| ~ is_transitive_in(X0,X1)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f62]) ).
fof(f62,plain,
! [X0] :
( ! [X1] :
( ( is_transitive_in(X0,X1)
| ( ~ in(ordered_pair(sK6(X0,X1),sK8(X0,X1)),X0)
& in(ordered_pair(sK7(X0,X1),sK8(X0,X1)),X0)
& in(ordered_pair(sK6(X0,X1),sK7(X0,X1)),X0)
& in(sK8(X0,X1),X1)
& in(sK7(X0,X1),X1)
& in(sK6(X0,X1),X1) ) )
& ( ! [X5,X6,X7] :
( in(ordered_pair(X5,X7),X0)
| ~ in(ordered_pair(X6,X7),X0)
| ~ in(ordered_pair(X5,X6),X0)
| ~ in(X7,X1)
| ~ in(X6,X1)
| ~ in(X5,X1) )
| ~ is_transitive_in(X0,X1) ) )
| ~ relation(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7,sK8])],[f60,f61]) ).
fof(f61,plain,
! [X0,X1] :
( ? [X2,X3,X4] :
( ~ in(ordered_pair(X2,X4),X0)
& in(ordered_pair(X3,X4),X0)
& in(ordered_pair(X2,X3),X0)
& in(X4,X1)
& in(X3,X1)
& in(X2,X1) )
=> ( ~ in(ordered_pair(sK6(X0,X1),sK8(X0,X1)),X0)
& in(ordered_pair(sK7(X0,X1),sK8(X0,X1)),X0)
& in(ordered_pair(sK6(X0,X1),sK7(X0,X1)),X0)
& in(sK8(X0,X1),X1)
& in(sK7(X0,X1),X1)
& in(sK6(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f60,plain,
! [X0] :
( ! [X1] :
( ( is_transitive_in(X0,X1)
| ? [X2,X3,X4] :
( ~ in(ordered_pair(X2,X4),X0)
& in(ordered_pair(X3,X4),X0)
& in(ordered_pair(X2,X3),X0)
& in(X4,X1)
& in(X3,X1)
& in(X2,X1) ) )
& ( ! [X5,X6,X7] :
( in(ordered_pair(X5,X7),X0)
| ~ in(ordered_pair(X6,X7),X0)
| ~ in(ordered_pair(X5,X6),X0)
| ~ in(X7,X1)
| ~ in(X6,X1)
| ~ in(X5,X1) )
| ~ is_transitive_in(X0,X1) ) )
| ~ relation(X0) ),
inference(rectify,[],[f59]) ).
fof(f59,plain,
! [X0] :
( ! [X1] :
( ( is_transitive_in(X0,X1)
| ? [X2,X3,X4] :
( ~ in(ordered_pair(X2,X4),X0)
& in(ordered_pair(X3,X4),X0)
& in(ordered_pair(X2,X3),X0)
& in(X4,X1)
& in(X3,X1)
& in(X2,X1) ) )
& ( ! [X2,X3,X4] :
( in(ordered_pair(X2,X4),X0)
| ~ in(ordered_pair(X3,X4),X0)
| ~ in(ordered_pair(X2,X3),X0)
| ~ in(X4,X1)
| ~ in(X3,X1)
| ~ in(X2,X1) )
| ~ is_transitive_in(X0,X1) ) )
| ~ relation(X0) ),
inference(nnf_transformation,[],[f47]) ).
fof(f47,plain,
! [X0] :
( ! [X1] :
( is_transitive_in(X0,X1)
<=> ! [X2,X3,X4] :
( in(ordered_pair(X2,X4),X0)
| ~ in(ordered_pair(X3,X4),X0)
| ~ in(ordered_pair(X2,X3),X0)
| ~ in(X4,X1)
| ~ in(X3,X1)
| ~ in(X2,X1) ) )
| ~ relation(X0) ),
inference(flattening,[],[f46]) ).
fof(f46,plain,
! [X0] :
( ! [X1] :
( is_transitive_in(X0,X1)
<=> ! [X2,X3,X4] :
( in(ordered_pair(X2,X4),X0)
| ~ in(ordered_pair(X3,X4),X0)
| ~ in(ordered_pair(X2,X3),X0)
| ~ in(X4,X1)
| ~ in(X3,X1)
| ~ in(X2,X1) ) )
| ~ relation(X0) ),
inference(ennf_transformation,[],[f9]) ).
fof(f9,axiom,
! [X0] :
( relation(X0)
=> ! [X1] :
( is_transitive_in(X0,X1)
<=> ! [X2,X3,X4] :
( ( in(ordered_pair(X3,X4),X0)
& in(ordered_pair(X2,X3),X0)
& in(X4,X1)
& in(X3,X1)
& in(X2,X1) )
=> in(ordered_pair(X2,X4),X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d8_relat_2) ).
fof(f91,plain,
( ~ in(ordered_pair(sK1,sK3),sK0)
| spl9_2 ),
inference(avatar_component_clause,[],[f89]) ).
fof(f89,plain,
( spl9_2
<=> in(ordered_pair(sK1,sK3),sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_2])]) ).
fof(f128,plain,
( spl9_1
| ~ spl9_5 ),
inference(avatar_split_clause,[],[f127,f104,f85]) ).
fof(f104,plain,
( spl9_5
<=> ! [X6,X4,X5] :
( in(ordered_pair(X4,X6),sK0)
| ~ in(ordered_pair(X4,X5),sK0)
| ~ in(ordered_pair(X5,X6),sK0) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_5])]) ).
fof(f127,plain,
( transitive(sK0)
| ~ spl9_5 ),
inference(subsumption_resolution,[],[f123,f63]) ).
fof(f123,plain,
( transitive(sK0)
| ~ relation(sK0)
| ~ spl9_5 ),
inference(resolution,[],[f122,f72]) ).
fof(f72,plain,
! [X0] :
( ~ is_transitive_in(X0,relation_field(X0))
| transitive(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f54]) ).
fof(f122,plain,
( ! [X0] : is_transitive_in(sK0,X0)
| ~ spl9_5 ),
inference(subsumption_resolution,[],[f121,f63]) ).
fof(f121,plain,
( ! [X0] :
( is_transitive_in(sK0,X0)
| ~ relation(sK0) )
| ~ spl9_5 ),
inference(duplicate_literal_removal,[],[f119]) ).
fof(f119,plain,
( ! [X0] :
( is_transitive_in(sK0,X0)
| is_transitive_in(sK0,X0)
| ~ relation(sK0) )
| ~ spl9_5 ),
inference(resolution,[],[f117,f82]) ).
fof(f82,plain,
! [X0,X1] :
( in(ordered_pair(sK7(X0,X1),sK8(X0,X1)),X0)
| is_transitive_in(X0,X1)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f62]) ).
fof(f117,plain,
( ! [X0] :
( ~ in(ordered_pair(sK7(sK0,X0),sK8(sK0,X0)),sK0)
| is_transitive_in(sK0,X0) )
| ~ spl9_5 ),
inference(subsumption_resolution,[],[f116,f63]) ).
fof(f116,plain,
( ! [X0] :
( ~ in(ordered_pair(sK7(sK0,X0),sK8(sK0,X0)),sK0)
| is_transitive_in(sK0,X0)
| ~ relation(sK0) )
| ~ spl9_5 ),
inference(duplicate_literal_removal,[],[f114]) ).
fof(f114,plain,
( ! [X0] :
( ~ in(ordered_pair(sK7(sK0,X0),sK8(sK0,X0)),sK0)
| is_transitive_in(sK0,X0)
| is_transitive_in(sK0,X0)
| ~ relation(sK0) )
| ~ spl9_5 ),
inference(resolution,[],[f112,f81]) ).
fof(f81,plain,
! [X0,X1] :
( in(ordered_pair(sK6(X0,X1),sK7(X0,X1)),X0)
| is_transitive_in(X0,X1)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f62]) ).
fof(f112,plain,
( ! [X0,X1] :
( ~ in(ordered_pair(sK6(sK0,X0),X1),sK0)
| ~ in(ordered_pair(X1,sK8(sK0,X0)),sK0)
| is_transitive_in(sK0,X0) )
| ~ spl9_5 ),
inference(subsumption_resolution,[],[f109,f63]) ).
fof(f109,plain,
( ! [X0,X1] :
( ~ in(ordered_pair(sK6(sK0,X0),X1),sK0)
| ~ in(ordered_pair(X1,sK8(sK0,X0)),sK0)
| is_transitive_in(sK0,X0)
| ~ relation(sK0) )
| ~ spl9_5 ),
inference(resolution,[],[f105,f83]) ).
fof(f83,plain,
! [X0,X1] :
( ~ in(ordered_pair(sK6(X0,X1),sK8(X0,X1)),X0)
| is_transitive_in(X0,X1)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f62]) ).
fof(f105,plain,
( ! [X6,X4,X5] :
( in(ordered_pair(X4,X6),sK0)
| ~ in(ordered_pair(X4,X5),sK0)
| ~ in(ordered_pair(X5,X6),sK0) )
| ~ spl9_5 ),
inference(avatar_component_clause,[],[f104]) ).
fof(f106,plain,
( spl9_1
| spl9_5 ),
inference(avatar_split_clause,[],[f64,f104,f85]) ).
fof(f64,plain,
! [X6,X4,X5] :
( in(ordered_pair(X4,X6),sK0)
| ~ in(ordered_pair(X5,X6),sK0)
| ~ in(ordered_pair(X4,X5),sK0)
| transitive(sK0) ),
inference(cnf_transformation,[],[f53]) ).
fof(f102,plain,
( ~ spl9_1
| spl9_4 ),
inference(avatar_split_clause,[],[f65,f99,f85]) ).
fof(f65,plain,
( in(ordered_pair(sK1,sK2),sK0)
| ~ transitive(sK0) ),
inference(cnf_transformation,[],[f53]) ).
fof(f97,plain,
( ~ spl9_1
| spl9_3 ),
inference(avatar_split_clause,[],[f66,f94,f85]) ).
fof(f66,plain,
( in(ordered_pair(sK2,sK3),sK0)
| ~ transitive(sK0) ),
inference(cnf_transformation,[],[f53]) ).
fof(f92,plain,
( ~ spl9_1
| ~ spl9_2 ),
inference(avatar_split_clause,[],[f67,f89,f85]) ).
fof(f67,plain,
( ~ in(ordered_pair(sK1,sK3),sK0)
| ~ transitive(sK0) ),
inference(cnf_transformation,[],[f53]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SEU240+1 : TPTP v8.2.0. Released v3.3.0.
% 0.11/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.12/0.34 % Computer : n008.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sun May 19 17:27:38 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.12/0.34 This is a FOF_THM_RFO_SEQ problem
% 0.12/0.34 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.59/0.76 % (5991)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2995ds/34Mi)
% 0.59/0.76 % (5994)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2995ds/33Mi)
% 0.59/0.76 % (5992)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on theBenchmark for (2995ds/51Mi)
% 0.59/0.76 % (5995)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on theBenchmark for (2995ds/34Mi)
% 0.59/0.76 % (5996)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2995ds/45Mi)
% 0.59/0.76 % (5997)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on theBenchmark for (2995ds/83Mi)
% 0.59/0.76 % (5998)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2995ds/56Mi)
% 0.59/0.76 % (5993)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.59/0.76 % (5994)Refutation not found, incomplete strategy% (5994)------------------------------
% 0.59/0.76 % (5994)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.76 % (5994)Termination reason: Refutation not found, incomplete strategy
% 0.59/0.76
% 0.59/0.76 % (5994)Memory used [KB]: 976
% 0.59/0.76 % (5994)Time elapsed: 0.003 s
% 0.59/0.76 % (5994)Instructions burned: 2 (million)
% 0.59/0.76 % (5994)------------------------------
% 0.59/0.76 % (5994)------------------------------
% 0.59/0.76 % (5996)First to succeed.
% 0.59/0.76 % (5998)Also succeeded, but the first one will report.
% 0.59/0.76 % (5997)Also succeeded, but the first one will report.
% 0.59/0.76 % (5996)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-5990"
% 0.59/0.76 % (5991)Also succeeded, but the first one will report.
% 0.59/0.76 % (5996)Refutation found. Thanks to Tanya!
% 0.59/0.76 % SZS status Theorem for theBenchmark
% 0.59/0.76 % SZS output start Proof for theBenchmark
% See solution above
% 0.59/0.76 % (5996)------------------------------
% 0.59/0.76 % (5996)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.76 % (5996)Termination reason: Refutation
% 0.59/0.76
% 0.59/0.76 % (5996)Memory used [KB]: 1076
% 0.59/0.76 % (5996)Time elapsed: 0.006 s
% 0.59/0.76 % (5996)Instructions burned: 8 (million)
% 0.59/0.76 % (5990)Success in time 0.415 s
% 0.59/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------