TSTP Solution File: SET162+4 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET162+4 : TPTP v8.1.2. Released v2.2.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 : 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 : Sun May 5 09:04:28 EDT 2024
% Result : Theorem 0.58s 0.75s
% Output : Refutation 0.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 45 ( 11 unt; 0 def)
% Number of atoms : 102 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 94 ( 37 ~; 35 |; 10 &)
% ( 6 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 53 ( 49 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f58,plain,
$false,
inference(avatar_sat_refutation,[],[f45,f51,f57]) ).
fof(f57,plain,
spl2_2,
inference(avatar_contradiction_clause,[],[f56]) ).
fof(f56,plain,
( $false
| spl2_2 ),
inference(subsumption_resolution,[],[f54,f52]) ).
fof(f52,plain,
( member(sK1(sK0,union(sK0,empty_set)),sK0)
| spl2_2 ),
inference(resolution,[],[f44,f34]) ).
fof(f34,plain,
! [X0,X1] :
( subset(X0,X1)
| member(sK1(X0,X1),X0) ),
inference(cnf_transformation,[],[f27]) ).
fof(f27,plain,
! [X0,X1] :
( subset(X0,X1)
| ( ~ member(sK1(X0,X1),X1)
& member(sK1(X0,X1),X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f21,f26]) ).
fof(f26,plain,
! [X0,X1] :
( ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) )
=> ( ~ member(sK1(X0,X1),X1)
& member(sK1(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f21,plain,
! [X0,X1] :
( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) ),
inference(ennf_transformation,[],[f17]) ).
fof(f17,plain,
! [X0,X1] :
( ! [X2] :
( member(X2,X0)
=> member(X2,X1) )
=> subset(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.TVLvW9LPxy/Vampire---4.8_31937',subset) ).
fof(f44,plain,
( ~ subset(sK0,union(sK0,empty_set))
| spl2_2 ),
inference(avatar_component_clause,[],[f42]) ).
fof(f42,plain,
( spl2_2
<=> subset(sK0,union(sK0,empty_set)) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
fof(f54,plain,
( ~ member(sK1(sK0,union(sK0,empty_set)),sK0)
| spl2_2 ),
inference(resolution,[],[f53,f30]) ).
fof(f30,plain,
! [X2,X0,X1] :
( member(X0,union(X1,X2))
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f25]) ).
fof(f25,plain,
! [X0,X1,X2] :
( ( member(X0,union(X1,X2))
| ( ~ member(X0,X2)
& ~ member(X0,X1) ) )
& ( member(X0,X2)
| member(X0,X1)
| ~ member(X0,union(X1,X2)) ) ),
inference(flattening,[],[f24]) ).
fof(f24,plain,
! [X0,X1,X2] :
( ( member(X0,union(X1,X2))
| ( ~ member(X0,X2)
& ~ member(X0,X1) ) )
& ( member(X0,X2)
| member(X0,X1)
| ~ member(X0,union(X1,X2)) ) ),
inference(nnf_transformation,[],[f14]) ).
fof(f14,plain,
! [X0,X1,X2] :
( member(X0,union(X1,X2))
<=> ( member(X0,X2)
| member(X0,X1) ) ),
inference(rectify,[],[f5]) ).
fof(f5,axiom,
! [X2,X0,X1] :
( member(X2,union(X0,X1))
<=> ( member(X2,X1)
| member(X2,X0) ) ),
file('/export/starexec/sandbox2/tmp/tmp.TVLvW9LPxy/Vampire---4.8_31937',union) ).
fof(f53,plain,
( ~ member(sK1(sK0,union(sK0,empty_set)),union(sK0,empty_set))
| spl2_2 ),
inference(resolution,[],[f44,f35]) ).
fof(f35,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ member(sK1(X0,X1),X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f51,plain,
spl2_1,
inference(avatar_contradiction_clause,[],[f50]) ).
fof(f50,plain,
( $false
| spl2_1 ),
inference(subsumption_resolution,[],[f49,f33]) ).
fof(f33,plain,
! [X0] : ~ member(X0,empty_set),
inference(cnf_transformation,[],[f15]) ).
fof(f15,plain,
! [X0] : ~ member(X0,empty_set),
inference(rectify,[],[f6]) ).
fof(f6,axiom,
! [X2] : ~ member(X2,empty_set),
file('/export/starexec/sandbox2/tmp/tmp.TVLvW9LPxy/Vampire---4.8_31937',empty_set) ).
fof(f49,plain,
( member(sK1(union(sK0,empty_set),sK0),empty_set)
| spl2_1 ),
inference(subsumption_resolution,[],[f48,f47]) ).
fof(f47,plain,
( ~ member(sK1(union(sK0,empty_set),sK0),sK0)
| spl2_1 ),
inference(resolution,[],[f40,f35]) ).
fof(f40,plain,
( ~ subset(union(sK0,empty_set),sK0)
| spl2_1 ),
inference(avatar_component_clause,[],[f38]) ).
fof(f38,plain,
( spl2_1
<=> subset(union(sK0,empty_set),sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
fof(f48,plain,
( member(sK1(union(sK0,empty_set),sK0),sK0)
| member(sK1(union(sK0,empty_set),sK0),empty_set)
| spl2_1 ),
inference(resolution,[],[f46,f29]) ).
fof(f29,plain,
! [X2,X0,X1] :
( ~ member(X0,union(X1,X2))
| member(X0,X1)
| member(X0,X2) ),
inference(cnf_transformation,[],[f25]) ).
fof(f46,plain,
( member(sK1(union(sK0,empty_set),sK0),union(sK0,empty_set))
| spl2_1 ),
inference(resolution,[],[f40,f34]) ).
fof(f45,plain,
( ~ spl2_1
| ~ spl2_2 ),
inference(avatar_split_clause,[],[f36,f42,f38]) ).
fof(f36,plain,
( ~ subset(sK0,union(sK0,empty_set))
| ~ subset(union(sK0,empty_set),sK0) ),
inference(resolution,[],[f28,f32]) ).
fof(f32,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f20]) ).
fof(f20,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(flattening,[],[f19]) ).
fof(f19,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f16]) ).
fof(f16,plain,
! [X0,X1] :
( ( subset(X1,X0)
& subset(X0,X1) )
=> equal_set(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f2,axiom,
! [X0,X1] :
( equal_set(X0,X1)
<=> ( subset(X1,X0)
& subset(X0,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.TVLvW9LPxy/Vampire---4.8_31937',equal_set) ).
fof(f28,plain,
~ equal_set(union(sK0,empty_set),sK0),
inference(cnf_transformation,[],[f23]) ).
fof(f23,plain,
~ equal_set(union(sK0,empty_set),sK0),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f18,f22]) ).
fof(f22,plain,
( ? [X0] : ~ equal_set(union(X0,empty_set),X0)
=> ~ equal_set(union(sK0,empty_set),sK0) ),
introduced(choice_axiom,[]) ).
fof(f18,plain,
? [X0] : ~ equal_set(union(X0,empty_set),X0),
inference(ennf_transformation,[],[f13]) ).
fof(f13,negated_conjecture,
~ ! [X0] : equal_set(union(X0,empty_set),X0),
inference(negated_conjecture,[],[f12]) ).
fof(f12,conjecture,
! [X0] : equal_set(union(X0,empty_set),X0),
file('/export/starexec/sandbox2/tmp/tmp.TVLvW9LPxy/Vampire---4.8_31937',thI18) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SET162+4 : TPTP v8.1.2. Released v2.2.0.
% 0.11/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.16/0.36 % Computer : n020.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Fri May 3 17:05:53 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.16/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.16/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/tmp/tmp.TVLvW9LPxy/Vampire---4.8_31937
% 0.58/0.74 % (32052)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2996ds/56Mi)
% 0.58/0.74 % (32052)First to succeed.
% 0.58/0.74 % (32045)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 Vampire---4 for (2996ds/34Mi)
% 0.58/0.74 % (32047)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.58/0.74 % (32049)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 Vampire---4 for (2996ds/34Mi)
% 0.58/0.74 % (32046)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 Vampire---4 for (2996ds/51Mi)
% 0.58/0.74 % (32050)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.58/0.74 % (32048)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.58/0.74 % (32051)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 Vampire---4 for (2996ds/83Mi)
% 0.58/0.74 % (32052)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-32044"
% 0.58/0.74 % (32045)Refutation not found, incomplete strategy% (32045)------------------------------
% 0.58/0.74 % (32045)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.74 % (32045)Termination reason: Refutation not found, incomplete strategy
% 0.58/0.74
% 0.58/0.74 % (32045)Memory used [KB]: 973
% 0.58/0.74 % (32045)Time elapsed: 0.002 s
% 0.58/0.74 % (32045)Instructions burned: 2 (million)
% 0.58/0.75 % (32050)Refutation not found, incomplete strategy% (32050)------------------------------
% 0.58/0.75 % (32050)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.75 % (32050)Termination reason: Refutation not found, incomplete strategy
% 0.58/0.75
% 0.58/0.75 % (32050)Memory used [KB]: 964
% 0.58/0.75 % (32050)Time elapsed: 0.003 s
% 0.58/0.75 % (32050)Instructions burned: 2 (million)
% 0.58/0.75 % (32052)Refutation found. Thanks to Tanya!
% 0.58/0.75 % SZS status Theorem for Vampire---4
% 0.58/0.75 % SZS output start Proof for Vampire---4
% See solution above
% 0.58/0.75 % (32052)------------------------------
% 0.58/0.75 % (32052)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.75 % (32052)Termination reason: Refutation
% 0.58/0.75
% 0.58/0.75 % (32052)Memory used [KB]: 996
% 0.58/0.75 % (32052)Time elapsed: 0.003 s
% 0.58/0.75 % (32052)Instructions burned: 3 (million)
% 0.58/0.75 % (32044)Success in time 0.376 s
% 0.58/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------