TSTP Solution File: SEV517+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV517+1 : TPTP v8.2.0. Released v7.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 : n028.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 04:14:04 EDT 2024
% Result : Theorem 0.65s 0.82s
% Output : Refutation 0.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 51 ( 7 unt; 0 def)
% Number of atoms : 188 ( 12 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 210 ( 73 ~; 62 |; 49 &)
% ( 8 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 121 ( 97 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f161,plain,
$false,
inference(avatar_sat_refutation,[],[f122,f144,f160]) ).
fof(f160,plain,
( ~ spl9_1
| ~ spl9_2 ),
inference(avatar_contradiction_clause,[],[f159]) ).
fof(f159,plain,
( $false
| ~ spl9_1
| ~ spl9_2 ),
inference(subsumption_resolution,[],[f153,f98]) ).
fof(f98,plain,
~ member(sK0,sK2),
inference(resolution,[],[f65,f60]) ).
fof(f60,plain,
member(sK0,difference(sK1,sK2)),
inference(cnf_transformation,[],[f39]) ).
fof(f39,plain,
( ! [X4] :
( ~ member(sK0,X4)
| ~ member(X4,difference(sK3,singleton(sK2))) )
& partition(sK3,sK1)
& member(sK0,difference(sK1,sK2)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f34,f38]) ).
fof(f38,plain,
( ? [X0,X1,X2,X3] :
( ! [X4] :
( ~ member(X0,X4)
| ~ member(X4,difference(X3,singleton(X2))) )
& partition(X3,X1)
& member(X0,difference(X1,X2)) )
=> ( ! [X4] :
( ~ member(sK0,X4)
| ~ member(X4,difference(sK3,singleton(sK2))) )
& partition(sK3,sK1)
& member(sK0,difference(sK1,sK2)) ) ),
introduced(choice_axiom,[]) ).
fof(f34,plain,
? [X0,X1,X2,X3] :
( ! [X4] :
( ~ member(X0,X4)
| ~ member(X4,difference(X3,singleton(X2))) )
& partition(X3,X1)
& member(X0,difference(X1,X2)) ),
inference(flattening,[],[f33]) ).
fof(f33,plain,
? [X0,X1,X2,X3] :
( ! [X4] :
( ~ member(X0,X4)
| ~ member(X4,difference(X3,singleton(X2))) )
& partition(X3,X1)
& member(X0,difference(X1,X2)) ),
inference(ennf_transformation,[],[f22]) ).
fof(f22,plain,
~ ! [X0,X1,X2,X3] :
( ( partition(X3,X1)
& member(X0,difference(X1,X2)) )
=> ? [X4] :
( member(X0,X4)
& member(X4,difference(X3,singleton(X2))) ) ),
inference(rectify,[],[f21]) ).
fof(f21,negated_conjecture,
~ ! [X2,X0,X1,X10] :
( ( partition(X10,X0)
& member(X2,difference(X0,X1)) )
=> ? [X11] :
( member(X2,X11)
& member(X11,difference(X10,singleton(X1))) ) ),
inference(negated_conjecture,[],[f20]) ).
fof(f20,conjecture,
! [X2,X0,X1,X10] :
( ( partition(X10,X0)
& member(X2,difference(X0,X1)) )
=> ? [X11] :
( member(X2,X11)
& member(X11,difference(X10,singleton(X1))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',diff_elem_in_partition) ).
fof(f65,plain,
! [X2,X0,X1] :
( ~ member(X0,difference(X2,X1))
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f41]) ).
fof(f41,plain,
! [X0,X1,X2] :
( ( member(X0,difference(X2,X1))
| member(X0,X1)
| ~ member(X0,X2) )
& ( ( ~ member(X0,X1)
& member(X0,X2) )
| ~ member(X0,difference(X2,X1)) ) ),
inference(flattening,[],[f40]) ).
fof(f40,plain,
! [X0,X1,X2] :
( ( member(X0,difference(X2,X1))
| member(X0,X1)
| ~ member(X0,X2) )
& ( ( ~ member(X0,X1)
& member(X0,X2) )
| ~ member(X0,difference(X2,X1)) ) ),
inference(nnf_transformation,[],[f24]) ).
fof(f24,plain,
! [X0,X1,X2] :
( member(X0,difference(X2,X1))
<=> ( ~ member(X0,X1)
& member(X0,X2) ) ),
inference(rectify,[],[f7]) ).
fof(f7,axiom,
! [X1,X0,X3] :
( member(X1,difference(X3,X0))
<=> ( ~ member(X1,X0)
& member(X1,X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',difference) ).
fof(f153,plain,
( member(sK0,sK2)
| ~ spl9_1
| ~ spl9_2 ),
inference(backward_demodulation,[],[f116,f152]) ).
fof(f152,plain,
( sK2 = sK4(sK3,sK0)
| ~ spl9_2 ),
inference(resolution,[],[f121,f71]) ).
fof(f71,plain,
! [X0,X1] :
( ~ member(X0,singleton(X1))
| X0 = X1 ),
inference(cnf_transformation,[],[f44]) ).
fof(f44,plain,
! [X0,X1] :
( ( member(X0,singleton(X1))
| X0 != X1 )
& ( X0 = X1
| ~ member(X0,singleton(X1)) ) ),
inference(nnf_transformation,[],[f27]) ).
fof(f27,plain,
! [X0,X1] :
( member(X0,singleton(X1))
<=> X0 = X1 ),
inference(rectify,[],[f8]) ).
fof(f8,axiom,
! [X2,X0] :
( member(X2,singleton(X0))
<=> X0 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',singleton) ).
fof(f121,plain,
( member(sK4(sK3,sK0),singleton(sK2))
| ~ spl9_2 ),
inference(avatar_component_clause,[],[f119]) ).
fof(f119,plain,
( spl9_2
<=> member(sK4(sK3,sK0),singleton(sK2)) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_2])]) ).
fof(f116,plain,
( member(sK0,sK4(sK3,sK0))
| ~ spl9_1 ),
inference(avatar_component_clause,[],[f115]) ).
fof(f115,plain,
( spl9_1
<=> member(sK0,sK4(sK3,sK0)) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_1])]) ).
fof(f144,plain,
spl9_1,
inference(avatar_contradiction_clause,[],[f143]) ).
fof(f143,plain,
( $false
| spl9_1 ),
inference(subsumption_resolution,[],[f142,f97]) ).
fof(f97,plain,
member(sK0,sK1),
inference(resolution,[],[f64,f60]) ).
fof(f64,plain,
! [X2,X0,X1] :
( ~ member(X0,difference(X2,X1))
| member(X0,X2) ),
inference(cnf_transformation,[],[f41]) ).
fof(f142,plain,
( ~ member(sK0,sK1)
| spl9_1 ),
inference(resolution,[],[f129,f61]) ).
fof(f61,plain,
partition(sK3,sK1),
inference(cnf_transformation,[],[f39]) ).
fof(f129,plain,
( ! [X0] :
( ~ partition(sK3,X0)
| ~ member(sK0,X0) )
| spl9_1 ),
inference(resolution,[],[f117,f69]) ).
fof(f69,plain,
! [X0,X1,X5] :
( member(X5,sK4(X0,X5))
| ~ member(X5,X1)
| ~ partition(X0,X1) ),
inference(cnf_transformation,[],[f43]) ).
fof(f43,plain,
! [X0,X1] :
( ( ! [X2,X3] :
( X2 = X3
| ! [X4] :
( ~ member(X4,X3)
| ~ member(X4,X2) )
| ~ member(X3,X0)
| ~ member(X2,X0) )
& ! [X5] :
( ( member(X5,sK4(X0,X5))
& member(sK4(X0,X5),X0) )
| ~ member(X5,X1) )
& ! [X7] :
( subset(X7,X1)
| ~ member(X7,X0) ) )
| ~ partition(X0,X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f36,f42]) ).
fof(f42,plain,
! [X0,X5] :
( ? [X6] :
( member(X5,X6)
& member(X6,X0) )
=> ( member(X5,sK4(X0,X5))
& member(sK4(X0,X5),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f36,plain,
! [X0,X1] :
( ( ! [X2,X3] :
( X2 = X3
| ! [X4] :
( ~ member(X4,X3)
| ~ member(X4,X2) )
| ~ member(X3,X0)
| ~ member(X2,X0) )
& ! [X5] :
( ? [X6] :
( member(X5,X6)
& member(X6,X0) )
| ~ member(X5,X1) )
& ! [X7] :
( subset(X7,X1)
| ~ member(X7,X0) ) )
| ~ partition(X0,X1) ),
inference(flattening,[],[f35]) ).
fof(f35,plain,
! [X0,X1] :
( ( ! [X2,X3] :
( X2 = X3
| ! [X4] :
( ~ member(X4,X3)
| ~ member(X4,X2) )
| ~ member(X3,X0)
| ~ member(X2,X0) )
& ! [X5] :
( ? [X6] :
( member(X5,X6)
& member(X6,X0) )
| ~ member(X5,X1) )
& ! [X7] :
( subset(X7,X1)
| ~ member(X7,X0) ) )
| ~ partition(X0,X1) ),
inference(ennf_transformation,[],[f32]) ).
fof(f32,plain,
! [X0,X1] :
( partition(X0,X1)
=> ( ! [X2,X3] :
( ( member(X3,X0)
& member(X2,X0) )
=> ( ? [X4] :
( member(X4,X3)
& member(X4,X2) )
=> X2 = X3 ) )
& ! [X5] :
( member(X5,X1)
=> ? [X6] :
( member(X5,X6)
& member(X6,X0) ) )
& ! [X7] :
( member(X7,X0)
=> subset(X7,X1) ) ) ),
inference(unused_predicate_definition_removal,[],[f26]) ).
fof(f26,plain,
! [X0,X1] :
( partition(X0,X1)
<=> ( ! [X2,X3] :
( ( member(X3,X0)
& member(X2,X0) )
=> ( ? [X4] :
( member(X4,X3)
& member(X4,X2) )
=> X2 = X3 ) )
& ! [X5] :
( member(X5,X1)
=> ? [X6] :
( member(X5,X6)
& member(X6,X0) ) )
& ! [X7] :
( member(X7,X0)
=> subset(X7,X1) ) ) ),
inference(rectify,[],[f13]) ).
fof(f13,axiom,
! [X0,X3] :
( partition(X0,X3)
<=> ( ! [X2,X4] :
( ( member(X4,X0)
& member(X2,X0) )
=> ( ? [X5] :
( member(X5,X4)
& member(X5,X2) )
=> X2 = X4 ) )
& ! [X2] :
( member(X2,X3)
=> ? [X4] :
( member(X2,X4)
& member(X4,X0) ) )
& ! [X2] :
( member(X2,X0)
=> subset(X2,X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',partition) ).
fof(f117,plain,
( ~ member(sK0,sK4(sK3,sK0))
| spl9_1 ),
inference(avatar_component_clause,[],[f115]) ).
fof(f122,plain,
( ~ spl9_1
| spl9_2 ),
inference(avatar_split_clause,[],[f112,f119,f115]) ).
fof(f112,plain,
( member(sK4(sK3,sK0),singleton(sK2))
| ~ member(sK0,sK4(sK3,sK0)) ),
inference(resolution,[],[f111,f107]) ).
fof(f107,plain,
! [X0] :
( ~ member(X0,sK3)
| member(X0,singleton(sK2))
| ~ member(sK0,X0) ),
inference(resolution,[],[f66,f62]) ).
fof(f62,plain,
! [X4] :
( ~ member(X4,difference(sK3,singleton(sK2)))
| ~ member(sK0,X4) ),
inference(cnf_transformation,[],[f39]) ).
fof(f66,plain,
! [X2,X0,X1] :
( member(X0,difference(X2,X1))
| member(X0,X1)
| ~ member(X0,X2) ),
inference(cnf_transformation,[],[f41]) ).
fof(f111,plain,
member(sK4(sK3,sK0),sK3),
inference(resolution,[],[f110,f97]) ).
fof(f110,plain,
! [X0] :
( ~ member(X0,sK1)
| member(sK4(sK3,X0),sK3) ),
inference(resolution,[],[f68,f61]) ).
fof(f68,plain,
! [X0,X1,X5] :
( ~ partition(X0,X1)
| ~ member(X5,X1)
| member(sK4(X0,X5),X0) ),
inference(cnf_transformation,[],[f43]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SEV517+1 : TPTP v8.2.0. Released v7.3.0.
% 0.04/0.15 % 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.15/0.36 % Computer : n028.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Sun May 19 18:36:53 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.36 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 % (21153)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 % (21155)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 % (21156)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 % (21157)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 % (21154)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 % (21158)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 % (21159)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 % (21160)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 % (21153)Refutation not found, incomplete strategy% (21153)------------------------------
% 0.60/0.82 % (21153)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.82 % (21153)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.82
% 0.60/0.82 % (21153)Memory used [KB]: 1088
% 0.60/0.82 % (21153)Time elapsed: 0.003 s
% 0.60/0.82 % (21153)Instructions burned: 4 (million)
% 0.60/0.82 % (21153)------------------------------
% 0.60/0.82 % (21153)------------------------------
% 0.60/0.82 % (21161)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.82 % (21155)First to succeed.
% 0.65/0.82 % (21155)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-21152"
% 0.65/0.82 % (21156)Also succeeded, but the first one will report.
% 0.65/0.82 % (21155)Refutation found. Thanks to Tanya!
% 0.65/0.82 % SZS status Theorem for theBenchmark
% 0.65/0.82 % SZS output start Proof for theBenchmark
% See solution above
% 0.65/0.82 % (21155)------------------------------
% 0.65/0.82 % (21155)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.65/0.82 % (21155)Termination reason: Refutation
% 0.65/0.82
% 0.65/0.82 % (21155)Memory used [KB]: 1128
% 0.65/0.82 % (21155)Time elapsed: 0.007 s
% 0.65/0.82 % (21155)Instructions burned: 9 (million)
% 0.65/0.82 % (21152)Success in time 0.448 s
% 0.65/0.82 % Vampire---4.8 exiting
%------------------------------------------------------------------------------