TSTP Solution File: SET016-6 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET016-6 : TPTP v8.2.0. Bugfixed v2.1.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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n023.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:07:45 EDT 2024
% Result : Unsatisfiable 0.63s 0.86s
% Output : Refutation 0.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 15
% Syntax : Number of formulae : 43 ( 12 unt; 0 def)
% Number of atoms : 83 ( 18 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 71 ( 31 ~; 34 |; 0 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 7 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 14 ( 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f462,plain,
$false,
inference(avatar_sat_refutation,[],[f159,f356,f391,f412,f424,f458,f461]) ).
fof(f461,plain,
spl0_1,
inference(avatar_contradiction_clause,[],[f459]) ).
fof(f459,plain,
( $false
| spl0_1 ),
inference(resolution,[],[f154,f11]) ).
fof(f11,axiom,
! [X0,X1] : member(unordered_pair(X0,X1),universal_class),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unordered_pairs_in_universal) ).
fof(f154,plain,
( ~ member(unordered_pair(y,y),universal_class)
| spl0_1 ),
inference(avatar_component_clause,[],[f152]) ).
fof(f152,plain,
( spl0_1
<=> member(unordered_pair(y,y),universal_class) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).
fof(f458,plain,
( ~ spl0_31
| ~ spl0_26
| spl0_32 ),
inference(avatar_split_clause,[],[f455,f388,f353,f384]) ).
fof(f384,plain,
( spl0_31
<=> member(w,universal_class) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_31])]) ).
fof(f353,plain,
( spl0_26
<=> unordered_pair(w,w) = unordered_pair(y,y) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_26])]) ).
fof(f388,plain,
( spl0_32
<=> member(w,unordered_pair(y,y)) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_32])]) ).
fof(f455,plain,
( ~ member(w,universal_class)
| ~ spl0_26
| spl0_32 ),
inference(resolution,[],[f446,f10]) ).
fof(f10,axiom,
! [X0,X1] :
( member(X1,unordered_pair(X0,X1))
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unordered_pair3) ).
fof(f446,plain,
( ~ member(w,unordered_pair(w,w))
| ~ spl0_26
| spl0_32 ),
inference(superposition,[],[f389,f355]) ).
fof(f355,plain,
( unordered_pair(w,w) = unordered_pair(y,y)
| ~ spl0_26 ),
inference(avatar_component_clause,[],[f353]) ).
fof(f389,plain,
( ~ member(w,unordered_pair(y,y))
| spl0_32 ),
inference(avatar_component_clause,[],[f388]) ).
fof(f424,plain,
~ spl0_32,
inference(avatar_contradiction_clause,[],[f423]) ).
fof(f423,plain,
( $false
| ~ spl0_32 ),
inference(trivial_inequality_removal,[],[f422]) ).
fof(f422,plain,
( w != w
| ~ spl0_32 ),
inference(superposition,[],[f94,f417]) ).
fof(f417,plain,
( w = y
| ~ spl0_32 ),
inference(duplicate_literal_removal,[],[f416]) ).
fof(f416,plain,
( w = y
| w = y
| ~ spl0_32 ),
inference(resolution,[],[f390,f8]) ).
fof(f8,axiom,
! [X2,X0,X1] :
( ~ member(X2,unordered_pair(X0,X1))
| X0 = X2
| X1 = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unordered_pair_member) ).
fof(f390,plain,
( member(w,unordered_pair(y,y))
| ~ spl0_32 ),
inference(avatar_component_clause,[],[f388]) ).
fof(f94,axiom,
w != y,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ordered_pair_determines_components1_3) ).
fof(f412,plain,
spl0_31,
inference(avatar_contradiction_clause,[],[f410]) ).
fof(f410,plain,
( $false
| spl0_31 ),
inference(resolution,[],[f386,f93]) ).
fof(f93,axiom,
member(w,universal_class),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ordered_pair_determines_components1_2) ).
fof(f386,plain,
( ~ member(w,universal_class)
| spl0_31 ),
inference(avatar_component_clause,[],[f384]) ).
fof(f391,plain,
( ~ spl0_31
| spl0_32
| ~ spl0_25 ),
inference(avatar_split_clause,[],[f370,f349,f388,f384]) ).
fof(f349,plain,
( spl0_25
<=> unordered_pair(w,unordered_pair(x,x)) = unordered_pair(y,y) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_25])]) ).
fof(f370,plain,
( member(w,unordered_pair(y,y))
| ~ member(w,universal_class)
| ~ spl0_25 ),
inference(superposition,[],[f9,f351]) ).
fof(f351,plain,
( unordered_pair(w,unordered_pair(x,x)) = unordered_pair(y,y)
| ~ spl0_25 ),
inference(avatar_component_clause,[],[f349]) ).
fof(f9,axiom,
! [X0,X1] :
( member(X0,unordered_pair(X0,X1))
| ~ member(X0,universal_class) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unordered_pair2) ).
fof(f356,plain,
( spl0_25
| spl0_26
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f341,f156,f353,f349]) ).
fof(f156,plain,
( spl0_2
<=> member(unordered_pair(y,y),unordered_pair(unordered_pair(w,w),unordered_pair(w,unordered_pair(x,x)))) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).
fof(f341,plain,
( unordered_pair(w,w) = unordered_pair(y,y)
| unordered_pair(w,unordered_pair(x,x)) = unordered_pair(y,y)
| ~ spl0_2 ),
inference(resolution,[],[f8,f158]) ).
fof(f158,plain,
( member(unordered_pair(y,y),unordered_pair(unordered_pair(w,w),unordered_pair(w,unordered_pair(x,x))))
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f156]) ).
fof(f159,plain,
( ~ spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f150,f156,f152]) ).
fof(f150,plain,
( member(unordered_pair(y,y),unordered_pair(unordered_pair(w,w),unordered_pair(w,unordered_pair(x,x))))
| ~ member(unordered_pair(y,y),universal_class) ),
inference(superposition,[],[f9,f143]) ).
fof(f143,plain,
unordered_pair(unordered_pair(w,w),unordered_pair(w,unordered_pair(x,x))) = unordered_pair(unordered_pair(y,y),unordered_pair(y,unordered_pair(z,z))),
inference(definition_unfolding,[],[f92,f99,f99]) ).
fof(f99,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),
inference(definition_unfolding,[],[f13,f12,f12]) ).
fof(f12,axiom,
! [X0] : unordered_pair(X0,X0) = singleton(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',singleton_set) ).
fof(f13,axiom,
! [X0,X1] : unordered_pair(singleton(X0),unordered_pair(X0,singleton(X1))) = ordered_pair(X0,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ordered_pair) ).
fof(f92,axiom,
ordered_pair(w,x) = ordered_pair(y,z),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ordered_pair_determines_components1_1) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SET016-6 : TPTP v8.2.0. Bugfixed v2.1.0.
% 0.11/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.13/0.34 % Computer : n023.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 12:42:08 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.34 This is a CNF_UNS_RFO_SEQ_NHN problem
% 0.13/0.34 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.63/0.84 % (11621)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.63/0.84 % (11620)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.63/0.84 % (11618)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.63/0.84 % (11619)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.63/0.84 % (11622)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.63/0.84 % (11623)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.63/0.84 % (11625)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.63/0.84 % (11624)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.63/0.84 % (11625)Refutation not found, incomplete strategy% (11625)------------------------------
% 0.63/0.84 % (11625)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.63/0.84 % (11625)Termination reason: Refutation not found, incomplete strategy
% 0.63/0.84
% 0.63/0.84 % (11625)Memory used [KB]: 1063
% 0.63/0.84 % (11625)Time elapsed: 0.002 s
% 0.63/0.84 % (11625)Instructions burned: 2 (million)
% 0.63/0.84 % (11620)Refutation not found, incomplete strategy% (11620)------------------------------
% 0.63/0.84 % (11620)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.63/0.84 % (11620)Termination reason: Refutation not found, incomplete strategy
% 0.63/0.84
% 0.63/0.84 % (11620)Memory used [KB]: 1077
% 0.63/0.84 % (11620)Time elapsed: 0.003 s
% 0.63/0.84 % (11620)Instructions burned: 2 (million)
% 0.63/0.84 % (11625)------------------------------
% 0.63/0.84 % (11625)------------------------------
% 0.63/0.84 % (11620)------------------------------
% 0.63/0.84 % (11620)------------------------------
% 0.63/0.84 % (11623)Refutation not found, incomplete strategy% (11623)------------------------------
% 0.63/0.84 % (11623)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.63/0.84 % (11623)Termination reason: Refutation not found, incomplete strategy
% 0.63/0.84
% 0.63/0.84 % (11623)Memory used [KB]: 1099
% 0.63/0.84 % (11623)Time elapsed: 0.004 s
% 0.63/0.84 % (11623)Instructions burned: 3 (million)
% 0.63/0.84 % (11623)------------------------------
% 0.63/0.84 % (11623)------------------------------
% 0.63/0.85 % (11626)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.63/0.85 % (11627)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.63/0.85 % (11618)Refutation not found, incomplete strategy% (11618)------------------------------
% 0.63/0.85 % (11618)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.63/0.85 % (11618)Termination reason: Refutation not found, incomplete strategy
% 0.63/0.85
% 0.63/0.85 % (11618)Memory used [KB]: 1107
% 0.63/0.85 % (11618)Time elapsed: 0.008 s
% 0.63/0.85 % (11618)Instructions burned: 10 (million)
% 0.63/0.85 % (11628)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.63/0.85 % (11618)------------------------------
% 0.63/0.85 % (11618)------------------------------
% 0.63/0.85 % (11629)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.63/0.85 % (11629)Refutation not found, incomplete strategy% (11629)------------------------------
% 0.63/0.85 % (11629)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.63/0.85 % (11629)Termination reason: Refutation not found, incomplete strategy
% 0.63/0.85
% 0.63/0.85 % (11629)Memory used [KB]: 1078
% 0.63/0.85 % (11629)Time elapsed: 0.003 s
% 0.63/0.85 % (11629)Instructions burned: 2 (million)
% 0.63/0.85 % (11619)First to succeed.
% 0.63/0.85 % (11629)------------------------------
% 0.63/0.85 % (11629)------------------------------
% 0.63/0.86 % (11619)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-11617"
% 0.63/0.86 % (11619)Refutation found. Thanks to Tanya!
% 0.63/0.86 % SZS status Unsatisfiable for theBenchmark
% 0.63/0.86 % SZS output start Proof for theBenchmark
% See solution above
% 0.63/0.86 % (11619)------------------------------
% 0.63/0.86 % (11619)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.63/0.86 % (11619)Termination reason: Refutation
% 0.63/0.86
% 0.63/0.86 % (11619)Memory used [KB]: 1267
% 0.63/0.86 % (11619)Time elapsed: 0.015 s
% 0.63/0.86 % (11619)Instructions burned: 19 (million)
% 0.63/0.86 % (11617)Success in time 0.506 s
% 0.63/0.86 % Vampire---4.8 exiting
%------------------------------------------------------------------------------