TSTP Solution File: SET592+3 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET592+3 : TPTP v8.2.0. 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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n019.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:12:15 EDT 2024
% Result : Theorem 0.50s 0.73s
% Output : Refutation 0.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 19 ( 8 unt; 0 def)
% Number of atoms : 42 ( 13 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 36 ( 13 ~; 8 |; 11 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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 : 27 ( 21 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f97,plain,
$false,
inference(subsumption_resolution,[],[f94,f79]) ).
fof(f79,plain,
subset(sK0,empty_set),
inference(forward_demodulation,[],[f72,f21]) ).
fof(f21,plain,
empty_set = intersection(sK1,sK2),
inference(cnf_transformation,[],[f14]) ).
fof(f14,plain,
? [X0,X1,X2] :
( empty_set != X0
& empty_set = intersection(X1,X2)
& subset(X0,X2)
& subset(X0,X1) ),
inference(flattening,[],[f13]) ).
fof(f13,plain,
? [X0,X1,X2] :
( empty_set != X0
& empty_set = intersection(X1,X2)
& subset(X0,X2)
& subset(X0,X1) ),
inference(ennf_transformation,[],[f12]) ).
fof(f12,negated_conjecture,
~ ! [X0,X1,X2] :
( ( empty_set = intersection(X1,X2)
& subset(X0,X2)
& subset(X0,X1) )
=> empty_set = X0 ),
inference(negated_conjecture,[],[f11]) ).
fof(f11,conjecture,
! [X0,X1,X2] :
( ( empty_set = intersection(X1,X2)
& subset(X0,X2)
& subset(X0,X1) )
=> empty_set = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th51) ).
fof(f72,plain,
subset(sK0,intersection(sK1,sK2)),
inference(unit_resulting_resolution,[],[f19,f20,f37]) ).
fof(f37,plain,
! [X2,X0,X1] :
( subset(X0,intersection(X1,X2))
| ~ subset(X0,X2)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f18]) ).
fof(f18,plain,
! [X0,X1,X2] :
( subset(X0,intersection(X1,X2))
| ~ subset(X0,X2)
| ~ subset(X0,X1) ),
inference(flattening,[],[f17]) ).
fof(f17,plain,
! [X0,X1,X2] :
( subset(X0,intersection(X1,X2))
| ~ subset(X0,X2)
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0,X1,X2] :
( ( subset(X0,X2)
& subset(X0,X1) )
=> subset(X0,intersection(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_of_subsets) ).
fof(f20,plain,
subset(sK0,sK2),
inference(cnf_transformation,[],[f14]) ).
fof(f19,plain,
subset(sK0,sK1),
inference(cnf_transformation,[],[f14]) ).
fof(f94,plain,
~ subset(sK0,empty_set),
inference(unit_resulting_resolution,[],[f22,f32]) ).
fof(f32,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/sandbox/benchmark/theBenchmark.p',subset_of_empty_set_is_empty_set) ).
fof(f22,plain,
empty_set != sK0,
inference(cnf_transformation,[],[f14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.09 % Problem : SET592+3 : TPTP v8.2.0. Released v2.2.0.
% 0.04/0.10 % 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.09/0.30 % Computer : n019.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Mon May 20 12:09:07 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.09/0.30 This is a FOF_THM_RFO_SEQ problem
% 0.09/0.30 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.50/0.73 % (20109)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.50/0.73 % (20107)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.50/0.73 % (20111)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.50/0.73 % (20113)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.50/0.73 % (20108)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.50/0.73 % (20110)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.50/0.73 % (20112)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.50/0.73 % (20114)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.50/0.73 % (20114)Refutation not found, incomplete strategy% (20114)------------------------------
% 0.50/0.73 % (20114)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.50/0.73 % (20114)Termination reason: Refutation not found, incomplete strategy
% 0.50/0.73
% 0.50/0.73 % (20114)Memory used [KB]: 960
% 0.50/0.73 % (20114)Time elapsed: 0.002 s
% 0.50/0.73 % (20114)Instructions burned: 3 (million)
% 0.50/0.73 % (20113)First to succeed.
% 0.50/0.73 % (20114)------------------------------
% 0.50/0.73 % (20114)------------------------------
% 0.50/0.73 % (20110)Also succeeded, but the first one will report.
% 0.50/0.73 % (20112)Also succeeded, but the first one will report.
% 0.50/0.73 % (20113)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-20106"
% 0.50/0.73 % (20108)Also succeeded, but the first one will report.
% 0.50/0.73 % (20113)Refutation found. Thanks to Tanya!
% 0.50/0.73 % SZS status Theorem for theBenchmark
% 0.50/0.73 % SZS output start Proof for theBenchmark
% See solution above
% 0.50/0.73 % (20113)------------------------------
% 0.50/0.73 % (20113)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.50/0.73 % (20113)Termination reason: Refutation
% 0.50/0.73
% 0.50/0.73 % (20113)Memory used [KB]: 982
% 0.50/0.73 % (20113)Time elapsed: 0.003 s
% 0.50/0.73 % (20113)Instructions burned: 4 (million)
% 0.50/0.73 % (20106)Success in time 0.423 s
% 0.50/0.73 % Vampire---4.8 exiting
%------------------------------------------------------------------------------