TSTP Solution File: SEU238+3 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SEU238+3 : TPTP v8.1.0. Released v3.2.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 : n020.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:32:46 EDT 2022
% Result : Theorem 2.41s 0.67s
% Output : Refutation 2.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 31
% Number of leaves : 13
% Syntax : Number of formulae : 87 ( 13 unt; 0 def)
% Number of atoms : 324 ( 37 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 384 ( 147 ~; 145 |; 59 &)
% ( 10 <=>; 23 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-1 aty)
% Number of variables : 108 ( 94 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1047,plain,
$false,
inference(subsumption_resolution,[],[f1046,f211]) ).
fof(f211,plain,
! [X0,X1] :
( ~ in(X1,X0)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f145]) ).
fof(f145,plain,
! [X0,X1] :
( ~ in(X1,X0)
| ~ in(X0,X1) ),
inference(rectify,[],[f97]) ).
fof(f97,plain,
! [X1,X0] :
( ~ in(X0,X1)
| ~ in(X1,X0) ),
inference(ennf_transformation,[],[f61]) ).
fof(f61,plain,
! [X0,X1] :
( in(X1,X0)
=> ~ in(X0,X1) ),
inference(rectify,[],[f1]) ).
fof(f1,axiom,
! [X1,X0] :
( in(X0,X1)
=> ~ in(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',antisymmetry_r2_hidden) ).
fof(f1046,plain,
in(sK4,sK4),
inference(forward_demodulation,[],[f1045,f712]) ).
fof(f712,plain,
sK4 = succ(sK5),
inference(backward_demodulation,[],[f267,f708]) ).
fof(f708,plain,
sK4 = sF17,
inference(resolution,[],[f707,f268]) ).
fof(f268,plain,
( ~ being_limit_ordinal(sK4)
| sK4 = sF17 ),
inference(definition_folding,[],[f197,f267]) ).
fof(f197,plain,
( ~ being_limit_ordinal(sK4)
| sK4 = succ(sK5) ),
inference(cnf_transformation,[],[f135]) ).
fof(f135,plain,
( ( ( ~ being_limit_ordinal(sK4)
& ! [X1] :
( succ(X1) != sK4
| ~ ordinal(X1) ) )
| ( being_limit_ordinal(sK4)
& sK4 = succ(sK5)
& ordinal(sK5) ) )
& ordinal(sK4) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5])],[f132,f134,f133]) ).
fof(f133,plain,
( ? [X0] :
( ( ( ~ being_limit_ordinal(X0)
& ! [X1] :
( succ(X1) != X0
| ~ ordinal(X1) ) )
| ( being_limit_ordinal(X0)
& ? [X2] :
( succ(X2) = X0
& ordinal(X2) ) ) )
& ordinal(X0) )
=> ( ( ( ~ being_limit_ordinal(sK4)
& ! [X1] :
( succ(X1) != sK4
| ~ ordinal(X1) ) )
| ( being_limit_ordinal(sK4)
& ? [X2] :
( sK4 = succ(X2)
& ordinal(X2) ) ) )
& ordinal(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f134,plain,
( ? [X2] :
( sK4 = succ(X2)
& ordinal(X2) )
=> ( sK4 = succ(sK5)
& ordinal(sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f132,plain,
? [X0] :
( ( ( ~ being_limit_ordinal(X0)
& ! [X1] :
( succ(X1) != X0
| ~ ordinal(X1) ) )
| ( being_limit_ordinal(X0)
& ? [X2] :
( succ(X2) = X0
& ordinal(X2) ) ) )
& ordinal(X0) ),
inference(rectify,[],[f113]) ).
fof(f113,plain,
? [X0] :
( ( ( ~ being_limit_ordinal(X0)
& ! [X2] :
( succ(X2) != X0
| ~ ordinal(X2) ) )
| ( being_limit_ordinal(X0)
& ? [X1] :
( succ(X1) = X0
& ordinal(X1) ) ) )
& ordinal(X0) ),
inference(ennf_transformation,[],[f64]) ).
fof(f64,plain,
~ ! [X0] :
( ordinal(X0)
=> ( ~ ( being_limit_ordinal(X0)
& ? [X1] :
( succ(X1) = X0
& ordinal(X1) ) )
& ~ ( ~ being_limit_ordinal(X0)
& ! [X2] :
( ordinal(X2)
=> succ(X2) != X0 ) ) ) ),
inference(rectify,[],[f50]) ).
fof(f50,negated_conjecture,
~ ! [X0] :
( ordinal(X0)
=> ( ~ ( being_limit_ordinal(X0)
& ? [X1] :
( succ(X1) = X0
& ordinal(X1) ) )
& ~ ( ! [X1] :
( ordinal(X1)
=> succ(X1) != X0 )
& ~ being_limit_ordinal(X0) ) ) ),
inference(negated_conjecture,[],[f49]) ).
fof(f49,conjecture,
! [X0] :
( ordinal(X0)
=> ( ~ ( being_limit_ordinal(X0)
& ? [X1] :
( succ(X1) = X0
& ordinal(X1) ) )
& ~ ( ! [X1] :
( ordinal(X1)
=> succ(X1) != X0 )
& ~ being_limit_ordinal(X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t42_ordinal1) ).
fof(f707,plain,
being_limit_ordinal(sK4),
inference(subsumption_resolution,[],[f705,f192]) ).
fof(f192,plain,
ordinal(sK4),
inference(cnf_transformation,[],[f135]) ).
fof(f705,plain,
( being_limit_ordinal(sK4)
| ~ ordinal(sK4) ),
inference(duplicate_literal_removal,[],[f701]) ).
fof(f701,plain,
( ~ ordinal(sK4)
| being_limit_ordinal(sK4)
| being_limit_ordinal(sK4) ),
inference(resolution,[],[f700,f207]) ).
fof(f207,plain,
! [X0] :
( ~ in(succ(sK8(X0)),X0)
| ~ ordinal(X0)
| being_limit_ordinal(X0) ),
inference(cnf_transformation,[],[f144]) ).
fof(f144,plain,
! [X0] :
( ~ ordinal(X0)
| ( ( ! [X1] :
( ~ ordinal(X1)
| ~ in(X1,X0)
| in(succ(X1),X0) )
| ~ being_limit_ordinal(X0) )
& ( being_limit_ordinal(X0)
| ( ordinal(sK8(X0))
& in(sK8(X0),X0)
& ~ in(succ(sK8(X0)),X0) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK8])],[f142,f143]) ).
fof(f143,plain,
! [X0] :
( ? [X2] :
( ordinal(X2)
& in(X2,X0)
& ~ in(succ(X2),X0) )
=> ( ordinal(sK8(X0))
& in(sK8(X0),X0)
& ~ in(succ(sK8(X0)),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f142,plain,
! [X0] :
( ~ ordinal(X0)
| ( ( ! [X1] :
( ~ ordinal(X1)
| ~ in(X1,X0)
| in(succ(X1),X0) )
| ~ being_limit_ordinal(X0) )
& ( being_limit_ordinal(X0)
| ? [X2] :
( ordinal(X2)
& in(X2,X0)
& ~ in(succ(X2),X0) ) ) ) ),
inference(rectify,[],[f141]) ).
fof(f141,plain,
! [X0] :
( ~ ordinal(X0)
| ( ( ! [X1] :
( ~ ordinal(X1)
| ~ in(X1,X0)
| in(succ(X1),X0) )
| ~ being_limit_ordinal(X0) )
& ( being_limit_ordinal(X0)
| ? [X1] :
( ordinal(X1)
& in(X1,X0)
& ~ in(succ(X1),X0) ) ) ) ),
inference(nnf_transformation,[],[f115]) ).
fof(f115,plain,
! [X0] :
( ~ ordinal(X0)
| ( ! [X1] :
( ~ ordinal(X1)
| ~ in(X1,X0)
| in(succ(X1),X0) )
<=> being_limit_ordinal(X0) ) ),
inference(flattening,[],[f114]) ).
fof(f114,plain,
! [X0] :
( ( ! [X1] :
( in(succ(X1),X0)
| ~ in(X1,X0)
| ~ ordinal(X1) )
<=> being_limit_ordinal(X0) )
| ~ ordinal(X0) ),
inference(ennf_transformation,[],[f48]) ).
fof(f48,axiom,
! [X0] :
( ordinal(X0)
=> ( ! [X1] :
( ordinal(X1)
=> ( in(X1,X0)
=> in(succ(X1),X0) ) )
<=> being_limit_ordinal(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t41_ordinal1) ).
fof(f700,plain,
( in(succ(sK8(sK4)),sK4)
| being_limit_ordinal(sK4) ),
inference(subsumption_resolution,[],[f699,f192]) ).
fof(f699,plain,
( in(succ(sK8(sK4)),sK4)
| ~ ordinal(sK4)
| being_limit_ordinal(sK4) ),
inference(duplicate_literal_removal,[],[f697]) ).
fof(f697,plain,
( ~ ordinal(sK4)
| being_limit_ordinal(sK4)
| in(succ(sK8(sK4)),sK4)
| being_limit_ordinal(sK4) ),
inference(resolution,[],[f686,f209]) ).
fof(f209,plain,
! [X0] :
( ordinal(sK8(X0))
| being_limit_ordinal(X0)
| ~ ordinal(X0) ),
inference(cnf_transformation,[],[f144]) ).
fof(f686,plain,
( ~ ordinal(sK8(sK4))
| in(succ(sK8(sK4)),sK4)
| being_limit_ordinal(sK4) ),
inference(resolution,[],[f684,f226]) ).
fof(f226,plain,
! [X0] :
( epsilon_transitive(succ(X0))
| ~ ordinal(X0) ),
inference(cnf_transformation,[],[f98]) ).
fof(f98,plain,
! [X0] :
( ( ordinal(succ(X0))
& epsilon_connected(succ(X0))
& epsilon_transitive(succ(X0))
& ~ empty(succ(X0)) )
| ~ ordinal(X0) ),
inference(ennf_transformation,[],[f20]) ).
fof(f20,axiom,
! [X0] :
( ordinal(X0)
=> ( ordinal(succ(X0))
& epsilon_connected(succ(X0))
& epsilon_transitive(succ(X0))
& ~ empty(succ(X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc3_ordinal1) ).
fof(f684,plain,
( ~ epsilon_transitive(succ(sK8(sK4)))
| being_limit_ordinal(sK4)
| in(succ(sK8(sK4)),sK4) ),
inference(subsumption_resolution,[],[f682,f192]) ).
fof(f682,plain,
( ~ ordinal(sK4)
| ~ epsilon_transitive(succ(sK8(sK4)))
| being_limit_ordinal(sK4)
| in(succ(sK8(sK4)),sK4) ),
inference(resolution,[],[f681,f220]) ).
fof(f220,plain,
! [X0,X1] :
( ~ proper_subset(X0,X1)
| ~ epsilon_transitive(X0)
| ~ ordinal(X1)
| in(X0,X1) ),
inference(cnf_transformation,[],[f119]) ).
fof(f119,plain,
! [X0] :
( ! [X1] :
( in(X0,X1)
| ~ ordinal(X1)
| ~ proper_subset(X0,X1) )
| ~ epsilon_transitive(X0) ),
inference(flattening,[],[f118]) ).
fof(f118,plain,
! [X0] :
( ! [X1] :
( in(X0,X1)
| ~ proper_subset(X0,X1)
| ~ ordinal(X1) )
| ~ epsilon_transitive(X0) ),
inference(ennf_transformation,[],[f44]) ).
fof(f44,axiom,
! [X0] :
( epsilon_transitive(X0)
=> ! [X1] :
( ordinal(X1)
=> ( proper_subset(X0,X1)
=> in(X0,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t21_ordinal1) ).
fof(f681,plain,
( proper_subset(succ(sK8(sK4)),sK4)
| being_limit_ordinal(sK4) ),
inference(subsumption_resolution,[],[f680,f192]) ).
fof(f680,plain,
( ~ ordinal(sK4)
| proper_subset(succ(sK8(sK4)),sK4)
| being_limit_ordinal(sK4) ),
inference(duplicate_literal_removal,[],[f678]) ).
fof(f678,plain,
( being_limit_ordinal(sK4)
| proper_subset(succ(sK8(sK4)),sK4)
| ~ ordinal(sK4)
| being_limit_ordinal(sK4) ),
inference(resolution,[],[f677,f209]) ).
fof(f677,plain,
( ~ ordinal(sK8(sK4))
| being_limit_ordinal(sK4)
| proper_subset(succ(sK8(sK4)),sK4) ),
inference(subsumption_resolution,[],[f676,f195]) ).
fof(f195,plain,
! [X1] :
( succ(X1) != sK4
| ~ ordinal(X1)
| being_limit_ordinal(sK4) ),
inference(cnf_transformation,[],[f135]) ).
fof(f676,plain,
( proper_subset(succ(sK8(sK4)),sK4)
| ~ ordinal(sK8(sK4))
| being_limit_ordinal(sK4)
| sK4 = succ(sK8(sK4)) ),
inference(subsumption_resolution,[],[f674,f192]) ).
fof(f674,plain,
( sK4 = succ(sK8(sK4))
| proper_subset(succ(sK8(sK4)),sK4)
| ~ ordinal(sK4)
| ~ ordinal(sK8(sK4))
| being_limit_ordinal(sK4) ),
inference(resolution,[],[f607,f208]) ).
fof(f208,plain,
! [X0] :
( in(sK8(X0),X0)
| ~ ordinal(X0)
| being_limit_ordinal(X0) ),
inference(cnf_transformation,[],[f144]) ).
fof(f607,plain,
! [X1] :
( ~ in(X1,sK4)
| proper_subset(succ(X1),sK4)
| succ(X1) = sK4
| ~ ordinal(X1) ),
inference(subsumption_resolution,[],[f606,f228]) ).
fof(f228,plain,
! [X0] :
( ordinal(succ(X0))
| ~ ordinal(X0) ),
inference(cnf_transformation,[],[f98]) ).
fof(f606,plain,
! [X1] :
( ~ ordinal(succ(X1))
| proper_subset(succ(X1),sK4)
| succ(X1) = sK4
| ~ in(X1,sK4)
| ~ ordinal(X1) ),
inference(subsumption_resolution,[],[f598,f192]) ).
fof(f598,plain,
! [X1] :
( succ(X1) = sK4
| proper_subset(succ(X1),sK4)
| ~ ordinal(X1)
| ~ ordinal(sK4)
| ~ in(X1,sK4)
| ~ ordinal(succ(X1)) ),
inference(resolution,[],[f576,f259]) ).
fof(f259,plain,
! [X0,X1] :
( ordinal_subset(succ(X0),X1)
| ~ in(X0,X1)
| ~ ordinal(X0)
| ~ ordinal(X1) ),
inference(cnf_transformation,[],[f164]) ).
fof(f164,plain,
! [X0] :
( ~ ordinal(X0)
| ! [X1] :
( ( ( in(X0,X1)
| ~ ordinal_subset(succ(X0),X1) )
& ( ordinal_subset(succ(X0),X1)
| ~ in(X0,X1) ) )
| ~ ordinal(X1) ) ),
inference(nnf_transformation,[],[f90]) ).
fof(f90,plain,
! [X0] :
( ~ ordinal(X0)
| ! [X1] :
( ( in(X0,X1)
<=> ordinal_subset(succ(X0),X1) )
| ~ ordinal(X1) ) ),
inference(ennf_transformation,[],[f46]) ).
fof(f46,axiom,
! [X0] :
( ordinal(X0)
=> ! [X1] :
( ordinal(X1)
=> ( in(X0,X1)
<=> ordinal_subset(succ(X0),X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t33_ordinal1) ).
fof(f576,plain,
! [X6] :
( ~ ordinal_subset(X6,sK4)
| ~ ordinal(X6)
| sK4 = X6
| proper_subset(X6,sK4) ),
inference(resolution,[],[f406,f192]) ).
fof(f406,plain,
! [X2,X3] :
( ~ ordinal(X3)
| proper_subset(X2,X3)
| ~ ordinal_subset(X2,X3)
| X2 = X3
| ~ ordinal(X2) ),
inference(resolution,[],[f241,f248]) ).
fof(f248,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| proper_subset(X1,X0)
| X0 = X1 ),
inference(cnf_transformation,[],[f160]) ).
fof(f160,plain,
! [X0,X1] :
( X0 = X1
| ~ subset(X1,X0)
| proper_subset(X1,X0) ),
inference(rectify,[],[f106]) ).
fof(f106,plain,
! [X1,X0] :
( X0 = X1
| ~ subset(X0,X1)
| proper_subset(X0,X1) ),
inference(flattening,[],[f105]) ).
fof(f105,plain,
! [X0,X1] :
( proper_subset(X0,X1)
| X0 = X1
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f72]) ).
fof(f72,plain,
! [X0,X1] :
( ( X0 != X1
& subset(X0,X1) )
=> proper_subset(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f12]) ).
fof(f12,axiom,
! [X0,X1] :
( ( X0 != X1
& subset(X0,X1) )
<=> proper_subset(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d8_xboole_0) ).
fof(f241,plain,
! [X0,X1] :
( subset(X1,X0)
| ~ ordinal_subset(X1,X0)
| ~ ordinal(X1)
| ~ ordinal(X0) ),
inference(cnf_transformation,[],[f157]) ).
fof(f157,plain,
! [X0,X1] :
( ( ( subset(X1,X0)
| ~ ordinal_subset(X1,X0) )
& ( ordinal_subset(X1,X0)
| ~ subset(X1,X0) ) )
| ~ ordinal(X0)
| ~ ordinal(X1) ),
inference(nnf_transformation,[],[f103]) ).
fof(f103,plain,
! [X0,X1] :
( ( subset(X1,X0)
<=> ordinal_subset(X1,X0) )
| ~ ordinal(X0)
| ~ ordinal(X1) ),
inference(flattening,[],[f102]) ).
fof(f102,plain,
! [X0,X1] :
( ( subset(X1,X0)
<=> ordinal_subset(X1,X0) )
| ~ ordinal(X1)
| ~ ordinal(X0) ),
inference(ennf_transformation,[],[f59]) ).
fof(f59,plain,
! [X0,X1] :
( ( ordinal(X1)
& ordinal(X0) )
=> ( subset(X1,X0)
<=> ordinal_subset(X1,X0) ) ),
inference(rectify,[],[f38]) ).
fof(f38,axiom,
! [X1,X0] :
( ( ordinal(X0)
& ordinal(X1) )
=> ( ordinal_subset(X0,X1)
<=> subset(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_r1_ordinal1) ).
fof(f267,plain,
sF17 = succ(sK5),
introduced(function_definition,[]) ).
fof(f1045,plain,
in(succ(sK5),sK4),
inference(subsumption_resolution,[],[f1040,f709]) ).
fof(f709,plain,
ordinal(sK5),
inference(resolution,[],[f707,f196]) ).
fof(f196,plain,
( ~ being_limit_ordinal(sK4)
| ordinal(sK5) ),
inference(cnf_transformation,[],[f135]) ).
fof(f1040,plain,
( in(succ(sK5),sK4)
| ~ ordinal(sK5) ),
inference(resolution,[],[f711,f713]) ).
fof(f713,plain,
in(sK5,sK4),
inference(backward_demodulation,[],[f270,f708]) ).
fof(f270,plain,
in(sK5,sF17),
inference(superposition,[],[f229,f267]) ).
fof(f229,plain,
! [X0] : in(X0,succ(X0)),
inference(cnf_transformation,[],[f41]) ).
fof(f41,axiom,
! [X0] : in(X0,succ(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t10_ordinal1) ).
fof(f711,plain,
! [X0] :
( ~ in(X0,sK4)
| ~ ordinal(X0)
| in(succ(X0),sK4) ),
inference(subsumption_resolution,[],[f710,f192]) ).
fof(f710,plain,
! [X0] :
( ~ ordinal(X0)
| ~ ordinal(sK4)
| in(succ(X0),sK4)
| ~ in(X0,sK4) ),
inference(resolution,[],[f707,f210]) ).
fof(f210,plain,
! [X0,X1] :
( ~ being_limit_ordinal(X0)
| in(succ(X1),X0)
| ~ ordinal(X0)
| ~ ordinal(X1)
| ~ in(X1,X0) ),
inference(cnf_transformation,[],[f144]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU238+3 : TPTP v8.1.0. Released v3.2.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.14/0.35 % Computer : n020.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Aug 30 14:58:15 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.57 % (10774)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.21/0.57 % (10757)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.57 % (10766)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.21/0.57 % (10759)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.21/0.58 % (10759)Instruction limit reached!
% 0.21/0.58 % (10759)------------------------------
% 0.21/0.58 % (10759)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.58 % (10759)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.58 % (10759)Termination reason: Unknown
% 0.21/0.58 % (10759)Termination phase: Clausification
% 0.21/0.58
% 0.21/0.58 % (10759)Memory used [KB]: 1023
% 0.21/0.58 % (10759)Time elapsed: 0.005 s
% 0.21/0.58 % (10759)Instructions burned: 3 (million)
% 0.21/0.58 % (10759)------------------------------
% 0.21/0.58 % (10759)------------------------------
% 0.21/0.58 TRYING [1]
% 0.21/0.59 % (10773)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.21/0.59 % (10765)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.21/0.59 TRYING [2]
% 0.21/0.59 TRYING [3]
% 0.21/0.60 TRYING [4]
% 0.21/0.62 % (10753)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.21/0.62 % (10751)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.21/0.63 % (10754)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.21/0.63 % (10755)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.63 % (10756)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.21/0.63 % (10777)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.21/0.63 TRYING [5]
% 0.21/0.63 % (10769)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.21/0.64 % (10767)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)
% 0.21/0.64 % (10761)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.21/0.64 % (10758)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.21/0.64 % (10762)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.21/0.64 % (10763)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 2.06/0.64 % (10764)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 2.06/0.65 TRYING [1]
% 2.06/0.65 TRYING [2]
% 2.06/0.65 % (10778)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)
% 2.06/0.65 % (10779)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 2.06/0.65 % (10780)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)
% 2.06/0.65 TRYING [3]
% 2.06/0.65 % (10757)Instruction limit reached!
% 2.06/0.65 % (10757)------------------------------
% 2.06/0.65 % (10757)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 2.06/0.65 TRYING [4]
% 2.06/0.65 % (10775)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 2.06/0.66 % (10768)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 2.06/0.66 % (10757)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 2.06/0.66 % (10757)Termination reason: Unknown
% 2.06/0.66 % (10757)Termination phase: Finite model building SAT solving
% 2.06/0.66
% 2.06/0.66 % (10757)Memory used [KB]: 6780
% 2.06/0.66 % (10757)Time elapsed: 0.206 s
% 2.06/0.66 % (10757)Instructions burned: 51 (million)
% 2.06/0.66 % (10757)------------------------------
% 2.06/0.66 % (10757)------------------------------
% 2.06/0.66 % (10770)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)
% 2.06/0.66 % (10771)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)
% 2.06/0.66 % (10772)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 2.38/0.66 % (10752)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)
% 2.38/0.67 % (10766)First to succeed.
% 2.41/0.67 % (10758)Instruction limit reached!
% 2.41/0.67 % (10758)------------------------------
% 2.41/0.67 % (10758)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 2.41/0.67 % (10758)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 2.41/0.67 % (10758)Termination reason: Unknown
% 2.41/0.67 % (10758)Termination phase: Saturation
% 2.41/0.67
% 2.41/0.67 % (10758)Memory used [KB]: 5628
% 2.41/0.67 % (10758)Time elapsed: 0.234 s
% 2.41/0.67 % (10758)Instructions burned: 7 (million)
% 2.41/0.67 % (10758)------------------------------
% 2.41/0.67 % (10758)------------------------------
% 2.41/0.67 % (10766)Refutation found. Thanks to Tanya!
% 2.41/0.67 % SZS status Theorem for theBenchmark
% 2.41/0.67 % SZS output start Proof for theBenchmark
% See solution above
% 2.41/0.67 % (10766)------------------------------
% 2.41/0.67 % (10766)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 2.41/0.67 % (10766)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 2.41/0.67 % (10766)Termination reason: Refutation
% 2.41/0.67
% 2.41/0.67 % (10766)Memory used [KB]: 1407
% 2.41/0.67 % (10766)Time elapsed: 0.173 s
% 2.41/0.67 % (10766)Instructions burned: 37 (million)
% 2.41/0.67 % (10766)------------------------------
% 2.41/0.67 % (10766)------------------------------
% 2.41/0.67 % (10750)Success in time 0.311 s
%------------------------------------------------------------------------------