TSTP Solution File: SEU157+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU157+1 : TPTP v8.2.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n019.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 03:45:07 EDT 2024
% Result : Theorem 0.60s 0.84s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 12
% Syntax : Number of formulae : 66 ( 3 unt; 0 def)
% Number of atoms : 250 ( 60 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 298 ( 114 ~; 119 |; 52 &)
% ( 7 <=>; 5 =>; 0 <=; 1 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 4 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-3 aty)
% Number of variables : 165 ( 128 !; 37 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f162,plain,
$false,
inference(avatar_sat_refutation,[],[f65,f66,f67,f90,f160,f161]) ).
fof(f161,plain,
( spl11_3
| ~ spl11_1 ),
inference(avatar_split_clause,[],[f155,f54,f62]) ).
fof(f62,plain,
( spl11_3
<=> in(sK1,sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_3])]) ).
fof(f54,plain,
( spl11_1
<=> in(sF9,sF10) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_1])]) ).
fof(f155,plain,
( in(sK1,sK3)
| ~ spl11_1 ),
inference(subsumption_resolution,[],[f154,f55]) ).
fof(f55,plain,
( in(sF9,sF10)
| ~ spl11_1 ),
inference(avatar_component_clause,[],[f54]) ).
fof(f154,plain,
( ~ in(sF9,sF10)
| in(sK1,sK3) ),
inference(superposition,[],[f149,f49]) ).
fof(f49,plain,
cartesian_product2(sK2,sK3) = sF10,
introduced(function_definition,[new_symbols(definition,[sF10])]) ).
fof(f149,plain,
! [X0,X1] :
( ~ in(sF9,cartesian_product2(X0,X1))
| in(sK1,X1) ),
inference(duplicate_literal_removal,[],[f148]) ).
fof(f148,plain,
! [X0,X1] :
( in(sK1,X1)
| ~ in(sF9,cartesian_product2(X0,X1))
| ~ in(sF9,cartesian_product2(X0,X1)) ),
inference(superposition,[],[f46,f141]) ).
fof(f141,plain,
! [X0,X1] :
( sK1 = sK8(X0,X1,sF9)
| ~ in(sF9,cartesian_product2(X0,X1)) ),
inference(trivial_inequality_removal,[],[f137]) ).
fof(f137,plain,
! [X0,X1] :
( sF9 != sF9
| sK1 = sK8(X0,X1,sF9)
| ~ in(sF9,cartesian_product2(X0,X1)) ),
inference(superposition,[],[f74,f116]) ).
fof(f116,plain,
! [X0,X1] :
( sF9 = ordered_pair(sK0,sK8(X0,X1,sF9))
| ~ in(sF9,cartesian_product2(X0,X1)) ),
inference(duplicate_literal_removal,[],[f111]) ).
fof(f111,plain,
! [X0,X1] :
( sF9 = ordered_pair(sK0,sK8(X0,X1,sF9))
| ~ in(sF9,cartesian_product2(X0,X1))
| ~ in(sF9,cartesian_product2(X0,X1)) ),
inference(superposition,[],[f45,f109]) ).
fof(f109,plain,
! [X0,X1] :
( sK0 = sK7(X0,X1,sF9)
| ~ in(sF9,cartesian_product2(X0,X1)) ),
inference(equality_resolution,[],[f99]) ).
fof(f99,plain,
! [X2,X0,X1] :
( sF9 != X2
| sK0 = sK7(X0,X1,X2)
| ~ in(X2,cartesian_product2(X0,X1)) ),
inference(superposition,[],[f70,f45]) ).
fof(f70,plain,
! [X0,X1] :
( ordered_pair(X0,X1) != sF9
| sK0 = X0 ),
inference(superposition,[],[f41,f48]) ).
fof(f48,plain,
ordered_pair(sK0,sK1) = sF9,
introduced(function_definition,[new_symbols(definition,[sF9])]) ).
fof(f41,plain,
! [X2,X3,X0,X1] :
( ordered_pair(X0,X1) != ordered_pair(X2,X3)
| X0 = X2 ),
inference(cnf_transformation,[],[f18]) ).
fof(f18,plain,
! [X0,X1,X2,X3] :
( ( X1 = X3
& X0 = X2 )
| ordered_pair(X0,X1) != ordered_pair(X2,X3) ),
inference(ennf_transformation,[],[f14]) ).
fof(f14,axiom,
! [X0,X1,X2,X3] :
( ordered_pair(X0,X1) = ordered_pair(X2,X3)
=> ( X1 = X3
& X0 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t33_zfmisc_1) ).
fof(f45,plain,
! [X0,X1,X8] :
( ordered_pair(sK7(X0,X1,X8),sK8(X0,X1,X8)) = X8
| ~ in(X8,cartesian_product2(X0,X1)) ),
inference(equality_resolution,[],[f34]) ).
fof(f34,plain,
! [X2,X0,X1,X8] :
( ordered_pair(sK7(X0,X1,X8),sK8(X0,X1,X8)) = X8
| ~ in(X8,X2)
| cartesian_product2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f28]) ).
fof(f28,plain,
! [X0,X1,X2] :
( ( cartesian_product2(X0,X1) = X2
| ( ( ! [X4,X5] :
( ordered_pair(X4,X5) != sK4(X0,X1,X2)
| ~ in(X5,X1)
| ~ in(X4,X0) )
| ~ in(sK4(X0,X1,X2),X2) )
& ( ( sK4(X0,X1,X2) = ordered_pair(sK5(X0,X1,X2),sK6(X0,X1,X2))
& in(sK6(X0,X1,X2),X1)
& in(sK5(X0,X1,X2),X0) )
| in(sK4(X0,X1,X2),X2) ) ) )
& ( ! [X8] :
( ( in(X8,X2)
| ! [X9,X10] :
( ordered_pair(X9,X10) != X8
| ~ in(X10,X1)
| ~ in(X9,X0) ) )
& ( ( ordered_pair(sK7(X0,X1,X8),sK8(X0,X1,X8)) = X8
& in(sK8(X0,X1,X8),X1)
& in(sK7(X0,X1,X8),X0) )
| ~ in(X8,X2) ) )
| cartesian_product2(X0,X1) != X2 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6,sK7,sK8])],[f24,f27,f26,f25]) ).
fof(f25,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ! [X4,X5] :
( ordered_pair(X4,X5) != X3
| ~ in(X5,X1)
| ~ in(X4,X0) )
| ~ in(X3,X2) )
& ( ? [X6,X7] :
( ordered_pair(X6,X7) = X3
& in(X7,X1)
& in(X6,X0) )
| in(X3,X2) ) )
=> ( ( ! [X5,X4] :
( ordered_pair(X4,X5) != sK4(X0,X1,X2)
| ~ in(X5,X1)
| ~ in(X4,X0) )
| ~ in(sK4(X0,X1,X2),X2) )
& ( ? [X7,X6] :
( ordered_pair(X6,X7) = sK4(X0,X1,X2)
& in(X7,X1)
& in(X6,X0) )
| in(sK4(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f26,plain,
! [X0,X1,X2] :
( ? [X7,X6] :
( ordered_pair(X6,X7) = sK4(X0,X1,X2)
& in(X7,X1)
& in(X6,X0) )
=> ( sK4(X0,X1,X2) = ordered_pair(sK5(X0,X1,X2),sK6(X0,X1,X2))
& in(sK6(X0,X1,X2),X1)
& in(sK5(X0,X1,X2),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f27,plain,
! [X0,X1,X8] :
( ? [X11,X12] :
( ordered_pair(X11,X12) = X8
& in(X12,X1)
& in(X11,X0) )
=> ( ordered_pair(sK7(X0,X1,X8),sK8(X0,X1,X8)) = X8
& in(sK8(X0,X1,X8),X1)
& in(sK7(X0,X1,X8),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f24,plain,
! [X0,X1,X2] :
( ( cartesian_product2(X0,X1) = X2
| ? [X3] :
( ( ! [X4,X5] :
( ordered_pair(X4,X5) != X3
| ~ in(X5,X1)
| ~ in(X4,X0) )
| ~ in(X3,X2) )
& ( ? [X6,X7] :
( ordered_pair(X6,X7) = X3
& in(X7,X1)
& in(X6,X0) )
| in(X3,X2) ) ) )
& ( ! [X8] :
( ( in(X8,X2)
| ! [X9,X10] :
( ordered_pair(X9,X10) != X8
| ~ in(X10,X1)
| ~ in(X9,X0) ) )
& ( ? [X11,X12] :
( ordered_pair(X11,X12) = X8
& in(X12,X1)
& in(X11,X0) )
| ~ in(X8,X2) ) )
| cartesian_product2(X0,X1) != X2 ) ),
inference(rectify,[],[f23]) ).
fof(f23,plain,
! [X0,X1,X2] :
( ( cartesian_product2(X0,X1) = X2
| ? [X3] :
( ( ! [X4,X5] :
( ordered_pair(X4,X5) != X3
| ~ in(X5,X1)
| ~ in(X4,X0) )
| ~ in(X3,X2) )
& ( ? [X4,X5] :
( ordered_pair(X4,X5) = X3
& in(X5,X1)
& in(X4,X0) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ! [X4,X5] :
( ordered_pair(X4,X5) != X3
| ~ in(X5,X1)
| ~ in(X4,X0) ) )
& ( ? [X4,X5] :
( ordered_pair(X4,X5) = X3
& in(X5,X1)
& in(X4,X0) )
| ~ in(X3,X2) ) )
| cartesian_product2(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0,X1,X2] :
( cartesian_product2(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4,X5] :
( ordered_pair(X4,X5) = X3
& in(X5,X1)
& in(X4,X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_zfmisc_1) ).
fof(f74,plain,
! [X0,X1] :
( ordered_pair(X0,X1) != sF9
| sK1 = X1 ),
inference(superposition,[],[f42,f48]) ).
fof(f42,plain,
! [X2,X3,X0,X1] :
( ordered_pair(X0,X1) != ordered_pair(X2,X3)
| X1 = X3 ),
inference(cnf_transformation,[],[f18]) ).
fof(f46,plain,
! [X0,X1,X8] :
( in(sK8(X0,X1,X8),X1)
| ~ in(X8,cartesian_product2(X0,X1)) ),
inference(equality_resolution,[],[f33]) ).
fof(f33,plain,
! [X2,X0,X1,X8] :
( in(sK8(X0,X1,X8),X1)
| ~ in(X8,X2)
| cartesian_product2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f28]) ).
fof(f160,plain,
( spl11_2
| ~ spl11_1 ),
inference(avatar_split_clause,[],[f159,f54,f58]) ).
fof(f58,plain,
( spl11_2
<=> in(sK0,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_2])]) ).
fof(f159,plain,
( in(sK0,sK2)
| ~ spl11_1 ),
inference(subsumption_resolution,[],[f118,f55]) ).
fof(f118,plain,
( ~ in(sF9,sF10)
| in(sK0,sK2) ),
inference(superposition,[],[f114,f49]) ).
fof(f114,plain,
! [X0,X1] :
( ~ in(sF9,cartesian_product2(X0,X1))
| in(sK0,X0) ),
inference(duplicate_literal_removal,[],[f113]) ).
fof(f113,plain,
! [X0,X1] :
( in(sK0,X0)
| ~ in(sF9,cartesian_product2(X0,X1))
| ~ in(sF9,cartesian_product2(X0,X1)) ),
inference(superposition,[],[f47,f109]) ).
fof(f47,plain,
! [X0,X1,X8] :
( in(sK7(X0,X1,X8),X0)
| ~ in(X8,cartesian_product2(X0,X1)) ),
inference(equality_resolution,[],[f32]) ).
fof(f32,plain,
! [X2,X0,X1,X8] :
( in(sK7(X0,X1,X8),X0)
| ~ in(X8,X2)
| cartesian_product2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f28]) ).
fof(f90,plain,
( ~ spl11_3
| spl11_1
| ~ spl11_2 ),
inference(avatar_split_clause,[],[f89,f58,f54,f62]) ).
fof(f89,plain,
( in(sF9,sF10)
| ~ in(sK1,sK3)
| ~ spl11_2 ),
inference(subsumption_resolution,[],[f84,f59]) ).
fof(f59,plain,
( in(sK0,sK2)
| ~ spl11_2 ),
inference(avatar_component_clause,[],[f58]) ).
fof(f84,plain,
( in(sF9,sF10)
| ~ in(sK1,sK3)
| ~ in(sK0,sK2) ),
inference(superposition,[],[f81,f49]) ).
fof(f81,plain,
! [X0,X1] :
( in(sF9,cartesian_product2(X0,X1))
| ~ in(sK1,X1)
| ~ in(sK0,X0) ),
inference(superposition,[],[f44,f48]) ).
fof(f44,plain,
! [X10,X0,X1,X9] :
( in(ordered_pair(X9,X10),cartesian_product2(X0,X1))
| ~ in(X10,X1)
| ~ in(X9,X0) ),
inference(equality_resolution,[],[f43]) ).
fof(f43,plain,
! [X2,X10,X0,X1,X9] :
( in(ordered_pair(X9,X10),X2)
| ~ in(X10,X1)
| ~ in(X9,X0)
| cartesian_product2(X0,X1) != X2 ),
inference(equality_resolution,[],[f35]) ).
fof(f35,plain,
! [X2,X10,X0,X1,X8,X9] :
( in(X8,X2)
| ordered_pair(X9,X10) != X8
| ~ in(X10,X1)
| ~ in(X9,X0)
| cartesian_product2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f28]) ).
fof(f67,plain,
( spl11_1
| spl11_2 ),
inference(avatar_split_clause,[],[f52,f58,f54]) ).
fof(f52,plain,
( in(sK0,sK2)
| in(sF9,sF10) ),
inference(definition_folding,[],[f29,f49,f48]) ).
fof(f29,plain,
( in(sK0,sK2)
| in(ordered_pair(sK0,sK1),cartesian_product2(sK2,sK3)) ),
inference(cnf_transformation,[],[f22]) ).
fof(f22,plain,
( ( ~ in(sK1,sK3)
| ~ in(sK0,sK2)
| ~ in(ordered_pair(sK0,sK1),cartesian_product2(sK2,sK3)) )
& ( ( in(sK1,sK3)
& in(sK0,sK2) )
| in(ordered_pair(sK0,sK1),cartesian_product2(sK2,sK3)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f20,f21]) ).
fof(f21,plain,
( ? [X0,X1,X2,X3] :
( ( ~ in(X1,X3)
| ~ in(X0,X2)
| ~ in(ordered_pair(X0,X1),cartesian_product2(X2,X3)) )
& ( ( in(X1,X3)
& in(X0,X2) )
| in(ordered_pair(X0,X1),cartesian_product2(X2,X3)) ) )
=> ( ( ~ in(sK1,sK3)
| ~ in(sK0,sK2)
| ~ in(ordered_pair(sK0,sK1),cartesian_product2(sK2,sK3)) )
& ( ( in(sK1,sK3)
& in(sK0,sK2) )
| in(ordered_pair(sK0,sK1),cartesian_product2(sK2,sK3)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f20,plain,
? [X0,X1,X2,X3] :
( ( ~ in(X1,X3)
| ~ in(X0,X2)
| ~ in(ordered_pair(X0,X1),cartesian_product2(X2,X3)) )
& ( ( in(X1,X3)
& in(X0,X2) )
| in(ordered_pair(X0,X1),cartesian_product2(X2,X3)) ) ),
inference(flattening,[],[f19]) ).
fof(f19,plain,
? [X0,X1,X2,X3] :
( ( ~ in(X1,X3)
| ~ in(X0,X2)
| ~ in(ordered_pair(X0,X1),cartesian_product2(X2,X3)) )
& ( ( in(X1,X3)
& in(X0,X2) )
| in(ordered_pair(X0,X1),cartesian_product2(X2,X3)) ) ),
inference(nnf_transformation,[],[f16]) ).
fof(f16,plain,
? [X0,X1,X2,X3] :
( in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
<~> ( in(X1,X3)
& in(X0,X2) ) ),
inference(ennf_transformation,[],[f11]) ).
fof(f11,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
<=> ( in(X1,X3)
& in(X0,X2) ) ),
inference(negated_conjecture,[],[f10]) ).
fof(f10,conjecture,
! [X0,X1,X2,X3] :
( in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
<=> ( in(X1,X3)
& in(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l55_zfmisc_1) ).
fof(f66,plain,
( spl11_1
| spl11_3 ),
inference(avatar_split_clause,[],[f51,f62,f54]) ).
fof(f51,plain,
( in(sK1,sK3)
| in(sF9,sF10) ),
inference(definition_folding,[],[f30,f49,f48]) ).
fof(f30,plain,
( in(sK1,sK3)
| in(ordered_pair(sK0,sK1),cartesian_product2(sK2,sK3)) ),
inference(cnf_transformation,[],[f22]) ).
fof(f65,plain,
( ~ spl11_1
| ~ spl11_2
| ~ spl11_3 ),
inference(avatar_split_clause,[],[f50,f62,f58,f54]) ).
fof(f50,plain,
( ~ in(sK1,sK3)
| ~ in(sK0,sK2)
| ~ in(sF9,sF10) ),
inference(definition_folding,[],[f31,f49,f48]) ).
fof(f31,plain,
( ~ in(sK1,sK3)
| ~ in(sK0,sK2)
| ~ in(ordered_pair(sK0,sK1),cartesian_product2(sK2,sK3)) ),
inference(cnf_transformation,[],[f22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU157+1 : TPTP v8.2.0. Released v3.3.0.
% 0.07/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.13/0.35 % Computer : n019.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 : Sun May 19 16:27:23 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.13/0.35 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.60/0.82 % (11175)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.60/0.82 % (11173)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2995ds/34Mi)
% 0.60/0.82 % (11176)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2995ds/33Mi)
% 0.60/0.82 % (11174)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on theBenchmark for (2995ds/51Mi)
% 0.60/0.82 % (11177)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on theBenchmark for (2995ds/34Mi)
% 0.60/0.82 % (11178)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2995ds/45Mi)
% 0.60/0.82 % (11179)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on theBenchmark for (2995ds/83Mi)
% 0.60/0.82 % (11180)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2995ds/56Mi)
% 0.60/0.82 % (11178)Refutation not found, incomplete strategy% (11178)------------------------------
% 0.60/0.82 % (11178)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.82 % (11177)Refutation not found, incomplete strategy% (11177)------------------------------
% 0.60/0.82 % (11177)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.82 % (11177)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.82
% 0.60/0.82 % (11177)Memory used [KB]: 1042
% 0.60/0.82 % (11177)Time elapsed: 0.003 s
% 0.60/0.82 % (11177)Instructions burned: 3 (million)
% 0.60/0.82 % (11178)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.82 % (11180)Refutation not found, incomplete strategy% (11180)------------------------------
% 0.60/0.82 % (11180)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.82 % (11180)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.82
% 0.60/0.82 % (11180)Memory used [KB]: 1039
% 0.60/0.82 % (11180)Time elapsed: 0.003 s
% 0.60/0.82 % (11180)Instructions burned: 3 (million)
% 0.60/0.82
% 0.60/0.82 % (11178)Memory used [KB]: 974
% 0.60/0.82 % (11178)Time elapsed: 0.003 s
% 0.60/0.82 % (11178)Instructions burned: 3 (million)
% 0.60/0.82 % (11177)------------------------------
% 0.60/0.82 % (11177)------------------------------
% 0.60/0.82 % (11180)------------------------------
% 0.60/0.82 % (11180)------------------------------
% 0.60/0.82 % (11178)------------------------------
% 0.60/0.82 % (11178)------------------------------
% 0.60/0.83 % (11173)Refutation not found, incomplete strategy% (11173)------------------------------
% 0.60/0.83 % (11173)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.83 % (11173)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.83
% 0.60/0.83 % (11173)Memory used [KB]: 1059
% 0.60/0.83 % (11173)Time elapsed: 0.005 s
% 0.60/0.83 % (11173)Instructions burned: 5 (million)
% 0.60/0.83 % (11173)------------------------------
% 0.60/0.83 % (11173)------------------------------
% 0.60/0.83 % (11181)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on theBenchmark for (2995ds/55Mi)
% 0.60/0.83 % (11183)lrs+1010_1:2_sil=4000:tgt=ground:nwc=10.0:st=2.0:i=208:sd=1:bd=off:ss=axioms_0 on theBenchmark for (2995ds/208Mi)
% 0.60/0.83 % (11182)dis+3_25:4_sil=16000:sos=all:erd=off:i=50:s2at=4.0:bd=off:nm=60:sup=off:cond=on:av=off:ins=2:nwc=10.0:etr=on:to=lpo:s2agt=20:fd=off:bsr=unit_only:slsq=on:slsqr=28,19:awrs=converge:awrsf=500:tgt=ground:bs=unit_only_0 on theBenchmark for (2995ds/50Mi)
% 0.60/0.83 % (11184)lrs-1011_1:1_sil=4000:plsq=on:plsqr=32,1:sp=frequency:plsql=on:nwc=10.0:i=52:aac=none:afr=on:ss=axioms:er=filter:sgt=16:rawr=on:etr=on:lma=on_0 on theBenchmark for (2995ds/52Mi)
% 0.60/0.83 % (11183)First to succeed.
% 0.60/0.83 % (11183)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-11172"
% 0.60/0.84 % (11183)Refutation found. Thanks to Tanya!
% 0.60/0.84 % SZS status Theorem for theBenchmark
% 0.60/0.84 % SZS output start Proof for theBenchmark
% See solution above
% 0.60/0.84 % (11183)------------------------------
% 0.60/0.84 % (11183)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.84 % (11183)Termination reason: Refutation
% 0.60/0.84
% 0.60/0.84 % (11183)Memory used [KB]: 1080
% 0.60/0.84 % (11183)Time elapsed: 0.008 s
% 0.60/0.84 % (11183)Instructions burned: 11 (million)
% 0.60/0.84 % (11172)Success in time 0.48 s
% 0.60/0.84 % Vampire---4.8 exiting
%------------------------------------------------------------------------------