TSTP Solution File: SEU130+2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU130+2 : 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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n003.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:20:23 EDT 2024
% Result : Theorem 0.56s 0.74s
% Output : Refutation 0.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 27 ( 9 unt; 0 def)
% Number of atoms : 62 ( 15 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 65 ( 30 ~; 19 |; 10 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% 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 : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 39 ( 35 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f252,plain,
$false,
inference(subsumption_resolution,[],[f251,f152]) ).
fof(f152,plain,
! [X1] : subset(X1,X1),
inference(equality_resolution,[],[f115]) ).
fof(f115,plain,
! [X0,X1] :
( subset(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[],[f72]) ).
fof(f72,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 ) ),
inference(flattening,[],[f71]) ).
fof(f71,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X1,X0)
& subset(X0,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.uF1c75KuDK/Vampire---4.8_18560',d10_xboole_0) ).
fof(f251,plain,
~ subset(sK0,sK0),
inference(subsumption_resolution,[],[f248,f101]) ).
fof(f101,plain,
subset(sK0,sK1),
inference(cnf_transformation,[],[f66]) ).
fof(f66,plain,
( sK0 != set_intersection2(sK0,sK1)
& subset(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f51,f65]) ).
fof(f65,plain,
( ? [X0,X1] :
( set_intersection2(X0,X1) != X0
& subset(X0,X1) )
=> ( sK0 != set_intersection2(sK0,sK1)
& subset(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f51,plain,
? [X0,X1] :
( set_intersection2(X0,X1) != X0
& subset(X0,X1) ),
inference(ennf_transformation,[],[f29]) ).
fof(f29,negated_conjecture,
~ ! [X0,X1] :
( subset(X0,X1)
=> set_intersection2(X0,X1) = X0 ),
inference(negated_conjecture,[],[f28]) ).
fof(f28,conjecture,
! [X0,X1] :
( subset(X0,X1)
=> set_intersection2(X0,X1) = X0 ),
file('/export/starexec/sandbox2/tmp/tmp.uF1c75KuDK/Vampire---4.8_18560',t28_xboole_1) ).
fof(f248,plain,
( ~ subset(sK0,sK1)
| ~ subset(sK0,sK0) ),
inference(resolution,[],[f98,f196]) ).
fof(f196,plain,
~ subset(sK0,set_intersection2(sK0,sK1)),
inference(subsumption_resolution,[],[f186,f97]) ).
fof(f97,plain,
! [X0,X1] : subset(set_intersection2(X0,X1),X0),
inference(cnf_transformation,[],[f23]) ).
fof(f23,axiom,
! [X0,X1] : subset(set_intersection2(X0,X1),X0),
file('/export/starexec/sandbox2/tmp/tmp.uF1c75KuDK/Vampire---4.8_18560',t17_xboole_1) ).
fof(f186,plain,
( ~ subset(set_intersection2(sK0,sK1),sK0)
| ~ subset(sK0,set_intersection2(sK0,sK1)) ),
inference(resolution,[],[f162,f166]) ).
fof(f166,plain,
! [X0,X1] :
( sQ10_eqProxy(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(equality_proxy_replacement,[],[f117,f160]) ).
fof(f160,plain,
! [X0,X1] :
( sQ10_eqProxy(X0,X1)
<=> X0 = X1 ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ10_eqProxy])]) ).
fof(f117,plain,
! [X0,X1] :
( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f72]) ).
fof(f162,plain,
~ sQ10_eqProxy(sK0,set_intersection2(sK0,sK1)),
inference(equality_proxy_replacement,[],[f102,f160]) ).
fof(f102,plain,
sK0 != set_intersection2(sK0,sK1),
inference(cnf_transformation,[],[f66]) ).
fof(f98,plain,
! [X2,X0,X1] :
( subset(X0,set_intersection2(X1,X2))
| ~ subset(X0,X2)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f47]) ).
fof(f47,plain,
! [X0,X1,X2] :
( subset(X0,set_intersection2(X1,X2))
| ~ subset(X0,X2)
| ~ subset(X0,X1) ),
inference(flattening,[],[f46]) ).
fof(f46,plain,
! [X0,X1,X2] :
( subset(X0,set_intersection2(X1,X2))
| ~ subset(X0,X2)
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f24]) ).
fof(f24,axiom,
! [X0,X1,X2] :
( ( subset(X0,X2)
& subset(X0,X1) )
=> subset(X0,set_intersection2(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.uF1c75KuDK/Vampire---4.8_18560',t19_xboole_1) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU130+2 : TPTP v8.1.2. Released v3.3.0.
% 0.07/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.34 % Computer : n003.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Fri May 3 11:10:05 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.14/0.34 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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.uF1c75KuDK/Vampire---4.8_18560
% 0.56/0.73 % (18676)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.73 % (18671)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.73 % (18669)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.73 % (18673)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.73 % (18670)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.73 % (18672)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.73 % (18674)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.73 % (18675)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.74 % (18676)First to succeed.
% 0.56/0.74 % (18676)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-18668"
% 0.56/0.74 % (18676)Refutation found. Thanks to Tanya!
% 0.56/0.74 % SZS status Theorem for Vampire---4
% 0.56/0.74 % SZS output start Proof for Vampire---4
% See solution above
% 0.56/0.74 % (18676)------------------------------
% 0.56/0.74 % (18676)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.74 % (18676)Termination reason: Refutation
% 0.56/0.74
% 0.56/0.74 % (18676)Memory used [KB]: 1069
% 0.56/0.74 % (18676)Time elapsed: 0.004 s
% 0.56/0.74 % (18676)Instructions burned: 7 (million)
% 0.56/0.74 % (18668)Success in time 0.383 s
% 0.56/0.74 % Vampire---4.8 exiting
%------------------------------------------------------------------------------