TSTP Solution File: SET925+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET925+1 : TPTP v8.1.2. Released v3.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 : n010.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 : Wed May 1 03:49:30 EDT 2024
% Result : Theorem 0.56s 0.75s
% Output : Refutation 0.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 21 ( 4 unt; 0 def)
% Number of atoms : 50 ( 19 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 50 ( 21 ~; 18 |; 5 &)
% ( 4 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 24 ( 18 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f37,plain,
$false,
inference(subsumption_resolution,[],[f36,f33]) ).
fof(f33,plain,
in(sK0,sK1),
inference(subsumption_resolution,[],[f28,f32]) ).
fof(f32,plain,
~ sQ4_eqProxy(empty_set,set_difference(singleton(sK0),sK1)),
inference(subsumption_resolution,[],[f27,f30]) ).
fof(f30,plain,
! [X0,X1] :
( ~ sQ4_eqProxy(empty_set,set_difference(singleton(X0),X1))
| in(X0,X1) ),
inference(equality_proxy_replacement,[],[f20,f26]) ).
fof(f26,plain,
! [X0,X1] :
( sQ4_eqProxy(X0,X1)
<=> X0 = X1 ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ4_eqProxy])]) ).
fof(f20,plain,
! [X0,X1] :
( in(X0,X1)
| empty_set != set_difference(singleton(X0),X1) ),
inference(cnf_transformation,[],[f13]) ).
fof(f13,plain,
! [X0,X1] :
( ( empty_set = set_difference(singleton(X0),X1)
| ~ in(X0,X1) )
& ( in(X0,X1)
| empty_set != set_difference(singleton(X0),X1) ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f7,axiom,
! [X0,X1] :
( empty_set = set_difference(singleton(X0),X1)
<=> in(X0,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.9ucIlatDQV/Vampire---4.8_16679',l36_zfmisc_1) ).
fof(f27,plain,
( ~ in(sK0,sK1)
| ~ sQ4_eqProxy(empty_set,set_difference(singleton(sK0),sK1)) ),
inference(equality_proxy_replacement,[],[f19,f26]) ).
fof(f19,plain,
( ~ in(sK0,sK1)
| empty_set != set_difference(singleton(sK0),sK1) ),
inference(cnf_transformation,[],[f12]) ).
fof(f12,plain,
( ( ~ in(sK0,sK1)
| empty_set != set_difference(singleton(sK0),sK1) )
& ( in(sK0,sK1)
| empty_set = set_difference(singleton(sK0),sK1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f10,f11]) ).
fof(f11,plain,
( ? [X0,X1] :
( ( ~ in(X0,X1)
| empty_set != set_difference(singleton(X0),X1) )
& ( in(X0,X1)
| empty_set = set_difference(singleton(X0),X1) ) )
=> ( ( ~ in(sK0,sK1)
| empty_set != set_difference(singleton(sK0),sK1) )
& ( in(sK0,sK1)
| empty_set = set_difference(singleton(sK0),sK1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f10,plain,
? [X0,X1] :
( ( ~ in(X0,X1)
| empty_set != set_difference(singleton(X0),X1) )
& ( in(X0,X1)
| empty_set = set_difference(singleton(X0),X1) ) ),
inference(nnf_transformation,[],[f8]) ).
fof(f8,plain,
? [X0,X1] :
( empty_set = set_difference(singleton(X0),X1)
<~> in(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f6,negated_conjecture,
~ ! [X0,X1] :
( empty_set = set_difference(singleton(X0),X1)
<=> in(X0,X1) ),
inference(negated_conjecture,[],[f5]) ).
fof(f5,conjecture,
! [X0,X1] :
( empty_set = set_difference(singleton(X0),X1)
<=> in(X0,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.9ucIlatDQV/Vampire---4.8_16679',t68_zfmisc_1) ).
fof(f28,plain,
( in(sK0,sK1)
| sQ4_eqProxy(empty_set,set_difference(singleton(sK0),sK1)) ),
inference(equality_proxy_replacement,[],[f18,f26]) ).
fof(f18,plain,
( in(sK0,sK1)
| empty_set = set_difference(singleton(sK0),sK1) ),
inference(cnf_transformation,[],[f12]) ).
fof(f36,plain,
~ in(sK0,sK1),
inference(resolution,[],[f32,f29]) ).
fof(f29,plain,
! [X0,X1] :
( sQ4_eqProxy(empty_set,set_difference(singleton(X0),X1))
| ~ in(X0,X1) ),
inference(equality_proxy_replacement,[],[f21,f26]) ).
fof(f21,plain,
! [X0,X1] :
( empty_set = set_difference(singleton(X0),X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SET925+1 : TPTP v8.1.2. Released v3.2.0.
% 0.14/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.35 % Computer : n010.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Apr 30 17:07:34 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.21/0.35 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.9ucIlatDQV/Vampire---4.8_16679
% 0.56/0.75 % (16899)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.56/0.75 % (16898)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.56/0.75 % (16899)First to succeed.
% 0.56/0.75 % (16898)Also succeeded, but the first one will report.
% 0.56/0.75 % (16894)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.56/0.75 % (16892)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.56/0.75 % (16895)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.56/0.75 % (16893)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.56/0.75 % (16896)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.56/0.75 % (16897)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.56/0.75 % (16899)Refutation found. Thanks to Tanya!
% 0.56/0.75 % SZS status Theorem for Vampire---4
% 0.56/0.75 % SZS output start Proof for Vampire---4
% See solution above
% 0.56/0.75 % (16899)------------------------------
% 0.56/0.75 % (16899)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.56/0.75 % (16899)Termination reason: Refutation
% 0.56/0.75
% 0.56/0.75 % (16899)Memory used [KB]: 972
% 0.56/0.75 % (16899)Time elapsed: 0.003 s
% 0.56/0.75 % (16899)Instructions burned: 3 (million)
% 0.56/0.75 % (16899)------------------------------
% 0.56/0.75 % (16899)------------------------------
% 0.56/0.75 % (16874)Success in time 0.395 s
% 0.56/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------