TSTP Solution File: SEU134+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU134+1 : TPTP v8.1.2. Released v3.3.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 : n017.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:50:11 EDT 2024
% Result : Theorem 0.69s 0.88s
% Output : Refutation 0.69s
% 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 : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 24 ( 18 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f60,plain,
$false,
inference(subsumption_resolution,[],[f56,f54]) ).
fof(f54,plain,
subset(sK2,sK3),
inference(subsumption_resolution,[],[f48,f53]) ).
fof(f53,plain,
~ sQ4_eqProxy(empty_set,set_difference(sK2,sK3)),
inference(subsumption_resolution,[],[f47,f50]) ).
fof(f50,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ sQ4_eqProxy(empty_set,set_difference(X0,X1)) ),
inference(equality_proxy_replacement,[],[f40,f42]) ).
fof(f42,plain,
! [X0,X1] :
( sQ4_eqProxy(X0,X1)
<=> X0 = X1 ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ4_eqProxy])]) ).
fof(f40,plain,
! [X0,X1] :
( subset(X0,X1)
| empty_set != set_difference(X0,X1) ),
inference(cnf_transformation,[],[f29]) ).
fof(f29,plain,
! [X0,X1] :
( ( empty_set = set_difference(X0,X1)
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| empty_set != set_difference(X0,X1) ) ),
inference(nnf_transformation,[],[f15]) ).
fof(f15,axiom,
! [X0,X1] :
( empty_set = set_difference(X0,X1)
<=> subset(X0,X1) ),
file('/export/starexec/sandbox/tmp/tmp.YewsRY4opb/Vampire---4.8_8376',l32_xboole_1) ).
fof(f47,plain,
( ~ subset(sK2,sK3)
| ~ sQ4_eqProxy(empty_set,set_difference(sK2,sK3)) ),
inference(equality_proxy_replacement,[],[f39,f42]) ).
fof(f39,plain,
( ~ subset(sK2,sK3)
| empty_set != set_difference(sK2,sK3) ),
inference(cnf_transformation,[],[f28]) ).
fof(f28,plain,
( ( ~ subset(sK2,sK3)
| empty_set != set_difference(sK2,sK3) )
& ( subset(sK2,sK3)
| empty_set = set_difference(sK2,sK3) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f26,f27]) ).
fof(f27,plain,
( ? [X0,X1] :
( ( ~ subset(X0,X1)
| empty_set != set_difference(X0,X1) )
& ( subset(X0,X1)
| empty_set = set_difference(X0,X1) ) )
=> ( ( ~ subset(sK2,sK3)
| empty_set != set_difference(sK2,sK3) )
& ( subset(sK2,sK3)
| empty_set = set_difference(sK2,sK3) ) ) ),
introduced(choice_axiom,[]) ).
fof(f26,plain,
? [X0,X1] :
( ( ~ subset(X0,X1)
| empty_set != set_difference(X0,X1) )
& ( subset(X0,X1)
| empty_set = set_difference(X0,X1) ) ),
inference(nnf_transformation,[],[f21]) ).
fof(f21,plain,
? [X0,X1] :
( empty_set = set_difference(X0,X1)
<~> subset(X0,X1) ),
inference(ennf_transformation,[],[f14]) ).
fof(f14,negated_conjecture,
~ ! [X0,X1] :
( empty_set = set_difference(X0,X1)
<=> subset(X0,X1) ),
inference(negated_conjecture,[],[f13]) ).
fof(f13,conjecture,
! [X0,X1] :
( empty_set = set_difference(X0,X1)
<=> subset(X0,X1) ),
file('/export/starexec/sandbox/tmp/tmp.YewsRY4opb/Vampire---4.8_8376',t37_xboole_1) ).
fof(f48,plain,
( subset(sK2,sK3)
| sQ4_eqProxy(empty_set,set_difference(sK2,sK3)) ),
inference(equality_proxy_replacement,[],[f38,f42]) ).
fof(f38,plain,
( subset(sK2,sK3)
| empty_set = set_difference(sK2,sK3) ),
inference(cnf_transformation,[],[f28]) ).
fof(f56,plain,
~ subset(sK2,sK3),
inference(resolution,[],[f53,f49]) ).
fof(f49,plain,
! [X0,X1] :
( sQ4_eqProxy(empty_set,set_difference(X0,X1))
| ~ subset(X0,X1) ),
inference(equality_proxy_replacement,[],[f41,f42]) ).
fof(f41,plain,
! [X0,X1] :
( empty_set = set_difference(X0,X1)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f29]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU134+1 : TPTP v8.1.2. Released v3.3.0.
% 0.12/0.14 % 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.14/0.35 % Computer : n017.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 15:49:04 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.14/0.35 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/tmp/tmp.YewsRY4opb/Vampire---4.8_8376
% 0.69/0.87 % (8694)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.69/0.87 % (8698)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.69/0.87 % (8696)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.69/0.87 % (8697)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.69/0.87 % (8695)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.69/0.87 % (8699)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.69/0.87 % (8700)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.69/0.88 % (8698)First to succeed.
% 0.69/0.88 % (8694)Also succeeded, but the first one will report.
% 0.69/0.88 % (8698)Refutation found. Thanks to Tanya!
% 0.69/0.88 % SZS status Theorem for Vampire---4
% 0.69/0.88 % SZS output start Proof for Vampire---4
% See solution above
% 0.69/0.88 % (8698)------------------------------
% 0.69/0.88 % (8698)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.69/0.88 % (8698)Termination reason: Refutation
% 0.69/0.88
% 0.69/0.88 % (8698)Memory used [KB]: 976
% 0.69/0.88 % (8698)Time elapsed: 0.003 s
% 0.69/0.88 % (8698)Instructions burned: 3 (million)
% 0.69/0.88 % (8698)------------------------------
% 0.69/0.88 % (8698)------------------------------
% 0.69/0.88 % (8623)Success in time 0.518 s
% 0.69/0.88 % Vampire---4.8 exiting
%------------------------------------------------------------------------------