TSTP Solution File: SEU391+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SEU391+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 : n009.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:35 EDT 2022
% Result : Theorem 1.53s 0.62s
% Output : Refutation 1.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 10
% Syntax : Number of formulae : 85 ( 15 unt; 3 typ; 0 def)
% Number of atoms : 387 ( 30 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 475 ( 170 ~; 198 |; 87 &)
% ( 6 <=>; 12 =>; 0 <=; 2 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 4 ( 0 usr; 3 ari)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 114 ( 86 !; 28 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_42,type,
sQ40_eqProxy: ( $int * $int ) > $o ).
tff(pred_def_43,type,
sQ41_eqProxy: ( $rat * $rat ) > $o ).
tff(pred_def_44,type,
sQ42_eqProxy: ( $real * $real ) > $o ).
fof(f1430,plain,
$false,
inference(subsumption_resolution,[],[f1411,f1418]) ).
fof(f1418,plain,
~ element(sK28,powerset(the_carrier(sK26))),
inference(subsumption_resolution,[],[f1397,f1417]) ).
fof(f1417,plain,
is_eventually_in(sK26,sK27,sK28),
inference(subsumption_resolution,[],[f1416,f1390]) ).
fof(f1390,plain,
in(sK28,filter_of_net_str(sK26,sK27)),
inference(subsumption_resolution,[],[f1389,f894]) ).
fof(f894,plain,
( in(sK28,filter_of_net_str(sK26,sK27))
| element(sK28,powerset(the_carrier(sK26))) ),
inference(literal_reordering,[],[f563]) ).
fof(f563,plain,
( in(sK28,filter_of_net_str(sK26,sK27))
| element(sK28,powerset(the_carrier(sK26))) ),
inference(cnf_transformation,[],[f336]) ).
fof(f336,plain,
( net_str(sK27,sK26)
& ( ~ element(sK28,powerset(the_carrier(sK26)))
| ~ is_eventually_in(sK26,sK27,sK28)
| ~ in(sK28,filter_of_net_str(sK26,sK27)) )
& ( ( element(sK28,powerset(the_carrier(sK26)))
& is_eventually_in(sK26,sK27,sK28) )
| in(sK28,filter_of_net_str(sK26,sK27)) )
& ~ empty_carrier(sK27)
& one_sorted_str(sK26)
& ~ empty_carrier(sK26) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK26,sK27,sK28])],[f332,f335,f334,f333]) ).
fof(f333,plain,
( ? [X0] :
( ? [X1] :
( net_str(X1,X0)
& ? [X2] :
( ( ~ element(X2,powerset(the_carrier(X0)))
| ~ is_eventually_in(X0,X1,X2)
| ~ in(X2,filter_of_net_str(X0,X1)) )
& ( ( element(X2,powerset(the_carrier(X0)))
& is_eventually_in(X0,X1,X2) )
| in(X2,filter_of_net_str(X0,X1)) ) )
& ~ empty_carrier(X1) )
& one_sorted_str(X0)
& ~ empty_carrier(X0) )
=> ( ? [X1] :
( net_str(X1,sK26)
& ? [X2] :
( ( ~ element(X2,powerset(the_carrier(sK26)))
| ~ is_eventually_in(sK26,X1,X2)
| ~ in(X2,filter_of_net_str(sK26,X1)) )
& ( ( element(X2,powerset(the_carrier(sK26)))
& is_eventually_in(sK26,X1,X2) )
| in(X2,filter_of_net_str(sK26,X1)) ) )
& ~ empty_carrier(X1) )
& one_sorted_str(sK26)
& ~ empty_carrier(sK26) ) ),
introduced(choice_axiom,[]) ).
fof(f334,plain,
( ? [X1] :
( net_str(X1,sK26)
& ? [X2] :
( ( ~ element(X2,powerset(the_carrier(sK26)))
| ~ is_eventually_in(sK26,X1,X2)
| ~ in(X2,filter_of_net_str(sK26,X1)) )
& ( ( element(X2,powerset(the_carrier(sK26)))
& is_eventually_in(sK26,X1,X2) )
| in(X2,filter_of_net_str(sK26,X1)) ) )
& ~ empty_carrier(X1) )
=> ( net_str(sK27,sK26)
& ? [X2] :
( ( ~ element(X2,powerset(the_carrier(sK26)))
| ~ is_eventually_in(sK26,sK27,X2)
| ~ in(X2,filter_of_net_str(sK26,sK27)) )
& ( ( element(X2,powerset(the_carrier(sK26)))
& is_eventually_in(sK26,sK27,X2) )
| in(X2,filter_of_net_str(sK26,sK27)) ) )
& ~ empty_carrier(sK27) ) ),
introduced(choice_axiom,[]) ).
fof(f335,plain,
( ? [X2] :
( ( ~ element(X2,powerset(the_carrier(sK26)))
| ~ is_eventually_in(sK26,sK27,X2)
| ~ in(X2,filter_of_net_str(sK26,sK27)) )
& ( ( element(X2,powerset(the_carrier(sK26)))
& is_eventually_in(sK26,sK27,X2) )
| in(X2,filter_of_net_str(sK26,sK27)) ) )
=> ( ( ~ element(sK28,powerset(the_carrier(sK26)))
| ~ is_eventually_in(sK26,sK27,sK28)
| ~ in(sK28,filter_of_net_str(sK26,sK27)) )
& ( ( element(sK28,powerset(the_carrier(sK26)))
& is_eventually_in(sK26,sK27,sK28) )
| in(sK28,filter_of_net_str(sK26,sK27)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f332,plain,
? [X0] :
( ? [X1] :
( net_str(X1,X0)
& ? [X2] :
( ( ~ element(X2,powerset(the_carrier(X0)))
| ~ is_eventually_in(X0,X1,X2)
| ~ in(X2,filter_of_net_str(X0,X1)) )
& ( ( element(X2,powerset(the_carrier(X0)))
& is_eventually_in(X0,X1,X2) )
| in(X2,filter_of_net_str(X0,X1)) ) )
& ~ empty_carrier(X1) )
& one_sorted_str(X0)
& ~ empty_carrier(X0) ),
inference(flattening,[],[f331]) ).
fof(f331,plain,
? [X0] :
( ? [X1] :
( net_str(X1,X0)
& ? [X2] :
( ( ~ element(X2,powerset(the_carrier(X0)))
| ~ is_eventually_in(X0,X1,X2)
| ~ in(X2,filter_of_net_str(X0,X1)) )
& ( ( element(X2,powerset(the_carrier(X0)))
& is_eventually_in(X0,X1,X2) )
| in(X2,filter_of_net_str(X0,X1)) ) )
& ~ empty_carrier(X1) )
& one_sorted_str(X0)
& ~ empty_carrier(X0) ),
inference(nnf_transformation,[],[f172]) ).
fof(f172,plain,
? [X0] :
( ? [X1] :
( net_str(X1,X0)
& ? [X2] :
( in(X2,filter_of_net_str(X0,X1))
<~> ( element(X2,powerset(the_carrier(X0)))
& is_eventually_in(X0,X1,X2) ) )
& ~ empty_carrier(X1) )
& one_sorted_str(X0)
& ~ empty_carrier(X0) ),
inference(flattening,[],[f171]) ).
fof(f171,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( in(X2,filter_of_net_str(X0,X1))
<~> ( element(X2,powerset(the_carrier(X0)))
& is_eventually_in(X0,X1,X2) ) )
& ~ empty_carrier(X1)
& net_str(X1,X0) )
& one_sorted_str(X0)
& ~ empty_carrier(X0) ),
inference(ennf_transformation,[],[f93]) ).
fof(f93,negated_conjecture,
~ ! [X0] :
( ( one_sorted_str(X0)
& ~ empty_carrier(X0) )
=> ! [X1] :
( ( ~ empty_carrier(X1)
& net_str(X1,X0) )
=> ! [X2] :
( ( element(X2,powerset(the_carrier(X0)))
& is_eventually_in(X0,X1,X2) )
<=> in(X2,filter_of_net_str(X0,X1)) ) ) ),
inference(negated_conjecture,[],[f92]) ).
fof(f92,conjecture,
! [X0] :
( ( one_sorted_str(X0)
& ~ empty_carrier(X0) )
=> ! [X1] :
( ( ~ empty_carrier(X1)
& net_str(X1,X0) )
=> ! [X2] :
( ( element(X2,powerset(the_carrier(X0)))
& is_eventually_in(X0,X1,X2) )
<=> in(X2,filter_of_net_str(X0,X1)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t11_yellow19) ).
fof(f1389,plain,
( in(sK28,filter_of_net_str(sK26,sK27))
| ~ element(sK28,powerset(the_carrier(sK26))) ),
inference(duplicate_literal_removal,[],[f1387]) ).
fof(f1387,plain,
( in(sK28,filter_of_net_str(sK26,sK27))
| in(sK28,filter_of_net_str(sK26,sK27))
| ~ element(sK28,powerset(the_carrier(sK26))) ),
inference(resolution,[],[f1363,f845]) ).
fof(f845,plain,
( is_eventually_in(sK26,sK27,sK28)
| in(sK28,filter_of_net_str(sK26,sK27)) ),
inference(literal_reordering,[],[f562]) ).
fof(f562,plain,
( is_eventually_in(sK26,sK27,sK28)
| in(sK28,filter_of_net_str(sK26,sK27)) ),
inference(cnf_transformation,[],[f336]) ).
fof(f1363,plain,
! [X0] :
( ~ is_eventually_in(sK26,sK27,X0)
| ~ element(X0,powerset(the_carrier(sK26)))
| in(X0,filter_of_net_str(sK26,sK27)) ),
inference(forward_demodulation,[],[f1362,f1256]) ).
fof(f1256,plain,
a_2_1_yellow19(sK26,sK27) = filter_of_net_str(sK26,sK27),
inference(subsumption_resolution,[],[f1255,f855]) ).
fof(f855,plain,
one_sorted_str(sK26),
inference(literal_reordering,[],[f560]) ).
fof(f560,plain,
one_sorted_str(sK26),
inference(cnf_transformation,[],[f336]) ).
fof(f1255,plain,
( ~ one_sorted_str(sK26)
| a_2_1_yellow19(sK26,sK27) = filter_of_net_str(sK26,sK27) ),
inference(subsumption_resolution,[],[f1254,f793]) ).
fof(f793,plain,
~ empty_carrier(sK26),
inference(literal_reordering,[],[f559]) ).
fof(f559,plain,
~ empty_carrier(sK26),
inference(cnf_transformation,[],[f336]) ).
fof(f1254,plain,
( a_2_1_yellow19(sK26,sK27) = filter_of_net_str(sK26,sK27)
| empty_carrier(sK26)
| ~ one_sorted_str(sK26) ),
inference(subsumption_resolution,[],[f1251,f794]) ).
fof(f794,plain,
~ empty_carrier(sK27),
inference(literal_reordering,[],[f561]) ).
fof(f561,plain,
~ empty_carrier(sK27),
inference(cnf_transformation,[],[f336]) ).
fof(f1251,plain,
( a_2_1_yellow19(sK26,sK27) = filter_of_net_str(sK26,sK27)
| empty_carrier(sK27)
| empty_carrier(sK26)
| ~ one_sorted_str(sK26) ),
inference(resolution,[],[f864,f867]) ).
fof(f867,plain,
net_str(sK27,sK26),
inference(literal_reordering,[],[f565]) ).
fof(f565,plain,
net_str(sK27,sK26),
inference(cnf_transformation,[],[f336]) ).
fof(f864,plain,
! [X0,X1] :
( ~ net_str(X1,X0)
| ~ one_sorted_str(X0)
| empty_carrier(X0)
| filter_of_net_str(X0,X1) = a_2_1_yellow19(X0,X1)
| empty_carrier(X1) ),
inference(literal_reordering,[],[f566]) ).
fof(f566,plain,
! [X0,X1] :
( empty_carrier(X1)
| filter_of_net_str(X0,X1) = a_2_1_yellow19(X0,X1)
| ~ net_str(X1,X0)
| ~ one_sorted_str(X0)
| empty_carrier(X0) ),
inference(cnf_transformation,[],[f267]) ).
fof(f267,plain,
! [X0] :
( ! [X1] :
( filter_of_net_str(X0,X1) = a_2_1_yellow19(X0,X1)
| ~ net_str(X1,X0)
| empty_carrier(X1) )
| ~ one_sorted_str(X0)
| empty_carrier(X0) ),
inference(flattening,[],[f266]) ).
fof(f266,plain,
! [X0] :
( ! [X1] :
( filter_of_net_str(X0,X1) = a_2_1_yellow19(X0,X1)
| ~ net_str(X1,X0)
| empty_carrier(X1) )
| ~ one_sorted_str(X0)
| empty_carrier(X0) ),
inference(ennf_transformation,[],[f21]) ).
fof(f21,axiom,
! [X0] :
( ( one_sorted_str(X0)
& ~ empty_carrier(X0) )
=> ! [X1] :
( ( net_str(X1,X0)
& ~ empty_carrier(X1) )
=> filter_of_net_str(X0,X1) = a_2_1_yellow19(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_yellow19) ).
fof(f1362,plain,
! [X0] :
( in(X0,a_2_1_yellow19(sK26,sK27))
| ~ element(X0,powerset(the_carrier(sK26)))
| ~ is_eventually_in(sK26,sK27,X0) ),
inference(subsumption_resolution,[],[f1361,f793]) ).
fof(f1361,plain,
! [X0] :
( in(X0,a_2_1_yellow19(sK26,sK27))
| empty_carrier(sK26)
| ~ is_eventually_in(sK26,sK27,X0)
| ~ element(X0,powerset(the_carrier(sK26))) ),
inference(subsumption_resolution,[],[f1360,f794]) ).
fof(f1360,plain,
! [X0] :
( empty_carrier(sK27)
| empty_carrier(sK26)
| in(X0,a_2_1_yellow19(sK26,sK27))
| ~ is_eventually_in(sK26,sK27,X0)
| ~ element(X0,powerset(the_carrier(sK26))) ),
inference(subsumption_resolution,[],[f1357,f855]) ).
fof(f1357,plain,
! [X0] :
( ~ one_sorted_str(sK26)
| empty_carrier(sK26)
| ~ is_eventually_in(sK26,sK27,X0)
| in(X0,a_2_1_yellow19(sK26,sK27))
| empty_carrier(sK27)
| ~ element(X0,powerset(the_carrier(sK26))) ),
inference(resolution,[],[f741,f867]) ).
fof(f741,plain,
! [X0,X1,X4] :
( ~ net_str(X0,X1)
| empty_carrier(X1)
| empty_carrier(X0)
| ~ is_eventually_in(X1,X0,X4)
| ~ one_sorted_str(X1)
| in(X4,a_2_1_yellow19(X1,X0))
| ~ element(X4,powerset(the_carrier(X1))) ),
inference(literal_reordering,[],[f637]) ).
fof(f637,plain,
! [X0,X1,X4] :
( ~ one_sorted_str(X1)
| empty_carrier(X0)
| ~ element(X4,powerset(the_carrier(X1)))
| ~ is_eventually_in(X1,X0,X4)
| ~ net_str(X0,X1)
| empty_carrier(X1)
| in(X4,a_2_1_yellow19(X1,X0)) ),
inference(equality_resolution,[],[f439]) ).
fof(f439,plain,
! [X2,X0,X1,X4] :
( ~ net_str(X0,X1)
| empty_carrier(X0)
| ~ one_sorted_str(X1)
| empty_carrier(X1)
| in(X2,a_2_1_yellow19(X1,X0))
| ~ is_eventually_in(X1,X0,X4)
| ~ element(X4,powerset(the_carrier(X1)))
| X2 != X4 ),
inference(cnf_transformation,[],[f290]) ).
fof(f290,plain,
! [X0,X1,X2] :
( ~ net_str(X0,X1)
| empty_carrier(X0)
| ~ one_sorted_str(X1)
| empty_carrier(X1)
| ( ( ( is_eventually_in(X1,X0,sK8(X0,X1,X2))
& element(sK8(X0,X1,X2),powerset(the_carrier(X1)))
& sK8(X0,X1,X2) = X2 )
| ~ in(X2,a_2_1_yellow19(X1,X0)) )
& ( in(X2,a_2_1_yellow19(X1,X0))
| ! [X4] :
( ~ is_eventually_in(X1,X0,X4)
| ~ element(X4,powerset(the_carrier(X1)))
| X2 != X4 ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK8])],[f288,f289]) ).
fof(f289,plain,
! [X0,X1,X2] :
( ? [X3] :
( is_eventually_in(X1,X0,X3)
& element(X3,powerset(the_carrier(X1)))
& X2 = X3 )
=> ( is_eventually_in(X1,X0,sK8(X0,X1,X2))
& element(sK8(X0,X1,X2),powerset(the_carrier(X1)))
& sK8(X0,X1,X2) = X2 ) ),
introduced(choice_axiom,[]) ).
fof(f288,plain,
! [X0,X1,X2] :
( ~ net_str(X0,X1)
| empty_carrier(X0)
| ~ one_sorted_str(X1)
| empty_carrier(X1)
| ( ( ? [X3] :
( is_eventually_in(X1,X0,X3)
& element(X3,powerset(the_carrier(X1)))
& X2 = X3 )
| ~ in(X2,a_2_1_yellow19(X1,X0)) )
& ( in(X2,a_2_1_yellow19(X1,X0))
| ! [X4] :
( ~ is_eventually_in(X1,X0,X4)
| ~ element(X4,powerset(the_carrier(X1)))
| X2 != X4 ) ) ) ),
inference(rectify,[],[f287]) ).
fof(f287,plain,
! [X1,X2,X0] :
( ~ net_str(X1,X2)
| empty_carrier(X1)
| ~ one_sorted_str(X2)
| empty_carrier(X2)
| ( ( ? [X3] :
( is_eventually_in(X2,X1,X3)
& element(X3,powerset(the_carrier(X2)))
& X0 = X3 )
| ~ in(X0,a_2_1_yellow19(X2,X1)) )
& ( in(X0,a_2_1_yellow19(X2,X1))
| ! [X3] :
( ~ is_eventually_in(X2,X1,X3)
| ~ element(X3,powerset(the_carrier(X2)))
| X0 != X3 ) ) ) ),
inference(nnf_transformation,[],[f179]) ).
fof(f179,plain,
! [X1,X2,X0] :
( ~ net_str(X1,X2)
| empty_carrier(X1)
| ~ one_sorted_str(X2)
| empty_carrier(X2)
| ( ? [X3] :
( is_eventually_in(X2,X1,X3)
& element(X3,powerset(the_carrier(X2)))
& X0 = X3 )
<=> in(X0,a_2_1_yellow19(X2,X1)) ) ),
inference(flattening,[],[f178]) ).
fof(f178,plain,
! [X1,X2,X0] :
( ( ? [X3] :
( is_eventually_in(X2,X1,X3)
& element(X3,powerset(the_carrier(X2)))
& X0 = X3 )
<=> in(X0,a_2_1_yellow19(X2,X1)) )
| empty_carrier(X2)
| ~ one_sorted_str(X2)
| ~ net_str(X1,X2)
| empty_carrier(X1) ),
inference(ennf_transformation,[],[f107]) ).
fof(f107,plain,
! [X1,X2,X0] :
( ( ~ empty_carrier(X2)
& one_sorted_str(X2)
& net_str(X1,X2)
& ~ empty_carrier(X1) )
=> ( ? [X3] :
( is_eventually_in(X2,X1,X3)
& element(X3,powerset(the_carrier(X2)))
& X0 = X3 )
<=> in(X0,a_2_1_yellow19(X2,X1)) ) ),
inference(rectify,[],[f61]) ).
fof(f61,axiom,
! [X0,X2,X1] :
( ( one_sorted_str(X1)
& ~ empty_carrier(X2)
& ~ empty_carrier(X1)
& net_str(X2,X1) )
=> ( ? [X3] :
( X0 = X3
& element(X3,powerset(the_carrier(X1)))
& is_eventually_in(X1,X2,X3) )
<=> in(X0,a_2_1_yellow19(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fraenkel_a_2_1_yellow19) ).
fof(f1416,plain,
( ~ in(sK28,filter_of_net_str(sK26,sK27))
| is_eventually_in(sK26,sK27,sK28) ),
inference(forward_demodulation,[],[f1415,f1256]) ).
fof(f1415,plain,
( is_eventually_in(sK26,sK27,sK28)
| ~ in(sK28,a_2_1_yellow19(sK26,sK27)) ),
inference(subsumption_resolution,[],[f1414,f867]) ).
fof(f1414,plain,
( ~ in(sK28,a_2_1_yellow19(sK26,sK27))
| is_eventually_in(sK26,sK27,sK28)
| ~ net_str(sK27,sK26) ),
inference(subsumption_resolution,[],[f1413,f794]) ).
fof(f1413,plain,
( empty_carrier(sK27)
| ~ in(sK28,a_2_1_yellow19(sK26,sK27))
| is_eventually_in(sK26,sK27,sK28)
| ~ net_str(sK27,sK26) ),
inference(subsumption_resolution,[],[f1412,f855]) ).
fof(f1412,plain,
( ~ one_sorted_str(sK26)
| ~ net_str(sK27,sK26)
| ~ in(sK28,a_2_1_yellow19(sK26,sK27))
| empty_carrier(sK27)
| is_eventually_in(sK26,sK27,sK28) ),
inference(subsumption_resolution,[],[f1410,f793]) ).
fof(f1410,plain,
( empty_carrier(sK26)
| is_eventually_in(sK26,sK27,sK28)
| ~ one_sorted_str(sK26)
| empty_carrier(sK27)
| ~ net_str(sK27,sK26)
| ~ in(sK28,a_2_1_yellow19(sK26,sK27)) ),
inference(superposition,[],[f681,f1399]) ).
fof(f1399,plain,
sK8(sK27,sK26,sK28) = sK28,
inference(resolution,[],[f1390,f1364]) ).
fof(f1364,plain,
! [X0] :
( ~ in(X0,filter_of_net_str(sK26,sK27))
| sK8(sK27,sK26,X0) = X0 ),
inference(forward_demodulation,[],[f1339,f1256]) ).
fof(f1339,plain,
! [X0] :
( ~ in(X0,a_2_1_yellow19(sK26,sK27))
| sK8(sK27,sK26,X0) = X0 ),
inference(subsumption_resolution,[],[f1338,f793]) ).
fof(f1338,plain,
! [X0] :
( ~ in(X0,a_2_1_yellow19(sK26,sK27))
| sK8(sK27,sK26,X0) = X0
| empty_carrier(sK26) ),
inference(subsumption_resolution,[],[f1337,f855]) ).
fof(f1337,plain,
! [X0] :
( sK8(sK27,sK26,X0) = X0
| ~ one_sorted_str(sK26)
| ~ in(X0,a_2_1_yellow19(sK26,sK27))
| empty_carrier(sK26) ),
inference(subsumption_resolution,[],[f1334,f794]) ).
fof(f1334,plain,
! [X0] :
( empty_carrier(sK27)
| sK8(sK27,sK26,X0) = X0
| ~ in(X0,a_2_1_yellow19(sK26,sK27))
| ~ one_sorted_str(sK26)
| empty_carrier(sK26) ),
inference(resolution,[],[f899,f867]) ).
fof(f899,plain,
! [X2,X0,X1] :
( ~ net_str(X0,X1)
| empty_carrier(X1)
| sK8(X0,X1,X2) = X2
| ~ one_sorted_str(X1)
| empty_carrier(X0)
| ~ in(X2,a_2_1_yellow19(X1,X0)) ),
inference(literal_reordering,[],[f440]) ).
fof(f440,plain,
! [X2,X0,X1] :
( empty_carrier(X0)
| ~ in(X2,a_2_1_yellow19(X1,X0))
| sK8(X0,X1,X2) = X2
| ~ net_str(X0,X1)
| ~ one_sorted_str(X1)
| empty_carrier(X1) ),
inference(cnf_transformation,[],[f290]) ).
fof(f681,plain,
! [X2,X0,X1] :
( is_eventually_in(X1,X0,sK8(X0,X1,X2))
| empty_carrier(X0)
| ~ one_sorted_str(X1)
| empty_carrier(X1)
| ~ net_str(X0,X1)
| ~ in(X2,a_2_1_yellow19(X1,X0)) ),
inference(literal_reordering,[],[f442]) ).
fof(f442,plain,
! [X2,X0,X1] :
( is_eventually_in(X1,X0,sK8(X0,X1,X2))
| ~ net_str(X0,X1)
| ~ one_sorted_str(X1)
| empty_carrier(X0)
| empty_carrier(X1)
| ~ in(X2,a_2_1_yellow19(X1,X0)) ),
inference(cnf_transformation,[],[f290]) ).
fof(f1397,plain,
( ~ is_eventually_in(sK26,sK27,sK28)
| ~ element(sK28,powerset(the_carrier(sK26))) ),
inference(subsumption_resolution,[],[f775,f1390]) ).
fof(f775,plain,
( ~ is_eventually_in(sK26,sK27,sK28)
| ~ element(sK28,powerset(the_carrier(sK26)))
| ~ in(sK28,filter_of_net_str(sK26,sK27)) ),
inference(literal_reordering,[],[f564]) ).
fof(f564,plain,
( ~ in(sK28,filter_of_net_str(sK26,sK27))
| ~ is_eventually_in(sK26,sK27,sK28)
| ~ element(sK28,powerset(the_carrier(sK26))) ),
inference(cnf_transformation,[],[f336]) ).
fof(f1411,plain,
element(sK28,powerset(the_carrier(sK26))),
inference(duplicate_literal_removal,[],[f1408]) ).
fof(f1408,plain,
( element(sK28,powerset(the_carrier(sK26)))
| element(sK28,powerset(the_carrier(sK26))) ),
inference(backward_demodulation,[],[f1381,f1399]) ).
fof(f1381,plain,
( element(sK8(sK27,sK26,sK28),powerset(the_carrier(sK26)))
| element(sK28,powerset(the_carrier(sK26))) ),
inference(resolution,[],[f1380,f894]) ).
fof(f1380,plain,
! [X0] :
( ~ in(X0,filter_of_net_str(sK26,sK27))
| element(sK8(sK27,sK26,X0),powerset(the_carrier(sK26))) ),
inference(forward_demodulation,[],[f1355,f1256]) ).
fof(f1355,plain,
! [X0] :
( ~ in(X0,a_2_1_yellow19(sK26,sK27))
| element(sK8(sK27,sK26,X0),powerset(the_carrier(sK26))) ),
inference(subsumption_resolution,[],[f1354,f793]) ).
fof(f1354,plain,
! [X0] :
( ~ in(X0,a_2_1_yellow19(sK26,sK27))
| element(sK8(sK27,sK26,X0),powerset(the_carrier(sK26)))
| empty_carrier(sK26) ),
inference(subsumption_resolution,[],[f1353,f855]) ).
fof(f1353,plain,
! [X0] :
( ~ one_sorted_str(sK26)
| ~ in(X0,a_2_1_yellow19(sK26,sK27))
| element(sK8(sK27,sK26,X0),powerset(the_carrier(sK26)))
| empty_carrier(sK26) ),
inference(subsumption_resolution,[],[f1350,f794]) ).
fof(f1350,plain,
! [X0] :
( empty_carrier(sK27)
| empty_carrier(sK26)
| ~ one_sorted_str(sK26)
| element(sK8(sK27,sK26,X0),powerset(the_carrier(sK26)))
| ~ in(X0,a_2_1_yellow19(sK26,sK27)) ),
inference(resolution,[],[f797,f867]) ).
fof(f797,plain,
! [X2,X0,X1] :
( ~ net_str(X0,X1)
| ~ one_sorted_str(X1)
| empty_carrier(X0)
| element(sK8(X0,X1,X2),powerset(the_carrier(X1)))
| empty_carrier(X1)
| ~ in(X2,a_2_1_yellow19(X1,X0)) ),
inference(literal_reordering,[],[f441]) ).
fof(f441,plain,
! [X2,X0,X1] :
( ~ net_str(X0,X1)
| empty_carrier(X1)
| empty_carrier(X0)
| ~ one_sorted_str(X1)
| element(sK8(X0,X1,X2),powerset(the_carrier(X1)))
| ~ in(X2,a_2_1_yellow19(X1,X0)) ),
inference(cnf_transformation,[],[f290]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU391+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.12/0.33 % Computer : n009.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Aug 30 15:21:05 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 % (22158)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.19/0.49 % (22176)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 1.35/0.53 % (22157)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.53/0.55 % (22181)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.53/0.55 % (22158)Instruction limit reached!
% 1.53/0.55 % (22158)------------------------------
% 1.53/0.55 % (22158)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.53/0.56 % (22166)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.53/0.56 % (22165)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 1.53/0.56 % (22164)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.53/0.57 % (22180)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 1.53/0.58 % (22158)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.53/0.58 % (22158)Termination reason: Unknown
% 1.53/0.58 % (22158)Termination phase: Saturation
% 1.53/0.58
% 1.53/0.58 % (22158)Memory used [KB]: 6908
% 1.53/0.58 % (22158)Time elapsed: 0.155 s
% 1.53/0.58 % (22158)Instructions burned: 52 (million)
% 1.53/0.58 % (22158)------------------------------
% 1.53/0.58 % (22158)------------------------------
% 1.53/0.58 % (22155)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)
% 1.53/0.58 % (22169)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.53/0.58 % (22170)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)
% 1.53/0.59 % (22161)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.53/0.59 % (22160)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.53/0.59 % (22159)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.53/0.60 % (22184)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.53/0.60 % (22178)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.53/0.60 % (22175)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.53/0.61 % (22181)First to succeed.
% 1.53/0.61 % (22157)Instruction limit reached!
% 1.53/0.61 % (22157)------------------------------
% 1.53/0.61 % (22157)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.53/0.61 % (22157)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.53/0.61 % (22157)Termination reason: Unknown
% 1.53/0.61 % (22157)Termination phase: Saturation
% 1.53/0.61
% 1.53/0.61 % (22157)Memory used [KB]: 1663
% 1.53/0.61 % (22157)Time elapsed: 0.178 s
% 1.53/0.61 % (22157)Instructions burned: 37 (million)
% 1.53/0.61 % (22157)------------------------------
% 1.53/0.61 % (22157)------------------------------
% 1.53/0.61 % (22167)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.53/0.62 % (22181)Refutation found. Thanks to Tanya!
% 1.53/0.62 % SZS status Theorem for theBenchmark
% 1.53/0.62 % SZS output start Proof for theBenchmark
% See solution above
% 1.53/0.62 % (22181)------------------------------
% 1.53/0.62 % (22181)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.53/0.62 % (22181)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.53/0.62 % (22181)Termination reason: Refutation
% 1.53/0.62
% 1.53/0.62 % (22181)Memory used [KB]: 6780
% 1.53/0.62 % (22181)Time elapsed: 0.045 s
% 1.53/0.62 % (22181)Instructions burned: 34 (million)
% 1.53/0.62 % (22181)------------------------------
% 1.53/0.62 % (22181)------------------------------
% 1.53/0.62 % (22154)Success in time 0.271 s
%------------------------------------------------------------------------------