TSTP Solution File: SET605+3 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET605+3 : 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 : n005.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:07:31 EDT 2024
% Result : Theorem 0.78s 0.94s
% Output : Refutation 0.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 14 ( 9 unt; 0 def)
% Number of atoms : 21 ( 12 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 19 ( 12 ~; 4 |; 1 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 18 ( 14 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f62,plain,
$false,
inference(subsumption_resolution,[],[f61,f45]) ).
fof(f45,plain,
! [X0,X1] : subset(X0,union(X0,X1)),
inference(cnf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] : subset(X0,union(X0,X1)),
file('/export/starexec/sandbox2/tmp/tmp.a0lg90S7nG/Vampire---4.8_28917',subset_of_union) ).
fof(f61,plain,
~ subset(sK0,union(sK0,sK1)),
inference(trivial_inequality_removal,[],[f60]) ).
fof(f60,plain,
( empty_set != empty_set
| ~ subset(sK0,union(sK0,sK1)) ),
inference(superposition,[],[f33,f50]) ).
fof(f50,plain,
! [X0,X1] :
( difference(X0,X1) = empty_set
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f28]) ).
fof(f28,plain,
! [X0,X1] :
( ( difference(X0,X1) = empty_set
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| difference(X0,X1) != empty_set ) ),
inference(nnf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0,X1] :
( difference(X0,X1) = empty_set
<=> subset(X0,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.a0lg90S7nG/Vampire---4.8_28917',difference_empty_set) ).
fof(f33,plain,
empty_set != difference(sK0,union(sK0,sK1)),
inference(cnf_transformation,[],[f17]) ).
fof(f17,plain,
empty_set != difference(sK0,union(sK0,sK1)),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f14,f16]) ).
fof(f16,plain,
( ? [X0,X1] : empty_set != difference(X0,union(X0,X1))
=> empty_set != difference(sK0,union(sK0,sK1)) ),
introduced(choice_axiom,[]) ).
fof(f14,plain,
? [X0,X1] : empty_set != difference(X0,union(X0,X1)),
inference(ennf_transformation,[],[f13]) ).
fof(f13,negated_conjecture,
~ ! [X0,X1] : empty_set = difference(X0,union(X0,X1)),
inference(negated_conjecture,[],[f12]) ).
fof(f12,conjecture,
! [X0,X1] : empty_set = difference(X0,union(X0,X1)),
file('/export/starexec/sandbox2/tmp/tmp.a0lg90S7nG/Vampire---4.8_28917',prove_th76) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.13 % Problem : SET605+3 : TPTP v8.1.2. Released v2.2.0.
% 0.05/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.14/0.36 % Computer : n005.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Fri May 3 16:56:08 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.14/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.a0lg90S7nG/Vampire---4.8_28917
% 0.72/0.93 % (29141)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 (2994ds/51Mi)
% 0.72/0.93 % (29143)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2994ds/33Mi)
% 0.72/0.93 % (29142)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2994ds/78Mi)
% 0.72/0.93 % (29140)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 (2994ds/34Mi)
% 0.72/0.93 % (29144)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 (2994ds/34Mi)
% 0.72/0.93 % (29145)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2994ds/45Mi)
% 0.72/0.93 % (29146)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 (2994ds/83Mi)
% 0.72/0.93 % (29147)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 (2994ds/56Mi)
% 0.72/0.93 % (29145)First to succeed.
% 0.72/0.93 % (29146)Also succeeded, but the first one will report.
% 0.72/0.93 % (29141)Also succeeded, but the first one will report.
% 0.72/0.93 % (29144)Also succeeded, but the first one will report.
% 0.72/0.93 % (29142)Also succeeded, but the first one will report.
% 0.72/0.93 % (29145)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-29139"
% 0.72/0.93 % (29143)Also succeeded, but the first one will report.
% 0.72/0.93 % (29147)Also succeeded, but the first one will report.
% 0.72/0.93 % (29140)Also succeeded, but the first one will report.
% 0.78/0.94 % (29145)Refutation found. Thanks to Tanya!
% 0.78/0.94 % SZS status Theorem for Vampire---4
% 0.78/0.94 % SZS output start Proof for Vampire---4
% See solution above
% 0.78/0.94 % (29145)------------------------------
% 0.78/0.94 % (29145)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.78/0.94 % (29145)Termination reason: Refutation
% 0.78/0.94
% 0.78/0.94 % (29145)Memory used [KB]: 967
% 0.78/0.94 % (29145)Time elapsed: 0.003 s
% 0.78/0.94 % (29145)Instructions burned: 3 (million)
% 0.78/0.94 % (29139)Success in time 0.569 s
% 0.78/0.94 % Vampire---4.8 exiting
%------------------------------------------------------------------------------