TSTP Solution File: SET008+3 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET008+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:07:36 EDT 2024
% Result : Theorem 0.61s 0.76s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 32 ( 13 unt; 0 def)
% Number of atoms : 102 ( 16 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 116 ( 46 ~; 42 |; 21 &)
% ( 5 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 60 ( 53 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f51,plain,
$false,
inference(subsumption_resolution,[],[f50,f48]) ).
fof(f48,plain,
member(sK2(empty_set,intersection(difference(sK0,sK1),sK1)),sK1),
inference(resolution,[],[f46,f30]) ).
fof(f30,plain,
! [X2,X0,X1] :
( ~ member(X2,intersection(X0,X1))
| member(X2,X1) ),
inference(cnf_transformation,[],[f20]) ).
fof(f20,plain,
! [X0,X1,X2] :
( ( member(X2,intersection(X0,X1))
| ~ member(X2,X1)
| ~ member(X2,X0) )
& ( ( member(X2,X1)
& member(X2,X0) )
| ~ member(X2,intersection(X0,X1)) ) ),
inference(flattening,[],[f19]) ).
fof(f19,plain,
! [X0,X1,X2] :
( ( member(X2,intersection(X0,X1))
| ~ member(X2,X1)
| ~ member(X2,X0) )
& ( ( member(X2,X1)
& member(X2,X0) )
| ~ member(X2,intersection(X0,X1)) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1,X2] :
( member(X2,intersection(X0,X1))
<=> ( member(X2,X1)
& member(X2,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_defn) ).
fof(f46,plain,
member(sK2(empty_set,intersection(difference(sK0,sK1),sK1)),intersection(difference(sK0,sK1),sK1)),
inference(subsumption_resolution,[],[f44,f35]) ).
fof(f35,plain,
! [X0] : ~ member(X0,empty_set),
inference(cnf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0] : ~ member(X0,empty_set),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',empty_set_defn) ).
fof(f44,plain,
( member(sK2(empty_set,intersection(difference(sK0,sK1),sK1)),intersection(difference(sK0,sK1),sK1))
| member(sK2(empty_set,intersection(difference(sK0,sK1),sK1)),empty_set) ),
inference(resolution,[],[f39,f41]) ).
fof(f41,plain,
! [X0,X1] :
( sQ3_eqProxy(X0,X1)
| member(sK2(X0,X1),X1)
| member(sK2(X0,X1),X0) ),
inference(equality_proxy_replacement,[],[f26,f38]) ).
fof(f38,plain,
! [X0,X1] :
( sQ3_eqProxy(X0,X1)
<=> X0 = X1 ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ3_eqProxy])]) ).
fof(f26,plain,
! [X0,X1] :
( X0 = X1
| member(sK2(X0,X1),X1)
| member(sK2(X0,X1),X0) ),
inference(cnf_transformation,[],[f18]) ).
fof(f18,plain,
! [X0,X1] :
( ( X0 = X1
| ( ( ~ member(sK2(X0,X1),X1)
| ~ member(sK2(X0,X1),X0) )
& ( member(sK2(X0,X1),X1)
| member(sK2(X0,X1),X0) ) ) )
& ( ! [X3] :
( ( member(X3,X0)
| ~ member(X3,X1) )
& ( member(X3,X1)
| ~ member(X3,X0) ) )
| X0 != X1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f16,f17]) ).
fof(f17,plain,
! [X0,X1] :
( ? [X2] :
( ( ~ member(X2,X1)
| ~ member(X2,X0) )
& ( member(X2,X1)
| member(X2,X0) ) )
=> ( ( ~ member(sK2(X0,X1),X1)
| ~ member(sK2(X0,X1),X0) )
& ( member(sK2(X0,X1),X1)
| member(sK2(X0,X1),X0) ) ) ),
introduced(choice_axiom,[]) ).
fof(f16,plain,
! [X0,X1] :
( ( X0 = X1
| ? [X2] :
( ( ~ member(X2,X1)
| ~ member(X2,X0) )
& ( member(X2,X1)
| member(X2,X0) ) ) )
& ( ! [X3] :
( ( member(X3,X0)
| ~ member(X3,X1) )
& ( member(X3,X1)
| ~ member(X3,X0) ) )
| X0 != X1 ) ),
inference(rectify,[],[f15]) ).
fof(f15,plain,
! [X0,X1] :
( ( X0 = X1
| ? [X2] :
( ( ~ member(X2,X1)
| ~ member(X2,X0) )
& ( member(X2,X1)
| member(X2,X0) ) ) )
& ( ! [X2] :
( ( member(X2,X0)
| ~ member(X2,X1) )
& ( member(X2,X1)
| ~ member(X2,X0) ) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f9,axiom,
! [X0,X1] :
( X0 = X1
<=> ! [X2] :
( member(X2,X0)
<=> member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_member_defn) ).
fof(f39,plain,
~ sQ3_eqProxy(empty_set,intersection(difference(sK0,sK1),sK1)),
inference(equality_proxy_replacement,[],[f23,f38]) ).
fof(f23,plain,
empty_set != intersection(difference(sK0,sK1),sK1),
inference(cnf_transformation,[],[f14]) ).
fof(f14,plain,
empty_set != intersection(difference(sK0,sK1),sK1),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f12,f13]) ).
fof(f13,plain,
( ? [X0,X1] : empty_set != intersection(difference(X0,X1),X1)
=> empty_set != intersection(difference(sK0,sK1),sK1) ),
introduced(choice_axiom,[]) ).
fof(f12,plain,
? [X0,X1] : empty_set != intersection(difference(X0,X1),X1),
inference(ennf_transformation,[],[f11]) ).
fof(f11,negated_conjecture,
~ ! [X0,X1] : empty_set = intersection(difference(X0,X1),X1),
inference(negated_conjecture,[],[f10]) ).
fof(f10,conjecture,
! [X0,X1] : empty_set = intersection(difference(X0,X1),X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_intersection_difference_empty_set) ).
fof(f50,plain,
~ member(sK2(empty_set,intersection(difference(sK0,sK1),sK1)),sK1),
inference(resolution,[],[f47,f33]) ).
fof(f33,plain,
! [X2,X0,X1] :
( ~ member(X2,difference(X0,X1))
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f22]) ).
fof(f22,plain,
! [X0,X1,X2] :
( ( member(X2,difference(X0,X1))
| member(X2,X1)
| ~ member(X2,X0) )
& ( ( ~ member(X2,X1)
& member(X2,X0) )
| ~ member(X2,difference(X0,X1)) ) ),
inference(flattening,[],[f21]) ).
fof(f21,plain,
! [X0,X1,X2] :
( ( member(X2,difference(X0,X1))
| member(X2,X1)
| ~ member(X2,X0) )
& ( ( ~ member(X2,X1)
& member(X2,X0) )
| ~ member(X2,difference(X0,X1)) ) ),
inference(nnf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0,X1,X2] :
( member(X2,difference(X0,X1))
<=> ( ~ member(X2,X1)
& member(X2,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',difference_defn) ).
fof(f47,plain,
member(sK2(empty_set,intersection(difference(sK0,sK1),sK1)),difference(sK0,sK1)),
inference(resolution,[],[f46,f29]) ).
fof(f29,plain,
! [X2,X0,X1] :
( ~ member(X2,intersection(X0,X1))
| member(X2,X0) ),
inference(cnf_transformation,[],[f20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET008+3 : TPTP v8.2.0. 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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.37 % Computer : n019.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Mon May 20 13:04:38 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.15/0.37 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.37 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.61/0.76 % (20181)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 (2996ds/56Mi)
% 0.61/0.76 % (20174)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 (2996ds/34Mi)
% 0.61/0.76 % (20181)First to succeed.
% 0.61/0.76 % (20176)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.61/0.76 % (20177)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.61/0.76 % (20179)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.61/0.76 % (20178)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 (2996ds/34Mi)
% 0.61/0.76 % (20175)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 (2996ds/51Mi)
% 0.61/0.76 % (20180)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 (2996ds/83Mi)
% 0.61/0.76 % (20181)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-20173"
% 0.61/0.76 % (20181)Refutation found. Thanks to Tanya!
% 0.61/0.76 % SZS status Theorem for theBenchmark
% 0.61/0.76 % SZS output start Proof for theBenchmark
% See solution above
% 0.61/0.76 % (20181)------------------------------
% 0.61/0.76 % (20181)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.76 % (20181)Termination reason: Refutation
% 0.61/0.76
% 0.61/0.76 % (20181)Memory used [KB]: 977
% 0.61/0.76 % (20181)Time elapsed: 0.002 s
% 0.61/0.76 % (20181)Instructions burned: 3 (million)
% 0.61/0.76 % (20173)Success in time 0.384 s
% 0.61/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------