TSTP Solution File: SEU376+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---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_uns --cores 0 -t %d %s
% Computer : n002.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:29:28 EDT 2022
% Result : Theorem 1.88s 0.61s
% Output : Refutation 1.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 15
% Syntax : Number of formulae : 60 ( 16 unt; 0 def)
% Number of atoms : 399 ( 0 equ)
% Maximal formula atoms : 14 ( 6 avg)
% Number of connectives : 515 ( 176 ~; 167 |; 132 &)
% ( 9 <=>; 31 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 8 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 12 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 3 con; 0-4 aty)
% Number of variables : 187 ( 140 !; 47 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f292,plain,
$false,
inference(subsumption_resolution,[],[f291,f289]) ).
fof(f289,plain,
in(apply_netmap(sK1,sK2,sK12(sK2,sK7(sK1,sK2,sK3),sK6(sK1,sK2,sK3))),sK3),
inference(unit_resulting_resolution,[],[f123,f117,f118,f119,f121,f160,f164,f127]) ).
fof(f127,plain,
! [X2,X0,X1,X6] :
( ~ related(X1,sK6(X0,X1,X2),X6)
| ~ element(X6,the_carrier(X1))
| ~ net_str(X1,X0)
| empty_carrier(X0)
| ~ one_sorted_str(X0)
| empty_carrier(X1)
| ~ is_eventually_in(X0,X1,X2)
| in(apply_netmap(X0,X1,X6),X2) ),
inference(cnf_transformation,[],[f100]) ).
fof(f100,plain,
! [X0] :
( empty_carrier(X0)
| ! [X1] :
( empty_carrier(X1)
| ! [X2] :
( ( is_eventually_in(X0,X1,X2)
| ! [X3] :
( ( ~ 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)) )
| ~ element(X3,the_carrier(X1)) ) )
& ( ( ! [X6] :
( in(apply_netmap(X0,X1,X6),X2)
| ~ related(X1,sK6(X0,X1,X2),X6)
| ~ element(X6,the_carrier(X1)) )
& element(sK6(X0,X1,X2),the_carrier(X1)) )
| ~ is_eventually_in(X0,X1,X2) ) )
| ~ net_str(X1,X0) )
| ~ one_sorted_str(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6])],[f97,f99,f98]) ).
fof(f98,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(f99,plain,
! [X0,X1,X2] :
( ? [X5] :
( ! [X6] :
( in(apply_netmap(X0,X1,X6),X2)
| ~ related(X1,X5,X6)
| ~ element(X6,the_carrier(X1)) )
& element(X5,the_carrier(X1)) )
=> ( ! [X6] :
( in(apply_netmap(X0,X1,X6),X2)
| ~ related(X1,sK6(X0,X1,X2),X6)
| ~ element(X6,the_carrier(X1)) )
& element(sK6(X0,X1,X2),the_carrier(X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f97,plain,
! [X0] :
( empty_carrier(X0)
| ! [X1] :
( empty_carrier(X1)
| ! [X2] :
( ( is_eventually_in(X0,X1,X2)
| ! [X3] :
( ? [X4] :
( ~ in(apply_netmap(X0,X1,X4),X2)
& related(X1,X3,X4)
& element(X4,the_carrier(X1)) )
| ~ element(X3,the_carrier(X1)) ) )
& ( ? [X5] :
( ! [X6] :
( in(apply_netmap(X0,X1,X6),X2)
| ~ related(X1,X5,X6)
| ~ element(X6,the_carrier(X1)) )
& element(X5,the_carrier(X1)) )
| ~ is_eventually_in(X0,X1,X2) ) )
| ~ net_str(X1,X0) )
| ~ one_sorted_str(X0) ),
inference(rectify,[],[f96]) ).
fof(f96,plain,
! [X0] :
( empty_carrier(X0)
| ! [X1] :
( empty_carrier(X1)
| ! [X2] :
( ( is_eventually_in(X0,X1,X2)
| ! [X3] :
( ? [X4] :
( ~ in(apply_netmap(X0,X1,X4),X2)
& related(X1,X3,X4)
& element(X4,the_carrier(X1)) )
| ~ element(X3,the_carrier(X1)) ) )
& ( ? [X3] :
( ! [X4] :
( in(apply_netmap(X0,X1,X4),X2)
| ~ related(X1,X3,X4)
| ~ element(X4,the_carrier(X1)) )
& element(X3,the_carrier(X1)) )
| ~ is_eventually_in(X0,X1,X2) ) )
| ~ net_str(X1,X0) )
| ~ one_sorted_str(X0) ),
inference(nnf_transformation,[],[f75]) ).
fof(f75,plain,
! [X0] :
( empty_carrier(X0)
| ! [X1] :
( empty_carrier(X1)
| ! [X2] :
( is_eventually_in(X0,X1,X2)
<=> ? [X3] :
( ! [X4] :
( in(apply_netmap(X0,X1,X4),X2)
| ~ related(X1,X3,X4)
| ~ element(X4,the_carrier(X1)) )
& element(X3,the_carrier(X1)) ) )
| ~ net_str(X1,X0) )
| ~ one_sorted_str(X0) ),
inference(flattening,[],[f74]) ).
fof(f74,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ? [X3] :
( ! [X4] :
( in(apply_netmap(X0,X1,X4),X2)
| ~ related(X1,X3,X4)
| ~ element(X4,the_carrier(X1)) )
& element(X3,the_carrier(X1)) )
<=> is_eventually_in(X0,X1,X2) )
| 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] :
( ? [X3] :
( ! [X4] :
( element(X4,the_carrier(X1))
=> ( related(X1,X3,X4)
=> in(apply_netmap(X0,X1,X4),X2) ) )
& element(X3,the_carrier(X1)) )
<=> is_eventually_in(X0,X1,X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d11_waybel_0) ).
fof(f164,plain,
related(sK2,sK6(sK1,sK2,sK3),sK12(sK2,sK7(sK1,sK2,sK3),sK6(sK1,sK2,sK3))),
inference(unit_resulting_resolution,[],[f146,f122,f118,f147,f148,f140]) ).
fof(f140,plain,
! [X0,X4,X5] :
( related(X0,X5,sK12(X0,X4,X5))
| ~ element(X5,the_carrier(X0))
| ~ element(X4,the_carrier(X0))
| empty_carrier(X0)
| ~ directed_relstr(X0)
| ~ rel_str(X0) ),
inference(cnf_transformation,[],[f114]) ).
fof(f114,plain,
! [X0] :
( ~ rel_str(X0)
| ( ( directed_relstr(X0)
| ( element(sK10(X0),the_carrier(X0))
& element(sK11(X0),the_carrier(X0))
& ! [X3] :
( ~ related(X0,sK10(X0),X3)
| ~ related(X0,sK11(X0),X3)
| ~ element(X3,the_carrier(X0)) ) ) )
& ( ! [X4] :
( ~ element(X4,the_carrier(X0))
| ! [X5] :
( ~ element(X5,the_carrier(X0))
| ( related(X0,X4,sK12(X0,X4,X5))
& related(X0,X5,sK12(X0,X4,X5))
& element(sK12(X0,X4,X5),the_carrier(X0)) ) ) )
| ~ directed_relstr(X0) ) )
| empty_carrier(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK10,sK11,sK12])],[f110,f113,f112,f111]) ).
fof(f111,plain,
! [X0] :
( ? [X1] :
( element(X1,the_carrier(X0))
& ? [X2] :
( element(X2,the_carrier(X0))
& ! [X3] :
( ~ related(X0,X1,X3)
| ~ related(X0,X2,X3)
| ~ element(X3,the_carrier(X0)) ) ) )
=> ( element(sK10(X0),the_carrier(X0))
& ? [X2] :
( element(X2,the_carrier(X0))
& ! [X3] :
( ~ related(X0,sK10(X0),X3)
| ~ related(X0,X2,X3)
| ~ element(X3,the_carrier(X0)) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f112,plain,
! [X0] :
( ? [X2] :
( element(X2,the_carrier(X0))
& ! [X3] :
( ~ related(X0,sK10(X0),X3)
| ~ related(X0,X2,X3)
| ~ element(X3,the_carrier(X0)) ) )
=> ( element(sK11(X0),the_carrier(X0))
& ! [X3] :
( ~ related(X0,sK10(X0),X3)
| ~ related(X0,sK11(X0),X3)
| ~ element(X3,the_carrier(X0)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f113,plain,
! [X0,X4,X5] :
( ? [X6] :
( related(X0,X4,X6)
& related(X0,X5,X6)
& element(X6,the_carrier(X0)) )
=> ( related(X0,X4,sK12(X0,X4,X5))
& related(X0,X5,sK12(X0,X4,X5))
& element(sK12(X0,X4,X5),the_carrier(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f110,plain,
! [X0] :
( ~ rel_str(X0)
| ( ( directed_relstr(X0)
| ? [X1] :
( element(X1,the_carrier(X0))
& ? [X2] :
( element(X2,the_carrier(X0))
& ! [X3] :
( ~ related(X0,X1,X3)
| ~ related(X0,X2,X3)
| ~ element(X3,the_carrier(X0)) ) ) ) )
& ( ! [X4] :
( ~ element(X4,the_carrier(X0))
| ! [X5] :
( ~ element(X5,the_carrier(X0))
| ? [X6] :
( related(X0,X4,X6)
& related(X0,X5,X6)
& element(X6,the_carrier(X0)) ) ) )
| ~ directed_relstr(X0) ) )
| empty_carrier(X0) ),
inference(rectify,[],[f109]) ).
fof(f109,plain,
! [X0] :
( ~ rel_str(X0)
| ( ( directed_relstr(X0)
| ? [X1] :
( element(X1,the_carrier(X0))
& ? [X2] :
( element(X2,the_carrier(X0))
& ! [X3] :
( ~ related(X0,X1,X3)
| ~ related(X0,X2,X3)
| ~ element(X3,the_carrier(X0)) ) ) ) )
& ( ! [X1] :
( ~ element(X1,the_carrier(X0))
| ! [X2] :
( ~ element(X2,the_carrier(X0))
| ? [X3] :
( related(X0,X1,X3)
& related(X0,X2,X3)
& element(X3,the_carrier(X0)) ) ) )
| ~ directed_relstr(X0) ) )
| empty_carrier(X0) ),
inference(nnf_transformation,[],[f84]) ).
fof(f84,plain,
! [X0] :
( ~ rel_str(X0)
| ( directed_relstr(X0)
<=> ! [X1] :
( ~ element(X1,the_carrier(X0))
| ! [X2] :
( ~ element(X2,the_carrier(X0))
| ? [X3] :
( related(X0,X1,X3)
& related(X0,X2,X3)
& element(X3,the_carrier(X0)) ) ) ) )
| empty_carrier(X0) ),
inference(flattening,[],[f83]) ).
fof(f83,plain,
! [X0] :
( ( directed_relstr(X0)
<=> ! [X1] :
( ~ element(X1,the_carrier(X0))
| ! [X2] :
( ~ element(X2,the_carrier(X0))
| ? [X3] :
( related(X0,X1,X3)
& related(X0,X2,X3)
& element(X3,the_carrier(X0)) ) ) ) )
| ~ rel_str(X0)
| empty_carrier(X0) ),
inference(ennf_transformation,[],[f10]) ).
fof(f10,axiom,
! [X0] :
( ( rel_str(X0)
& ~ empty_carrier(X0) )
=> ( ! [X1] :
( element(X1,the_carrier(X0))
=> ! [X2] :
( element(X2,the_carrier(X0))
=> ? [X3] :
( related(X0,X1,X3)
& related(X0,X2,X3)
& element(X3,the_carrier(X0)) ) ) )
<=> directed_relstr(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_yellow_6) ).
fof(f148,plain,
element(sK6(sK1,sK2,sK3),the_carrier(sK2)),
inference(unit_resulting_resolution,[],[f123,f117,f118,f119,f121,f126]) ).
fof(f126,plain,
! [X2,X0,X1] :
( element(sK6(X0,X1,X2),the_carrier(X1))
| ~ is_eventually_in(X0,X1,X2)
| empty_carrier(X0)
| empty_carrier(X1)
| ~ net_str(X1,X0)
| ~ one_sorted_str(X0) ),
inference(cnf_transformation,[],[f100]) ).
fof(f147,plain,
element(sK7(sK1,sK2,sK3),the_carrier(sK2)),
inference(unit_resulting_resolution,[],[f123,f118,f117,f119,f120,f134]) ).
fof(f134,plain,
! [X2,X0,X1] :
( element(sK7(X0,X1,X2),the_carrier(X1))
| ~ one_sorted_str(X0)
| ~ net_str(X1,X0)
| empty_carrier(X0)
| empty_carrier(X1)
| is_often_in(X0,X1,X2) ),
inference(cnf_transformation,[],[f105]) ).
fof(f105,plain,
! [X0] :
( ! [X1] :
( ~ net_str(X1,X0)
| ! [X2] :
( ( is_often_in(X0,X1,X2)
| ( ! [X4] :
( ~ element(X4,the_carrier(X1))
| ~ in(apply_netmap(X0,X1,X4),X2)
| ~ related(X1,sK7(X0,X1,X2),X4) )
& element(sK7(X0,X1,X2),the_carrier(X1)) ) )
& ( ! [X5] :
( ( element(sK8(X0,X1,X2,X5),the_carrier(X1))
& in(apply_netmap(X0,X1,sK8(X0,X1,X2,X5)),X2)
& related(X1,X5,sK8(X0,X1,X2,X5)) )
| ~ element(X5,the_carrier(X1)) )
| ~ is_often_in(X0,X1,X2) ) )
| empty_carrier(X1) )
| empty_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK7,sK8])],[f102,f104,f103]) ).
fof(f103,plain,
! [X0,X1,X2] :
( ? [X3] :
( ! [X4] :
( ~ element(X4,the_carrier(X1))
| ~ in(apply_netmap(X0,X1,X4),X2)
| ~ related(X1,X3,X4) )
& element(X3,the_carrier(X1)) )
=> ( ! [X4] :
( ~ element(X4,the_carrier(X1))
| ~ in(apply_netmap(X0,X1,X4),X2)
| ~ related(X1,sK7(X0,X1,X2),X4) )
& element(sK7(X0,X1,X2),the_carrier(X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f104,plain,
! [X0,X1,X2,X5] :
( ? [X6] :
( element(X6,the_carrier(X1))
& in(apply_netmap(X0,X1,X6),X2)
& related(X1,X5,X6) )
=> ( element(sK8(X0,X1,X2,X5),the_carrier(X1))
& in(apply_netmap(X0,X1,sK8(X0,X1,X2,X5)),X2)
& related(X1,X5,sK8(X0,X1,X2,X5)) ) ),
introduced(choice_axiom,[]) ).
fof(f102,plain,
! [X0] :
( ! [X1] :
( ~ net_str(X1,X0)
| ! [X2] :
( ( is_often_in(X0,X1,X2)
| ? [X3] :
( ! [X4] :
( ~ element(X4,the_carrier(X1))
| ~ in(apply_netmap(X0,X1,X4),X2)
| ~ related(X1,X3,X4) )
& element(X3,the_carrier(X1)) ) )
& ( ! [X5] :
( ? [X6] :
( element(X6,the_carrier(X1))
& in(apply_netmap(X0,X1,X6),X2)
& related(X1,X5,X6) )
| ~ element(X5,the_carrier(X1)) )
| ~ is_often_in(X0,X1,X2) ) )
| empty_carrier(X1) )
| empty_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(rectify,[],[f101]) ).
fof(f101,plain,
! [X0] :
( ! [X1] :
( ~ net_str(X1,X0)
| ! [X2] :
( ( is_often_in(X0,X1,X2)
| ? [X3] :
( ! [X4] :
( ~ element(X4,the_carrier(X1))
| ~ in(apply_netmap(X0,X1,X4),X2)
| ~ related(X1,X3,X4) )
& element(X3,the_carrier(X1)) ) )
& ( ! [X3] :
( ? [X4] :
( element(X4,the_carrier(X1))
& in(apply_netmap(X0,X1,X4),X2)
& related(X1,X3,X4) )
| ~ element(X3,the_carrier(X1)) )
| ~ is_often_in(X0,X1,X2) ) )
| empty_carrier(X1) )
| empty_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(nnf_transformation,[],[f77]) ).
fof(f77,plain,
! [X0] :
( ! [X1] :
( ~ net_str(X1,X0)
| ! [X2] :
( is_often_in(X0,X1,X2)
<=> ! [X3] :
( ? [X4] :
( element(X4,the_carrier(X1))
& in(apply_netmap(X0,X1,X4),X2)
& related(X1,X3,X4) )
| ~ element(X3,the_carrier(X1)) ) )
| empty_carrier(X1) )
| empty_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(flattening,[],[f76]) ).
fof(f76,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( is_often_in(X0,X1,X2)
<=> ! [X3] :
( ? [X4] :
( element(X4,the_carrier(X1))
& in(apply_netmap(X0,X1,X4),X2)
& related(X1,X3,X4) )
| ~ element(X3,the_carrier(X1)) ) )
| ~ net_str(X1,X0)
| empty_carrier(X1) )
| ~ one_sorted_str(X0)
| empty_carrier(X0) ),
inference(ennf_transformation,[],[f9]) ).
fof(f9,axiom,
! [X0] :
( ( one_sorted_str(X0)
& ~ empty_carrier(X0) )
=> ! [X1] :
( ( net_str(X1,X0)
& ~ empty_carrier(X1) )
=> ! [X2] :
( is_often_in(X0,X1,X2)
<=> ! [X3] :
( element(X3,the_carrier(X1))
=> ? [X4] :
( element(X4,the_carrier(X1))
& in(apply_netmap(X0,X1,X4),X2)
& related(X1,X3,X4) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d12_waybel_0) ).
fof(f120,plain,
~ is_often_in(sK1,sK2,sK3),
inference(cnf_transformation,[],[f93]) ).
fof(f93,plain,
( one_sorted_str(sK1)
& directed_relstr(sK2)
& is_eventually_in(sK1,sK2,sK3)
& ~ is_often_in(sK1,sK2,sK3)
& net_str(sK2,sK1)
& ~ empty_carrier(sK2)
& ~ empty_carrier(sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f86,f92,f91,f90]) ).
fof(f90,plain,
( ? [X0] :
( one_sorted_str(X0)
& ? [X1] :
( directed_relstr(X1)
& ? [X2] :
( is_eventually_in(X0,X1,X2)
& ~ is_often_in(X0,X1,X2) )
& net_str(X1,X0)
& ~ empty_carrier(X1) )
& ~ empty_carrier(X0) )
=> ( one_sorted_str(sK1)
& ? [X1] :
( directed_relstr(X1)
& ? [X2] :
( is_eventually_in(sK1,X1,X2)
& ~ is_often_in(sK1,X1,X2) )
& net_str(X1,sK1)
& ~ empty_carrier(X1) )
& ~ empty_carrier(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f91,plain,
( ? [X1] :
( directed_relstr(X1)
& ? [X2] :
( is_eventually_in(sK1,X1,X2)
& ~ is_often_in(sK1,X1,X2) )
& net_str(X1,sK1)
& ~ empty_carrier(X1) )
=> ( directed_relstr(sK2)
& ? [X2] :
( is_eventually_in(sK1,sK2,X2)
& ~ is_often_in(sK1,sK2,X2) )
& net_str(sK2,sK1)
& ~ empty_carrier(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f92,plain,
( ? [X2] :
( is_eventually_in(sK1,sK2,X2)
& ~ is_often_in(sK1,sK2,X2) )
=> ( is_eventually_in(sK1,sK2,sK3)
& ~ is_often_in(sK1,sK2,sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f86,plain,
? [X0] :
( one_sorted_str(X0)
& ? [X1] :
( directed_relstr(X1)
& ? [X2] :
( is_eventually_in(X0,X1,X2)
& ~ is_often_in(X0,X1,X2) )
& net_str(X1,X0)
& ~ empty_carrier(X1) )
& ~ empty_carrier(X0) ),
inference(flattening,[],[f85]) ).
fof(f85,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( is_eventually_in(X0,X1,X2)
& ~ is_often_in(X0,X1,X2) )
& directed_relstr(X1)
& net_str(X1,X0)
& ~ empty_carrier(X1) )
& ~ empty_carrier(X0)
& one_sorted_str(X0) ),
inference(ennf_transformation,[],[f66]) ).
fof(f66,plain,
~ ! [X0] :
( ( ~ empty_carrier(X0)
& one_sorted_str(X0) )
=> ! [X1] :
( ( directed_relstr(X1)
& net_str(X1,X0)
& ~ 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] :
( ( ~ empty_carrier(X0)
& one_sorted_str(X0) )
=> ! [X1] :
( ( directed_relstr(X1)
& transitive_relstr(X1)
& net_str(X1,X0)
& ~ empty_carrier(X1) )
=> ! [X2] :
( is_eventually_in(X0,X1,X2)
=> is_often_in(X0,X1,X2) ) ) ),
inference(negated_conjecture,[],[f54]) ).
fof(f54,conjecture,
! [X0] :
( ( ~ empty_carrier(X0)
& one_sorted_str(X0) )
=> ! [X1] :
( ( directed_relstr(X1)
& transitive_relstr(X1)
& net_str(X1,X0)
& ~ 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(f122,plain,
directed_relstr(sK2),
inference(cnf_transformation,[],[f93]) ).
fof(f146,plain,
rel_str(sK2),
inference(unit_resulting_resolution,[],[f123,f119,f137]) ).
fof(f137,plain,
! [X0,X1] :
( ~ net_str(X1,X0)
| ~ one_sorted_str(X0)
| rel_str(X1) ),
inference(cnf_transformation,[],[f82]) ).
fof(f82,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(f160,plain,
element(sK12(sK2,sK7(sK1,sK2,sK3),sK6(sK1,sK2,sK3)),the_carrier(sK2)),
inference(unit_resulting_resolution,[],[f122,f146,f118,f147,f148,f139]) ).
fof(f139,plain,
! [X0,X4,X5] :
( element(sK12(X0,X4,X5),the_carrier(X0))
| ~ element(X4,the_carrier(X0))
| ~ directed_relstr(X0)
| empty_carrier(X0)
| ~ rel_str(X0)
| ~ element(X5,the_carrier(X0)) ),
inference(cnf_transformation,[],[f114]) ).
fof(f121,plain,
is_eventually_in(sK1,sK2,sK3),
inference(cnf_transformation,[],[f93]) ).
fof(f119,plain,
net_str(sK2,sK1),
inference(cnf_transformation,[],[f93]) ).
fof(f118,plain,
~ empty_carrier(sK2),
inference(cnf_transformation,[],[f93]) ).
fof(f117,plain,
~ empty_carrier(sK1),
inference(cnf_transformation,[],[f93]) ).
fof(f123,plain,
one_sorted_str(sK1),
inference(cnf_transformation,[],[f93]) ).
fof(f291,plain,
~ in(apply_netmap(sK1,sK2,sK12(sK2,sK7(sK1,sK2,sK3),sK6(sK1,sK2,sK3))),sK3),
inference(unit_resulting_resolution,[],[f123,f118,f117,f119,f120,f160,f168,f135]) ).
fof(f135,plain,
! [X2,X0,X1,X4] :
( ~ related(X1,sK7(X0,X1,X2),X4)
| ~ in(apply_netmap(X0,X1,X4),X2)
| empty_carrier(X0)
| is_often_in(X0,X1,X2)
| ~ net_str(X1,X0)
| ~ element(X4,the_carrier(X1))
| empty_carrier(X1)
| ~ one_sorted_str(X0) ),
inference(cnf_transformation,[],[f105]) ).
fof(f168,plain,
related(sK2,sK7(sK1,sK2,sK3),sK12(sK2,sK7(sK1,sK2,sK3),sK6(sK1,sK2,sK3))),
inference(unit_resulting_resolution,[],[f146,f118,f122,f147,f148,f141]) ).
fof(f141,plain,
! [X0,X4,X5] :
( related(X0,X4,sK12(X0,X4,X5))
| ~ rel_str(X0)
| ~ element(X4,the_carrier(X0))
| ~ directed_relstr(X0)
| empty_carrier(X0)
| ~ element(X5,the_carrier(X0)) ),
inference(cnf_transformation,[],[f114]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU376+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.35 % Computer : n002.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 30 15:33:59 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.21/0.56 % (23497)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.21/0.57 % (23498)lrs+10_1:4_av=off:bs=unit_only:bsr=unit_only:ep=RS:s2a=on:sos=on:sp=frequency:to=lpo:i=16:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.21/0.57 % (23497)Instruction limit reached!
% 0.21/0.57 % (23497)------------------------------
% 0.21/0.57 % (23497)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.57 % (23512)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.21/0.58 % (23489)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.58 % (23497)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.58 % (23497)Termination reason: Unknown
% 0.21/0.58 % (23497)Termination phase: Saturation
% 0.21/0.58
% 0.21/0.58 % (23497)Memory used [KB]: 6140
% 0.21/0.58 % (23497)Time elapsed: 0.144 s
% 0.21/0.58 % (23497)Instructions burned: 8 (million)
% 0.21/0.58 % (23497)------------------------------
% 0.21/0.58 % (23497)------------------------------
% 0.21/0.59 % (23491)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.21/0.59 % (23488)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.59 % (23496)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 0.21/0.59 % (23505)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.21/0.60 % (23490)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.21/0.60 % (23509)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.21/0.60 % (23489)First to succeed.
% 0.21/0.60 % (23492)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 1.88/0.60 % (23498)Instruction limit reached!
% 1.88/0.60 % (23498)------------------------------
% 1.88/0.60 % (23498)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.88/0.60 % (23505)Refutation not found, incomplete strategy% (23505)------------------------------
% 1.88/0.60 % (23505)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.88/0.60 % (23498)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.88/0.60 % (23498)Termination reason: Unknown
% 1.88/0.60 % (23498)Termination phase: Saturation
% 1.88/0.60
% 1.88/0.60 % (23498)Memory used [KB]: 1918
% 1.88/0.60 % (23498)Time elapsed: 0.161 s
% 1.88/0.60 % (23498)Instructions burned: 17 (million)
% 1.88/0.60 % (23498)------------------------------
% 1.88/0.60 % (23498)------------------------------
% 1.88/0.60 % (23505)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.88/0.60 % (23505)Termination reason: Refutation not found, incomplete strategy
% 1.88/0.60
% 1.88/0.60 % (23505)Memory used [KB]: 6012
% 1.88/0.60 % (23505)Time elapsed: 0.173 s
% 1.88/0.60 % (23505)Instructions burned: 4 (million)
% 1.88/0.60 % (23505)------------------------------
% 1.88/0.60 % (23505)------------------------------
% 1.88/0.61 % (23486)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 1.88/0.61 % (23491)Also succeeded, but the first one will report.
% 1.88/0.61 % (23489)Refutation found. Thanks to Tanya!
% 1.88/0.61 % SZS status Theorem for theBenchmark
% 1.88/0.61 % SZS output start Proof for theBenchmark
% See solution above
% 1.88/0.61 % (23489)------------------------------
% 1.88/0.61 % (23489)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.88/0.61 % (23489)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.88/0.61 % (23489)Termination reason: Refutation
% 1.88/0.61
% 1.88/0.61 % (23489)Memory used [KB]: 6268
% 1.88/0.61 % (23489)Time elapsed: 0.166 s
% 1.88/0.61 % (23489)Instructions burned: 16 (million)
% 1.88/0.61 % (23489)------------------------------
% 1.88/0.61 % (23489)------------------------------
% 1.88/0.61 % (23485)Success in time 0.256 s
%------------------------------------------------------------------------------