TSTP Solution File: SEU376+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SEU376+1 : TPTP v8.1.0. Released v3.3.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 : n010.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:33:30 EDT 2022
% Result : Theorem 2.15s 0.63s
% Output : Refutation 2.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 30
% Number of leaves : 21
% Syntax : Number of formulae : 123 ( 16 unt; 0 def)
% Number of atoms : 606 ( 0 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 767 ( 284 ~; 304 |; 133 &)
% ( 11 <=>; 35 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 15 ( 14 usr; 3 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 3 con; 0-4 aty)
% Number of variables : 227 ( 180 !; 47 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1496,plain,
$false,
inference(avatar_sat_refutation,[],[f1153,f1228,f1495]) ).
fof(f1495,plain,
~ spl28_125,
inference(avatar_contradiction_clause,[],[f1494]) ).
fof(f1494,plain,
( $false
| ~ spl28_125 ),
inference(subsumption_resolution,[],[f1493,f235]) ).
fof(f235,plain,
~ is_often_in(sK9,sK10,sK11),
inference(cnf_transformation,[],[f157]) ).
fof(f157,plain,
( ~ empty_carrier(sK9)
& one_sorted_str(sK9)
& ~ is_often_in(sK9,sK10,sK11)
& is_eventually_in(sK9,sK10,sK11)
& net_str(sK10,sK9)
& directed_relstr(sK10)
& ~ empty_carrier(sK10) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK9,sK10,sK11])],[f129,f156,f155,f154]) ).
fof(f154,plain,
( ? [X0] :
( ~ empty_carrier(X0)
& one_sorted_str(X0)
& ? [X1] :
( ? [X2] :
( ~ is_often_in(X0,X1,X2)
& is_eventually_in(X0,X1,X2) )
& net_str(X1,X0)
& directed_relstr(X1)
& ~ empty_carrier(X1) ) )
=> ( ~ empty_carrier(sK9)
& one_sorted_str(sK9)
& ? [X1] :
( ? [X2] :
( ~ is_often_in(sK9,X1,X2)
& is_eventually_in(sK9,X1,X2) )
& net_str(X1,sK9)
& directed_relstr(X1)
& ~ empty_carrier(X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f155,plain,
( ? [X1] :
( ? [X2] :
( ~ is_often_in(sK9,X1,X2)
& is_eventually_in(sK9,X1,X2) )
& net_str(X1,sK9)
& directed_relstr(X1)
& ~ empty_carrier(X1) )
=> ( ? [X2] :
( ~ is_often_in(sK9,sK10,X2)
& is_eventually_in(sK9,sK10,X2) )
& net_str(sK10,sK9)
& directed_relstr(sK10)
& ~ empty_carrier(sK10) ) ),
introduced(choice_axiom,[]) ).
fof(f156,plain,
( ? [X2] :
( ~ is_often_in(sK9,sK10,X2)
& is_eventually_in(sK9,sK10,X2) )
=> ( ~ is_often_in(sK9,sK10,sK11)
& is_eventually_in(sK9,sK10,sK11) ) ),
introduced(choice_axiom,[]) ).
fof(f129,plain,
? [X0] :
( ~ empty_carrier(X0)
& one_sorted_str(X0)
& ? [X1] :
( ? [X2] :
( ~ is_often_in(X0,X1,X2)
& is_eventually_in(X0,X1,X2) )
& net_str(X1,X0)
& directed_relstr(X1)
& ~ empty_carrier(X1) ) ),
inference(flattening,[],[f128]) ).
fof(f128,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ~ is_often_in(X0,X1,X2)
& is_eventually_in(X0,X1,X2) )
& net_str(X1,X0)
& directed_relstr(X1)
& ~ empty_carrier(X1) )
& one_sorted_str(X0)
& ~ empty_carrier(X0) ),
inference(ennf_transformation,[],[f76]) ).
fof(f76,plain,
~ ! [X0] :
( ( one_sorted_str(X0)
& ~ empty_carrier(X0) )
=> ! [X1] :
( ( net_str(X1,X0)
& directed_relstr(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( is_eventually_in(X0,X1,X2)
=> is_often_in(X0,X1,X2) ) ) ),
inference(pure_predicate_removal,[],[f55]) ).
fof(f55,negated_conjecture,
~ ! [X0] :
( ( one_sorted_str(X0)
& ~ empty_carrier(X0) )
=> ! [X1] :
( ( transitive_relstr(X1)
& net_str(X1,X0)
& directed_relstr(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( is_eventually_in(X0,X1,X2)
=> is_often_in(X0,X1,X2) ) ) ),
inference(negated_conjecture,[],[f54]) ).
fof(f54,conjecture,
! [X0] :
( ( one_sorted_str(X0)
& ~ empty_carrier(X0) )
=> ! [X1] :
( ( transitive_relstr(X1)
& net_str(X1,X0)
& directed_relstr(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( is_eventually_in(X0,X1,X2)
=> is_often_in(X0,X1,X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t28_yellow_6) ).
fof(f1493,plain,
( is_often_in(sK9,sK10,sK11)
| ~ spl28_125 ),
inference(subsumption_resolution,[],[f1492,f236]) ).
fof(f236,plain,
one_sorted_str(sK9),
inference(cnf_transformation,[],[f157]) ).
fof(f1492,plain,
( ~ one_sorted_str(sK9)
| is_often_in(sK9,sK10,sK11)
| ~ spl28_125 ),
inference(subsumption_resolution,[],[f1491,f1333]) ).
fof(f1333,plain,
( element(sK1(sK10,sK13(sK9,sK10,sK11),sK6(sK9,sK10,sK11)),the_carrier(sK10))
| ~ spl28_125 ),
inference(resolution,[],[f1308,f277]) ).
fof(f277,plain,
! [X0,X1] :
( ~ in(X1,X0)
| element(X1,X0) ),
inference(cnf_transformation,[],[f192]) ).
fof(f192,plain,
! [X0,X1] :
( element(X1,X0)
| ~ in(X1,X0) ),
inference(rectify,[],[f127]) ).
fof(f127,plain,
! [X1,X0] :
( element(X0,X1)
| ~ in(X0,X1) ),
inference(ennf_transformation,[],[f53]) ).
fof(f53,axiom,
! [X1,X0] :
( in(X0,X1)
=> element(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_subset) ).
fof(f1308,plain,
( in(sK1(sK10,sK13(sK9,sK10,sK11),sK6(sK9,sK10,sK11)),the_carrier(sK10))
| ~ spl28_125 ),
inference(resolution,[],[f1152,f428]) ).
fof(f428,plain,
element(sK13(sK9,sK10,sK11),the_carrier(sK10)),
inference(subsumption_resolution,[],[f427,f231]) ).
fof(f231,plain,
~ empty_carrier(sK10),
inference(cnf_transformation,[],[f157]) ).
fof(f427,plain,
( empty_carrier(sK10)
| element(sK13(sK9,sK10,sK11),the_carrier(sK10)) ),
inference(subsumption_resolution,[],[f426,f233]) ).
fof(f233,plain,
net_str(sK10,sK9),
inference(cnf_transformation,[],[f157]) ).
fof(f426,plain,
( ~ net_str(sK10,sK9)
| element(sK13(sK9,sK10,sK11),the_carrier(sK10))
| empty_carrier(sK10) ),
inference(subsumption_resolution,[],[f425,f237]) ).
fof(f237,plain,
~ empty_carrier(sK9),
inference(cnf_transformation,[],[f157]) ).
fof(f425,plain,
( empty_carrier(sK9)
| empty_carrier(sK10)
| ~ net_str(sK10,sK9)
| element(sK13(sK9,sK10,sK11),the_carrier(sK10)) ),
inference(subsumption_resolution,[],[f424,f236]) ).
fof(f424,plain,
( ~ one_sorted_str(sK9)
| ~ net_str(sK10,sK9)
| element(sK13(sK9,sK10,sK11),the_carrier(sK10))
| empty_carrier(sK9)
| empty_carrier(sK10) ),
inference(resolution,[],[f248,f234]) ).
fof(f234,plain,
is_eventually_in(sK9,sK10,sK11),
inference(cnf_transformation,[],[f157]) ).
fof(f248,plain,
! [X2,X0,X1] :
( ~ is_eventually_in(X0,X1,X2)
| empty_carrier(X1)
| element(sK13(X0,X1,X2),the_carrier(X1))
| empty_carrier(X0)
| ~ one_sorted_str(X0)
| ~ net_str(X1,X0) ),
inference(cnf_transformation,[],[f166]) ).
fof(f166,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( ( element(sK13(X0,X1,X2),the_carrier(X1))
& ! [X4] :
( in(apply_netmap(X0,X1,X4),X2)
| ~ element(X4,the_carrier(X1))
| ~ related(X1,sK13(X0,X1,X2),X4) ) )
| ~ is_eventually_in(X0,X1,X2) )
& ( is_eventually_in(X0,X1,X2)
| ! [X5] :
( ~ element(X5,the_carrier(X1))
| ( ~ in(apply_netmap(X0,X1,sK14(X0,X1,X2,X5)),X2)
& element(sK14(X0,X1,X2,X5),the_carrier(X1))
& related(X1,X5,sK14(X0,X1,X2,X5)) ) ) ) )
| empty_carrier(X1)
| ~ net_str(X1,X0) )
| ~ one_sorted_str(X0)
| empty_carrier(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK13,sK14])],[f163,f165,f164]) ).
fof(f164,plain,
! [X0,X1,X2] :
( ? [X3] :
( element(X3,the_carrier(X1))
& ! [X4] :
( in(apply_netmap(X0,X1,X4),X2)
| ~ element(X4,the_carrier(X1))
| ~ related(X1,X3,X4) ) )
=> ( element(sK13(X0,X1,X2),the_carrier(X1))
& ! [X4] :
( in(apply_netmap(X0,X1,X4),X2)
| ~ element(X4,the_carrier(X1))
| ~ related(X1,sK13(X0,X1,X2),X4) ) ) ),
introduced(choice_axiom,[]) ).
fof(f165,plain,
! [X0,X1,X2,X5] :
( ? [X6] :
( ~ in(apply_netmap(X0,X1,X6),X2)
& element(X6,the_carrier(X1))
& related(X1,X5,X6) )
=> ( ~ in(apply_netmap(X0,X1,sK14(X0,X1,X2,X5)),X2)
& element(sK14(X0,X1,X2,X5),the_carrier(X1))
& related(X1,X5,sK14(X0,X1,X2,X5)) ) ),
introduced(choice_axiom,[]) ).
fof(f163,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( ? [X3] :
( element(X3,the_carrier(X1))
& ! [X4] :
( in(apply_netmap(X0,X1,X4),X2)
| ~ element(X4,the_carrier(X1))
| ~ related(X1,X3,X4) ) )
| ~ is_eventually_in(X0,X1,X2) )
& ( is_eventually_in(X0,X1,X2)
| ! [X5] :
( ~ element(X5,the_carrier(X1))
| ? [X6] :
( ~ in(apply_netmap(X0,X1,X6),X2)
& element(X6,the_carrier(X1))
& related(X1,X5,X6) ) ) ) )
| empty_carrier(X1)
| ~ net_str(X1,X0) )
| ~ one_sorted_str(X0)
| empty_carrier(X0) ),
inference(rectify,[],[f162]) ).
fof(f162,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( ? [X3] :
( element(X3,the_carrier(X1))
& ! [X4] :
( in(apply_netmap(X0,X1,X4),X2)
| ~ element(X4,the_carrier(X1))
| ~ related(X1,X3,X4) ) )
| ~ is_eventually_in(X0,X1,X2) )
& ( is_eventually_in(X0,X1,X2)
| ! [X3] :
( ~ element(X3,the_carrier(X1))
| ? [X4] :
( ~ in(apply_netmap(X0,X1,X4),X2)
& element(X4,the_carrier(X1))
& related(X1,X3,X4) ) ) ) )
| empty_carrier(X1)
| ~ net_str(X1,X0) )
| ~ one_sorted_str(X0)
| empty_carrier(X0) ),
inference(nnf_transformation,[],[f125]) ).
fof(f125,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ? [X3] :
( element(X3,the_carrier(X1))
& ! [X4] :
( in(apply_netmap(X0,X1,X4),X2)
| ~ element(X4,the_carrier(X1))
| ~ related(X1,X3,X4) ) )
<=> is_eventually_in(X0,X1,X2) )
| empty_carrier(X1)
| ~ net_str(X1,X0) )
| ~ one_sorted_str(X0)
| empty_carrier(X0) ),
inference(flattening,[],[f124]) ).
fof(f124,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( is_eventually_in(X0,X1,X2)
<=> ? [X3] :
( element(X3,the_carrier(X1))
& ! [X4] :
( in(apply_netmap(X0,X1,X4),X2)
| ~ related(X1,X3,X4)
| ~ element(X4,the_carrier(X1)) ) ) )
| empty_carrier(X1)
| ~ net_str(X1,X0) )
| ~ one_sorted_str(X0)
| empty_carrier(X0) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,axiom,
! [X0] :
( ( one_sorted_str(X0)
& ~ empty_carrier(X0) )
=> ! [X1] :
( ( ~ empty_carrier(X1)
& net_str(X1,X0) )
=> ! [X2] :
( is_eventually_in(X0,X1,X2)
<=> ? [X3] :
( element(X3,the_carrier(X1))
& ! [X4] :
( element(X4,the_carrier(X1))
=> ( related(X1,X3,X4)
=> in(apply_netmap(X0,X1,X4),X2) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d11_waybel_0) ).
fof(f1152,plain,
( ! [X2] :
( ~ element(X2,the_carrier(sK10))
| in(sK1(sK10,X2,sK6(sK9,sK10,sK11)),the_carrier(sK10)) )
| ~ spl28_125 ),
inference(avatar_component_clause,[],[f1151]) ).
fof(f1151,plain,
( spl28_125
<=> ! [X2] :
( ~ element(X2,the_carrier(sK10))
| in(sK1(sK10,X2,sK6(sK9,sK10,sK11)),the_carrier(sK10)) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl28_125])]) ).
fof(f1491,plain,
( ~ element(sK1(sK10,sK13(sK9,sK10,sK11),sK6(sK9,sK10,sK11)),the_carrier(sK10))
| is_often_in(sK9,sK10,sK11)
| ~ one_sorted_str(sK9)
| ~ spl28_125 ),
inference(subsumption_resolution,[],[f1490,f233]) ).
fof(f1490,plain,
( ~ net_str(sK10,sK9)
| ~ element(sK1(sK10,sK13(sK9,sK10,sK11),sK6(sK9,sK10,sK11)),the_carrier(sK10))
| is_often_in(sK9,sK10,sK11)
| ~ one_sorted_str(sK9)
| ~ spl28_125 ),
inference(subsumption_resolution,[],[f1489,f1420]) ).
fof(f1420,plain,
( in(apply_netmap(sK9,sK10,sK1(sK10,sK13(sK9,sK10,sK11),sK6(sK9,sK10,sK11))),sK11)
| ~ spl28_125 ),
inference(subsumption_resolution,[],[f1419,f236]) ).
fof(f1419,plain,
( ~ one_sorted_str(sK9)
| in(apply_netmap(sK9,sK10,sK1(sK10,sK13(sK9,sK10,sK11),sK6(sK9,sK10,sK11))),sK11)
| ~ spl28_125 ),
inference(subsumption_resolution,[],[f1418,f234]) ).
fof(f1418,plain,
( in(apply_netmap(sK9,sK10,sK1(sK10,sK13(sK9,sK10,sK11),sK6(sK9,sK10,sK11))),sK11)
| ~ is_eventually_in(sK9,sK10,sK11)
| ~ one_sorted_str(sK9)
| ~ spl28_125 ),
inference(subsumption_resolution,[],[f1417,f233]) ).
fof(f1417,plain,
( ~ net_str(sK10,sK9)
| ~ is_eventually_in(sK9,sK10,sK11)
| ~ one_sorted_str(sK9)
| in(apply_netmap(sK9,sK10,sK1(sK10,sK13(sK9,sK10,sK11),sK6(sK9,sK10,sK11))),sK11)
| ~ spl28_125 ),
inference(subsumption_resolution,[],[f1416,f237]) ).
fof(f1416,plain,
( empty_carrier(sK9)
| in(apply_netmap(sK9,sK10,sK1(sK10,sK13(sK9,sK10,sK11),sK6(sK9,sK10,sK11))),sK11)
| ~ net_str(sK10,sK9)
| ~ is_eventually_in(sK9,sK10,sK11)
| ~ one_sorted_str(sK9)
| ~ spl28_125 ),
inference(subsumption_resolution,[],[f1415,f231]) ).
fof(f1415,plain,
( in(apply_netmap(sK9,sK10,sK1(sK10,sK13(sK9,sK10,sK11),sK6(sK9,sK10,sK11))),sK11)
| empty_carrier(sK10)
| ~ net_str(sK10,sK9)
| ~ one_sorted_str(sK9)
| empty_carrier(sK9)
| ~ is_eventually_in(sK9,sK10,sK11)
| ~ spl28_125 ),
inference(subsumption_resolution,[],[f1414,f1333]) ).
fof(f1414,plain,
( in(apply_netmap(sK9,sK10,sK1(sK10,sK13(sK9,sK10,sK11),sK6(sK9,sK10,sK11))),sK11)
| ~ element(sK1(sK10,sK13(sK9,sK10,sK11),sK6(sK9,sK10,sK11)),the_carrier(sK10))
| ~ is_eventually_in(sK9,sK10,sK11)
| empty_carrier(sK10)
| ~ one_sorted_str(sK9)
| ~ net_str(sK10,sK9)
| empty_carrier(sK9) ),
inference(resolution,[],[f910,f247]) ).
fof(f247,plain,
! [X2,X0,X1,X4] :
( ~ related(X1,sK13(X0,X1,X2),X4)
| empty_carrier(X0)
| ~ is_eventually_in(X0,X1,X2)
| ~ one_sorted_str(X0)
| ~ net_str(X1,X0)
| ~ element(X4,the_carrier(X1))
| empty_carrier(X1)
| in(apply_netmap(X0,X1,X4),X2) ),
inference(cnf_transformation,[],[f166]) ).
fof(f910,plain,
related(sK10,sK13(sK9,sK10,sK11),sK1(sK10,sK13(sK9,sK10,sK11),sK6(sK9,sK10,sK11))),
inference(resolution,[],[f610,f428]) ).
fof(f610,plain,
! [X0] :
( ~ element(X0,the_carrier(sK10))
| related(sK10,X0,sK1(sK10,X0,sK6(sK9,sK10,sK11))) ),
inference(subsumption_resolution,[],[f609,f319]) ).
fof(f319,plain,
rel_str(sK10),
inference(subsumption_resolution,[],[f316,f236]) ).
fof(f316,plain,
( ~ one_sorted_str(sK9)
| rel_str(sK10) ),
inference(resolution,[],[f283,f233]) ).
fof(f283,plain,
! [X0,X1] :
( ~ net_str(X1,X0)
| rel_str(X1)
| ~ one_sorted_str(X0) ),
inference(cnf_transformation,[],[f107]) ).
fof(f107,plain,
! [X0] :
( ~ one_sorted_str(X0)
| ! [X1] :
( rel_str(X1)
| ~ net_str(X1,X0) ) ),
inference(ennf_transformation,[],[f20]) ).
fof(f20,axiom,
! [X0] :
( one_sorted_str(X0)
=> ! [X1] :
( net_str(X1,X0)
=> rel_str(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_l1_waybel_0) ).
fof(f609,plain,
! [X0] :
( ~ rel_str(sK10)
| related(sK10,X0,sK1(sK10,X0,sK6(sK9,sK10,sK11)))
| ~ element(X0,the_carrier(sK10)) ),
inference(subsumption_resolution,[],[f608,f232]) ).
fof(f232,plain,
directed_relstr(sK10),
inference(cnf_transformation,[],[f157]) ).
fof(f608,plain,
! [X0] :
( related(sK10,X0,sK1(sK10,X0,sK6(sK9,sK10,sK11)))
| ~ directed_relstr(sK10)
| ~ element(X0,the_carrier(sK10))
| ~ rel_str(sK10) ),
inference(subsumption_resolution,[],[f602,f231]) ).
fof(f602,plain,
! [X0] :
( empty_carrier(sK10)
| ~ rel_str(sK10)
| ~ directed_relstr(sK10)
| related(sK10,X0,sK1(sK10,X0,sK6(sK9,sK10,sK11)))
| ~ element(X0,the_carrier(sK10)) ),
inference(resolution,[],[f213,f381]) ).
fof(f381,plain,
element(sK6(sK9,sK10,sK11),the_carrier(sK10)),
inference(subsumption_resolution,[],[f380,f233]) ).
fof(f380,plain,
( ~ net_str(sK10,sK9)
| element(sK6(sK9,sK10,sK11),the_carrier(sK10)) ),
inference(subsumption_resolution,[],[f379,f237]) ).
fof(f379,plain,
( empty_carrier(sK9)
| ~ net_str(sK10,sK9)
| element(sK6(sK9,sK10,sK11),the_carrier(sK10)) ),
inference(subsumption_resolution,[],[f378,f231]) ).
fof(f378,plain,
( empty_carrier(sK10)
| empty_carrier(sK9)
| element(sK6(sK9,sK10,sK11),the_carrier(sK10))
| ~ net_str(sK10,sK9) ),
inference(subsumption_resolution,[],[f377,f236]) ).
fof(f377,plain,
( ~ one_sorted_str(sK9)
| ~ net_str(sK10,sK9)
| element(sK6(sK9,sK10,sK11),the_carrier(sK10))
| empty_carrier(sK9)
| empty_carrier(sK10) ),
inference(resolution,[],[f218,f235]) ).
fof(f218,plain,
! [X2,X0,X1] :
( is_often_in(X0,X1,X2)
| ~ net_str(X1,X0)
| empty_carrier(X1)
| empty_carrier(X0)
| ~ one_sorted_str(X0)
| element(sK6(X0,X1,X2),the_carrier(X1)) ),
inference(cnf_transformation,[],[f146]) ).
fof(f146,plain,
! [X0] :
( ~ one_sorted_str(X0)
| ! [X1] :
( empty_carrier(X1)
| ~ net_str(X1,X0)
| ! [X2] :
( ( ! [X3] :
( ~ element(X3,the_carrier(X1))
| ( in(apply_netmap(X0,X1,sK5(X0,X1,X2,X3)),X2)
& related(X1,X3,sK5(X0,X1,X2,X3))
& element(sK5(X0,X1,X2,X3),the_carrier(X1)) ) )
| ~ is_often_in(X0,X1,X2) )
& ( is_often_in(X0,X1,X2)
| ( element(sK6(X0,X1,X2),the_carrier(X1))
& ! [X6] :
( ~ in(apply_netmap(X0,X1,X6),X2)
| ~ related(X1,sK6(X0,X1,X2),X6)
| ~ element(X6,the_carrier(X1)) ) ) ) ) )
| empty_carrier(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6])],[f143,f145,f144]) ).
fof(f144,plain,
! [X0,X1,X2,X3] :
( ? [X4] :
( in(apply_netmap(X0,X1,X4),X2)
& related(X1,X3,X4)
& element(X4,the_carrier(X1)) )
=> ( in(apply_netmap(X0,X1,sK5(X0,X1,X2,X3)),X2)
& related(X1,X3,sK5(X0,X1,X2,X3))
& element(sK5(X0,X1,X2,X3),the_carrier(X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f145,plain,
! [X0,X1,X2] :
( ? [X5] :
( element(X5,the_carrier(X1))
& ! [X6] :
( ~ in(apply_netmap(X0,X1,X6),X2)
| ~ related(X1,X5,X6)
| ~ element(X6,the_carrier(X1)) ) )
=> ( element(sK6(X0,X1,X2),the_carrier(X1))
& ! [X6] :
( ~ in(apply_netmap(X0,X1,X6),X2)
| ~ related(X1,sK6(X0,X1,X2),X6)
| ~ element(X6,the_carrier(X1)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f143,plain,
! [X0] :
( ~ one_sorted_str(X0)
| ! [X1] :
( empty_carrier(X1)
| ~ net_str(X1,X0)
| ! [X2] :
( ( ! [X3] :
( ~ element(X3,the_carrier(X1))
| ? [X4] :
( in(apply_netmap(X0,X1,X4),X2)
& related(X1,X3,X4)
& element(X4,the_carrier(X1)) ) )
| ~ is_often_in(X0,X1,X2) )
& ( is_often_in(X0,X1,X2)
| ? [X5] :
( element(X5,the_carrier(X1))
& ! [X6] :
( ~ in(apply_netmap(X0,X1,X6),X2)
| ~ related(X1,X5,X6)
| ~ element(X6,the_carrier(X1)) ) ) ) ) )
| empty_carrier(X0) ),
inference(rectify,[],[f142]) ).
fof(f142,plain,
! [X0] :
( ~ one_sorted_str(X0)
| ! [X1] :
( empty_carrier(X1)
| ~ net_str(X1,X0)
| ! [X2] :
( ( ! [X3] :
( ~ element(X3,the_carrier(X1))
| ? [X4] :
( in(apply_netmap(X0,X1,X4),X2)
& related(X1,X3,X4)
& element(X4,the_carrier(X1)) ) )
| ~ is_often_in(X0,X1,X2) )
& ( is_often_in(X0,X1,X2)
| ? [X3] :
( element(X3,the_carrier(X1))
& ! [X4] :
( ~ in(apply_netmap(X0,X1,X4),X2)
| ~ related(X1,X3,X4)
| ~ element(X4,the_carrier(X1)) ) ) ) ) )
| empty_carrier(X0) ),
inference(nnf_transformation,[],[f123]) ).
fof(f123,plain,
! [X0] :
( ~ one_sorted_str(X0)
| ! [X1] :
( empty_carrier(X1)
| ~ net_str(X1,X0)
| ! [X2] :
( ! [X3] :
( ~ element(X3,the_carrier(X1))
| ? [X4] :
( in(apply_netmap(X0,X1,X4),X2)
& related(X1,X3,X4)
& element(X4,the_carrier(X1)) ) )
<=> is_often_in(X0,X1,X2) ) )
| empty_carrier(X0) ),
inference(flattening,[],[f122]) ).
fof(f122,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ! [X3] :
( ~ element(X3,the_carrier(X1))
| ? [X4] :
( in(apply_netmap(X0,X1,X4),X2)
& related(X1,X3,X4)
& element(X4,the_carrier(X1)) ) )
<=> is_often_in(X0,X1,X2) )
| empty_carrier(X1)
| ~ net_str(X1,X0) )
| ~ one_sorted_str(X0)
| empty_carrier(X0) ),
inference(ennf_transformation,[],[f9]) ).
fof(f9,axiom,
! [X0] :
( ( one_sorted_str(X0)
& ~ empty_carrier(X0) )
=> ! [X1] :
( ( ~ empty_carrier(X1)
& net_str(X1,X0) )
=> ! [X2] :
( is_often_in(X0,X1,X2)
<=> ! [X3] :
( element(X3,the_carrier(X1))
=> ? [X4] :
( in(apply_netmap(X0,X1,X4),X2)
& related(X1,X3,X4)
& element(X4,the_carrier(X1)) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d12_waybel_0) ).
fof(f213,plain,
! [X2,X0,X1] :
( ~ element(X2,the_carrier(X0))
| ~ rel_str(X0)
| empty_carrier(X0)
| related(X0,X1,sK1(X0,X1,X2))
| ~ element(X1,the_carrier(X0))
| ~ directed_relstr(X0) ),
inference(cnf_transformation,[],[f139]) ).
fof(f139,plain,
! [X0] :
( ( ( ! [X1] :
( ! [X2] :
( ~ element(X2,the_carrier(X0))
| ( related(X0,X1,sK1(X0,X1,X2))
& element(sK1(X0,X1,X2),the_carrier(X0))
& related(X0,X2,sK1(X0,X1,X2)) ) )
| ~ element(X1,the_carrier(X0)) )
| ~ directed_relstr(X0) )
& ( directed_relstr(X0)
| ( element(sK3(X0),the_carrier(X0))
& ! [X6] :
( ~ related(X0,sK2(X0),X6)
| ~ element(X6,the_carrier(X0))
| ~ related(X0,sK3(X0),X6) )
& element(sK2(X0),the_carrier(X0)) ) ) )
| empty_carrier(X0)
| ~ rel_str(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f135,f138,f137,f136]) ).
fof(f136,plain,
! [X0,X1,X2] :
( ? [X3] :
( related(X0,X1,X3)
& element(X3,the_carrier(X0))
& related(X0,X2,X3) )
=> ( related(X0,X1,sK1(X0,X1,X2))
& element(sK1(X0,X1,X2),the_carrier(X0))
& related(X0,X2,sK1(X0,X1,X2)) ) ),
introduced(choice_axiom,[]) ).
fof(f137,plain,
! [X0] :
( ? [X4] :
( ? [X5] :
( element(X5,the_carrier(X0))
& ! [X6] :
( ~ related(X0,X4,X6)
| ~ element(X6,the_carrier(X0))
| ~ related(X0,X5,X6) ) )
& element(X4,the_carrier(X0)) )
=> ( ? [X5] :
( element(X5,the_carrier(X0))
& ! [X6] :
( ~ related(X0,sK2(X0),X6)
| ~ element(X6,the_carrier(X0))
| ~ related(X0,X5,X6) ) )
& element(sK2(X0),the_carrier(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f138,plain,
! [X0] :
( ? [X5] :
( element(X5,the_carrier(X0))
& ! [X6] :
( ~ related(X0,sK2(X0),X6)
| ~ element(X6,the_carrier(X0))
| ~ related(X0,X5,X6) ) )
=> ( element(sK3(X0),the_carrier(X0))
& ! [X6] :
( ~ related(X0,sK2(X0),X6)
| ~ element(X6,the_carrier(X0))
| ~ related(X0,sK3(X0),X6) ) ) ),
introduced(choice_axiom,[]) ).
fof(f135,plain,
! [X0] :
( ( ( ! [X1] :
( ! [X2] :
( ~ element(X2,the_carrier(X0))
| ? [X3] :
( related(X0,X1,X3)
& element(X3,the_carrier(X0))
& related(X0,X2,X3) ) )
| ~ element(X1,the_carrier(X0)) )
| ~ directed_relstr(X0) )
& ( directed_relstr(X0)
| ? [X4] :
( ? [X5] :
( element(X5,the_carrier(X0))
& ! [X6] :
( ~ related(X0,X4,X6)
| ~ element(X6,the_carrier(X0))
| ~ related(X0,X5,X6) ) )
& element(X4,the_carrier(X0)) ) ) )
| empty_carrier(X0)
| ~ rel_str(X0) ),
inference(rectify,[],[f134]) ).
fof(f134,plain,
! [X0] :
( ( ( ! [X1] :
( ! [X2] :
( ~ element(X2,the_carrier(X0))
| ? [X3] :
( related(X0,X1,X3)
& element(X3,the_carrier(X0))
& related(X0,X2,X3) ) )
| ~ element(X1,the_carrier(X0)) )
| ~ directed_relstr(X0) )
& ( directed_relstr(X0)
| ? [X1] :
( ? [X2] :
( element(X2,the_carrier(X0))
& ! [X3] :
( ~ related(X0,X1,X3)
| ~ element(X3,the_carrier(X0))
| ~ related(X0,X2,X3) ) )
& element(X1,the_carrier(X0)) ) ) )
| empty_carrier(X0)
| ~ rel_str(X0) ),
inference(nnf_transformation,[],[f117]) ).
fof(f117,plain,
! [X0] :
( ( ! [X1] :
( ! [X2] :
( ~ element(X2,the_carrier(X0))
| ? [X3] :
( related(X0,X1,X3)
& element(X3,the_carrier(X0))
& related(X0,X2,X3) ) )
| ~ element(X1,the_carrier(X0)) )
<=> directed_relstr(X0) )
| empty_carrier(X0)
| ~ rel_str(X0) ),
inference(flattening,[],[f116]) ).
fof(f116,plain,
! [X0] :
( ( ! [X1] :
( ! [X2] :
( ~ element(X2,the_carrier(X0))
| ? [X3] :
( related(X0,X1,X3)
& element(X3,the_carrier(X0))
& related(X0,X2,X3) ) )
| ~ element(X1,the_carrier(X0)) )
<=> directed_relstr(X0) )
| empty_carrier(X0)
| ~ rel_str(X0) ),
inference(ennf_transformation,[],[f10]) ).
fof(f10,axiom,
! [X0] :
( ( ~ empty_carrier(X0)
& rel_str(X0) )
=> ( directed_relstr(X0)
<=> ! [X1] :
( element(X1,the_carrier(X0))
=> ! [X2] :
( element(X2,the_carrier(X0))
=> ? [X3] :
( related(X0,X1,X3)
& element(X3,the_carrier(X0))
& related(X0,X2,X3) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_yellow_6) ).
fof(f1489,plain,
( ~ in(apply_netmap(sK9,sK10,sK1(sK10,sK13(sK9,sK10,sK11),sK6(sK9,sK10,sK11))),sK11)
| is_often_in(sK9,sK10,sK11)
| ~ net_str(sK10,sK9)
| ~ element(sK1(sK10,sK13(sK9,sK10,sK11),sK6(sK9,sK10,sK11)),the_carrier(sK10))
| ~ one_sorted_str(sK9) ),
inference(subsumption_resolution,[],[f1488,f237]) ).
fof(f1488,plain,
( empty_carrier(sK9)
| ~ in(apply_netmap(sK9,sK10,sK1(sK10,sK13(sK9,sK10,sK11),sK6(sK9,sK10,sK11))),sK11)
| ~ element(sK1(sK10,sK13(sK9,sK10,sK11),sK6(sK9,sK10,sK11)),the_carrier(sK10))
| ~ net_str(sK10,sK9)
| is_often_in(sK9,sK10,sK11)
| ~ one_sorted_str(sK9) ),
inference(subsumption_resolution,[],[f1487,f231]) ).
fof(f1487,plain,
( empty_carrier(sK10)
| ~ in(apply_netmap(sK9,sK10,sK1(sK10,sK13(sK9,sK10,sK11),sK6(sK9,sK10,sK11))),sK11)
| ~ one_sorted_str(sK9)
| ~ element(sK1(sK10,sK13(sK9,sK10,sK11),sK6(sK9,sK10,sK11)),the_carrier(sK10))
| ~ net_str(sK10,sK9)
| empty_carrier(sK9)
| is_often_in(sK9,sK10,sK11) ),
inference(resolution,[],[f1478,f217]) ).
fof(f217,plain,
! [X2,X0,X1,X6] :
( ~ related(X1,sK6(X0,X1,X2),X6)
| ~ one_sorted_str(X0)
| empty_carrier(X0)
| ~ in(apply_netmap(X0,X1,X6),X2)
| ~ element(X6,the_carrier(X1))
| ~ net_str(X1,X0)
| is_often_in(X0,X1,X2)
| empty_carrier(X1) ),
inference(cnf_transformation,[],[f146]) ).
fof(f1478,plain,
related(sK10,sK6(sK9,sK10,sK11),sK1(sK10,sK13(sK9,sK10,sK11),sK6(sK9,sK10,sK11))),
inference(resolution,[],[f523,f428]) ).
fof(f523,plain,
! [X0] :
( ~ element(X0,the_carrier(sK10))
| related(sK10,sK6(sK9,sK10,sK11),sK1(sK10,X0,sK6(sK9,sK10,sK11))) ),
inference(subsumption_resolution,[],[f522,f231]) ).
fof(f522,plain,
! [X0] :
( ~ element(X0,the_carrier(sK10))
| empty_carrier(sK10)
| related(sK10,sK6(sK9,sK10,sK11),sK1(sK10,X0,sK6(sK9,sK10,sK11))) ),
inference(subsumption_resolution,[],[f521,f232]) ).
fof(f521,plain,
! [X0] :
( ~ element(X0,the_carrier(sK10))
| ~ directed_relstr(sK10)
| empty_carrier(sK10)
| related(sK10,sK6(sK9,sK10,sK11),sK1(sK10,X0,sK6(sK9,sK10,sK11))) ),
inference(subsumption_resolution,[],[f520,f319]) ).
fof(f520,plain,
! [X0] :
( related(sK10,sK6(sK9,sK10,sK11),sK1(sK10,X0,sK6(sK9,sK10,sK11)))
| ~ element(X0,the_carrier(sK10))
| ~ rel_str(sK10)
| empty_carrier(sK10)
| ~ directed_relstr(sK10) ),
inference(resolution,[],[f381,f211]) ).
fof(f211,plain,
! [X2,X0,X1] :
( ~ element(X2,the_carrier(X0))
| ~ directed_relstr(X0)
| empty_carrier(X0)
| ~ element(X1,the_carrier(X0))
| ~ rel_str(X0)
| related(X0,X2,sK1(X0,X1,X2)) ),
inference(cnf_transformation,[],[f139]) ).
fof(f1228,plain,
~ spl28_124,
inference(avatar_contradiction_clause,[],[f1227]) ).
fof(f1227,plain,
( $false
| ~ spl28_124 ),
inference(subsumption_resolution,[],[f1226,f335]) ).
fof(f335,plain,
one_sorted_str(sK10),
inference(resolution,[],[f319,f207]) ).
fof(f207,plain,
! [X0] :
( ~ rel_str(X0)
| one_sorted_str(X0) ),
inference(cnf_transformation,[],[f110]) ).
fof(f110,plain,
! [X0] :
( one_sorted_str(X0)
| ~ rel_str(X0) ),
inference(ennf_transformation,[],[f18]) ).
fof(f18,axiom,
! [X0] :
( rel_str(X0)
=> one_sorted_str(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_l1_orders_2) ).
fof(f1226,plain,
( ~ one_sorted_str(sK10)
| ~ spl28_124 ),
inference(subsumption_resolution,[],[f1174,f231]) ).
fof(f1174,plain,
( empty_carrier(sK10)
| ~ one_sorted_str(sK10)
| ~ spl28_124 ),
inference(resolution,[],[f1149,f259]) ).
fof(f259,plain,
! [X0] :
( ~ empty(the_carrier(X0))
| empty_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(cnf_transformation,[],[f112]) ).
fof(f112,plain,
! [X0] :
( ~ empty(the_carrier(X0))
| ~ one_sorted_str(X0)
| empty_carrier(X0) ),
inference(flattening,[],[f111]) ).
fof(f111,plain,
! [X0] :
( ~ empty(the_carrier(X0))
| ~ one_sorted_str(X0)
| empty_carrier(X0) ),
inference(ennf_transformation,[],[f34]) ).
fof(f34,axiom,
! [X0] :
( ( one_sorted_str(X0)
& ~ empty_carrier(X0) )
=> ~ empty(the_carrier(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc1_struct_0) ).
fof(f1149,plain,
( empty(the_carrier(sK10))
| ~ spl28_124 ),
inference(avatar_component_clause,[],[f1147]) ).
fof(f1147,plain,
( spl28_124
<=> empty(the_carrier(sK10)) ),
introduced(avatar_definition,[new_symbols(naming,[spl28_124])]) ).
fof(f1153,plain,
( spl28_124
| spl28_125 ),
inference(avatar_split_clause,[],[f1141,f1151,f1147]) ).
fof(f1141,plain,
! [X2] :
( ~ element(X2,the_carrier(sK10))
| empty(the_carrier(sK10))
| in(sK1(sK10,X2,sK6(sK9,sK10,sK11)),the_carrier(sK10)) ),
inference(resolution,[],[f264,f579]) ).
fof(f579,plain,
! [X0] :
( element(sK1(sK10,X0,sK6(sK9,sK10,sK11)),the_carrier(sK10))
| ~ element(X0,the_carrier(sK10)) ),
inference(subsumption_resolution,[],[f578,f231]) ).
fof(f578,plain,
! [X0] :
( ~ element(X0,the_carrier(sK10))
| empty_carrier(sK10)
| element(sK1(sK10,X0,sK6(sK9,sK10,sK11)),the_carrier(sK10)) ),
inference(subsumption_resolution,[],[f577,f232]) ).
fof(f577,plain,
! [X0] :
( ~ element(X0,the_carrier(sK10))
| element(sK1(sK10,X0,sK6(sK9,sK10,sK11)),the_carrier(sK10))
| ~ directed_relstr(sK10)
| empty_carrier(sK10) ),
inference(subsumption_resolution,[],[f571,f319]) ).
fof(f571,plain,
! [X0] :
( ~ element(X0,the_carrier(sK10))
| ~ rel_str(sK10)
| ~ directed_relstr(sK10)
| empty_carrier(sK10)
| element(sK1(sK10,X0,sK6(sK9,sK10,sK11)),the_carrier(sK10)) ),
inference(resolution,[],[f212,f381]) ).
fof(f212,plain,
! [X2,X0,X1] :
( ~ element(X2,the_carrier(X0))
| ~ directed_relstr(X0)
| empty_carrier(X0)
| ~ rel_str(X0)
| ~ element(X1,the_carrier(X0))
| element(sK1(X0,X1,X2),the_carrier(X0)) ),
inference(cnf_transformation,[],[f139]) ).
fof(f264,plain,
! [X0,X1] :
( ~ element(X1,X0)
| in(X1,X0)
| empty(X0) ),
inference(cnf_transformation,[],[f180]) ).
fof(f180,plain,
! [X0,X1] :
( ~ element(X1,X0)
| empty(X0)
| in(X1,X0) ),
inference(rectify,[],[f95]) ).
fof(f95,plain,
! [X1,X0] :
( ~ element(X0,X1)
| empty(X1)
| in(X0,X1) ),
inference(flattening,[],[f94]) ).
fof(f94,plain,
! [X0,X1] :
( in(X0,X1)
| empty(X1)
| ~ element(X0,X1) ),
inference(ennf_transformation,[],[f56]) ).
fof(f56,axiom,
! [X0,X1] :
( element(X0,X1)
=> ( in(X0,X1)
| empty(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_subset) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU376+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.34 % Computer : n010.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 30 15:14:29 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.50 % (9086)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.20/0.50 TRYING [1]
% 0.20/0.50 % (9090)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.50 % (9093)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.51 % (9101)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.20/0.51 TRYING [2]
% 0.20/0.51 % (9093)Instruction limit reached!
% 0.20/0.51 % (9093)------------------------------
% 0.20/0.51 % (9093)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51 % (9095)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)
% 1.28/0.52 % (9109)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)
% 1.28/0.52 % (9113)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)
% 1.28/0.52 % (9108)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)
% 1.28/0.52 % (9112)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)
% 1.28/0.52 TRYING [3]
% 1.28/0.52 % (9089)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)
% 1.28/0.52 % (9093)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.28/0.52 % (9093)Termination reason: Unknown
% 1.28/0.52 % (9093)Termination phase: Saturation
% 1.28/0.52
% 1.28/0.52 % (9093)Memory used [KB]: 5628
% 1.28/0.52 % (9093)Time elapsed: 0.108 s
% 1.28/0.52 % (9093)Instructions burned: 8 (million)
% 1.28/0.52 % (9093)------------------------------
% 1.28/0.52 % (9093)------------------------------
% 1.28/0.53 % (9103)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 1.28/0.53 % (9100)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)
% 1.28/0.53 % (9088)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)
% 1.28/0.53 % (9091)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)
% 1.28/0.53 % (9087)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)
% 1.28/0.53 % (9099)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 1.44/0.53 % (9114)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 1.44/0.53 % (9105)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)
% 1.44/0.54 % (9092)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)
% 1.44/0.54 % (9104)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 1.44/0.54 % (9110)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 1.44/0.54 % (9097)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)
% 1.44/0.54 % (9106)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)
% 1.44/0.54 TRYING [1]
% 1.44/0.54 % (9115)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)
% 1.44/0.54 % (9111)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 1.44/0.54 % (9096)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 1.44/0.54 % (9094)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.44/0.55 % (9098)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 1.44/0.55 % (9107)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 1.44/0.55 TRYING [1]
% 1.44/0.55 % (9102)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.44/0.55 TRYING [2]
% 1.44/0.55 % (9087)Refutation not found, incomplete strategy% (9087)------------------------------
% 1.44/0.55 % (9087)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.44/0.55 % (9087)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.44/0.55 % (9087)Termination reason: Refutation not found, incomplete strategy
% 1.44/0.55
% 1.44/0.55 % (9087)Memory used [KB]: 5628
% 1.44/0.55 % (9087)Time elapsed: 0.155 s
% 1.44/0.55 % (9087)Instructions burned: 6 (million)
% 1.44/0.55 % (9087)------------------------------
% 1.44/0.55 % (9087)------------------------------
% 1.44/0.56 % (9094)Instruction limit reached!
% 1.44/0.56 % (9094)------------------------------
% 1.44/0.56 % (9094)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.44/0.56 % (9094)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.44/0.56 % (9094)Termination reason: Unknown
% 1.44/0.56 % (9094)Termination phase: Preprocessing 3
% 1.44/0.56
% 1.44/0.56 % (9094)Memory used [KB]: 1023
% 1.44/0.56 % (9094)Time elapsed: 0.002 s
% 1.44/0.56 % (9094)Instructions burned: 3 (million)
% 1.44/0.56 % (9094)------------------------------
% 1.44/0.56 % (9094)------------------------------
% 1.44/0.56 TRYING [2]
% 1.44/0.59 % (9088)Instruction limit reached!
% 1.44/0.59 % (9088)------------------------------
% 1.44/0.59 % (9088)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.44/0.59 % (9088)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.44/0.59 % (9088)Termination reason: Unknown
% 1.44/0.59 % (9088)Termination phase: Saturation
% 1.44/0.59
% 1.44/0.59 % (9088)Memory used [KB]: 1791
% 1.44/0.59 % (9088)Time elapsed: 0.191 s
% 1.44/0.59 % (9088)Instructions burned: 37 (million)
% 1.44/0.59 % (9088)------------------------------
% 1.44/0.59 % (9088)------------------------------
% 1.44/0.59 TRYING [3]
% 1.44/0.59 TRYING [3]
% 1.44/0.59 % (9092)Instruction limit reached!
% 1.44/0.59 % (9092)------------------------------
% 1.44/0.59 % (9092)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.44/0.59 % (9092)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.44/0.59 % (9092)Termination reason: Unknown
% 1.44/0.59 % (9092)Termination phase: Finite model building constraint generation
% 1.44/0.59
% 1.44/0.59 % (9092)Memory used [KB]: 8059
% 1.44/0.59 % (9092)Time elapsed: 0.163 s
% 1.44/0.59 % (9092)Instructions burned: 52 (million)
% 1.44/0.59 % (9092)------------------------------
% 1.44/0.59 % (9092)------------------------------
% 1.44/0.61 % (9103)Instruction limit reached!
% 1.44/0.61 % (9103)------------------------------
% 1.44/0.61 % (9103)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.44/0.61 % (9089)Instruction limit reached!
% 1.44/0.61 % (9089)------------------------------
% 1.44/0.61 % (9089)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.44/0.61 % (9089)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.44/0.61 % (9089)Termination reason: Unknown
% 1.44/0.61 % (9089)Termination phase: Saturation
% 1.44/0.61
% 1.44/0.61 % (9089)Memory used [KB]: 6012
% 1.44/0.61 % (9089)Time elapsed: 0.210 s
% 1.44/0.61 % (9089)Instructions burned: 53 (million)
% 1.44/0.61 % (9089)------------------------------
% 1.44/0.61 % (9089)------------------------------
% 1.44/0.61 % (9090)Instruction limit reached!
% 1.44/0.61 % (9090)------------------------------
% 1.44/0.61 % (9090)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.44/0.61 % (9090)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.44/0.61 % (9090)Termination reason: Unknown
% 1.44/0.61 % (9090)Termination phase: Saturation
% 1.44/0.61
% 1.44/0.61 % (9090)Memory used [KB]: 6524
% 1.44/0.61 % (9090)Time elapsed: 0.212 s
% 1.44/0.61 % (9090)Instructions burned: 51 (million)
% 1.44/0.61 % (9090)------------------------------
% 1.44/0.61 % (9090)------------------------------
% 1.44/0.61 % (9091)Instruction limit reached!
% 1.44/0.61 % (9091)------------------------------
% 1.44/0.61 % (9091)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.44/0.61 % (9091)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.44/0.61 % (9091)Termination reason: Unknown
% 1.44/0.61 % (9091)Termination phase: Saturation
% 1.44/0.61
% 1.44/0.61 % (9091)Memory used [KB]: 6140
% 1.44/0.61 % (9091)Time elapsed: 0.212 s
% 1.44/0.61 % (9091)Instructions burned: 48 (million)
% 1.44/0.61 % (9091)------------------------------
% 1.44/0.61 % (9091)------------------------------
% 1.44/0.62 % (9095)Instruction limit reached!
% 1.44/0.62 % (9095)------------------------------
% 1.44/0.62 % (9095)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.44/0.62 % (9103)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.44/0.62 % (9103)Termination reason: Unknown
% 1.44/0.62 % (9103)Termination phase: Finite model building constraint generation
% 1.44/0.62
% 1.44/0.62 % (9103)Memory used [KB]: 8187
% 1.44/0.62 % (9103)Time elapsed: 0.183 s
% 1.44/0.62 % (9103)Instructions burned: 60 (million)
% 1.44/0.62 % (9103)------------------------------
% 1.44/0.62 % (9103)------------------------------
% 1.44/0.62 TRYING [4]
% 1.44/0.62 % (9106)First to succeed.
% 2.15/0.63 % (9106)Refutation found. Thanks to Tanya!
% 2.15/0.63 % SZS status Theorem for theBenchmark
% 2.15/0.63 % SZS output start Proof for theBenchmark
% See solution above
% 2.15/0.63 % (9106)------------------------------
% 2.15/0.63 % (9106)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 2.15/0.63 % (9106)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 2.15/0.63 % (9106)Termination reason: Refutation
% 2.15/0.63
% 2.15/0.63 % (9106)Memory used [KB]: 6524
% 2.15/0.63 % (9106)Time elapsed: 0.212 s
% 2.15/0.63 % (9106)Instructions burned: 43 (million)
% 2.15/0.63 % (9106)------------------------------
% 2.15/0.63 % (9106)------------------------------
% 2.15/0.63 % (9085)Success in time 0.27 s
%------------------------------------------------------------------------------