TSTP Solution File: SET596+3 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET596+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 : n013.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:26 EDT 2024
% Result : Theorem 0.70s 0.92s
% Output : Refutation 0.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 20 ( 5 unt; 0 def)
% Number of atoms : 44 ( 21 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 40 ( 16 ~; 7 |; 12 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 29 ( 20 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f105,plain,
$false,
inference(subsumption_resolution,[],[f102,f32]) ).
fof(f32,plain,
subset(sK0,sK1),
inference(cnf_transformation,[],[f19]) ).
fof(f19,plain,
( empty_set != intersection(sK0,sK2)
& empty_set = intersection(sK1,sK2)
& subset(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f14,f18]) ).
fof(f18,plain,
( ? [X0,X1,X2] :
( empty_set != intersection(X0,X2)
& empty_set = intersection(X1,X2)
& subset(X0,X1) )
=> ( empty_set != intersection(sK0,sK2)
& empty_set = intersection(sK1,sK2)
& subset(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f14,plain,
? [X0,X1,X2] :
( empty_set != intersection(X0,X2)
& empty_set = intersection(X1,X2)
& subset(X0,X1) ),
inference(flattening,[],[f13]) ).
fof(f13,plain,
? [X0,X1,X2] :
( empty_set != intersection(X0,X2)
& empty_set = intersection(X1,X2)
& subset(X0,X1) ),
inference(ennf_transformation,[],[f12]) ).
fof(f12,negated_conjecture,
~ ! [X0,X1,X2] :
( ( empty_set = intersection(X1,X2)
& subset(X0,X1) )
=> empty_set = intersection(X0,X2) ),
inference(negated_conjecture,[],[f11]) ).
fof(f11,conjecture,
! [X0,X1,X2] :
( ( empty_set = intersection(X1,X2)
& subset(X0,X1) )
=> empty_set = intersection(X0,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.4E5VYc5qRW/Vampire---4.8_12815',prove_th55) ).
fof(f102,plain,
~ subset(sK0,sK1),
inference(trivial_inequality_removal,[],[f100]) ).
fof(f100,plain,
( empty_set != empty_set
| ~ subset(sK0,sK1) ),
inference(superposition,[],[f34,f80]) ).
fof(f80,plain,
! [X0] :
( empty_set = intersection(X0,sK2)
| ~ subset(X0,sK1) ),
inference(resolution,[],[f71,f43]) ).
fof(f43,plain,
! [X0] :
( ~ subset(X0,empty_set)
| empty_set = X0 ),
inference(cnf_transformation,[],[f15]) ).
fof(f15,plain,
! [X0] :
( empty_set = X0
| ~ subset(X0,empty_set) ),
inference(ennf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0] :
( subset(X0,empty_set)
=> empty_set = X0 ),
file('/export/starexec/sandbox2/tmp/tmp.4E5VYc5qRW/Vampire---4.8_12815',subset_of_empty_set_is_empty_set) ).
fof(f71,plain,
! [X0] :
( subset(intersection(X0,sK2),empty_set)
| ~ subset(X0,sK1) ),
inference(superposition,[],[f49,f33]) ).
fof(f33,plain,
empty_set = intersection(sK1,sK2),
inference(cnf_transformation,[],[f19]) ).
fof(f49,plain,
! [X2,X0,X1] :
( subset(intersection(X0,X2),intersection(X1,X2))
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f16]) ).
fof(f16,plain,
! [X0,X1,X2] :
( subset(intersection(X0,X2),intersection(X1,X2))
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0,X1,X2] :
( subset(X0,X1)
=> subset(intersection(X0,X2),intersection(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.4E5VYc5qRW/Vampire---4.8_12815',intersection_of_subset) ).
fof(f34,plain,
empty_set != intersection(sK0,sK2),
inference(cnf_transformation,[],[f19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET596+3 : TPTP v8.1.2. Released v2.2.0.
% 0.07/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.14/0.36 % Computer : n013.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:49: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.4E5VYc5qRW/Vampire---4.8_12815
% 0.70/0.91 % (13058)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.70/0.91 % (13060)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.70/0.91 % (13061)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.70/0.91 % (13059)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.70/0.91 % (13062)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.70/0.91 % (13063)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.70/0.91 % (13065)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.70/0.91 % (13064)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.70/0.91 % (13065)Refutation not found, incomplete strategy% (13065)------------------------------
% 0.70/0.91 % (13065)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.70/0.91 % (13065)Termination reason: Refutation not found, incomplete strategy
% 0.70/0.91
% 0.70/0.91 % (13065)Memory used [KB]: 973
% 0.70/0.91 % (13065)Time elapsed: 0.003 s
% 0.70/0.91 % (13065)Instructions burned: 3 (million)
% 0.70/0.91 % (13065)------------------------------
% 0.70/0.91 % (13065)------------------------------
% 0.70/0.92 % (13063)First to succeed.
% 0.70/0.92 % (13059)Also succeeded, but the first one will report.
% 0.70/0.92 % (13063)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-13036"
% 0.70/0.92 % (13060)Also succeeded, but the first one will report.
% 0.70/0.92 % (13064)Also succeeded, but the first one will report.
% 0.70/0.92 % (13063)Refutation found. Thanks to Tanya!
% 0.70/0.92 % SZS status Theorem for Vampire---4
% 0.70/0.92 % SZS output start Proof for Vampire---4
% See solution above
% 0.70/0.92 % (13063)------------------------------
% 0.70/0.92 % (13063)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.70/0.92 % (13063)Termination reason: Refutation
% 0.70/0.92
% 0.70/0.92 % (13063)Memory used [KB]: 1052
% 0.70/0.92 % (13063)Time elapsed: 0.005 s
% 0.70/0.92 % (13063)Instructions burned: 4 (million)
% 0.70/0.92 % (13036)Success in time 0.547 s
% 0.70/0.92 % Vampire---4.8 exiting
%------------------------------------------------------------------------------