TSTP Solution File: SET591+3 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET591+3 : TPTP v8.1.2. 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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n032.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:07:24 EDT 2024
% Result : Theorem 0.43s 0.62s
% Output : Refutation 0.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 37 ( 10 unt; 1 typ; 0 def)
% Number of atoms : 155 ( 14 equ)
% Maximal formula atoms : 6 ( 4 avg)
% Number of connectives : 117 ( 51 ~; 34 |; 22 &)
% ( 5 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 53 ( 53 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 10 ( 8 usr; 4 prp; 0-3 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 69 ( 61 !; 7 ?; 25 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_4,type,
sQ3_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f73,plain,
$false,
inference(resolution,[],[f64,f53]) ).
tff(f53,plain,
~ subset(sK0,empty_set),
inference(subsumption_resolution,[],[f52,f41]) ).
tff(f41,plain,
! [X0: $i] : subset(empty_set,X0),
inference(resolution,[],[f31,f33]) ).
tff(f33,plain,
! [X0: $i] : ~ member(X0,empty_set),
inference(cnf_transformation,[],[f3]) ).
tff(f3,axiom,
! [X0] : ~ member(X0,empty_set),
file('/export/starexec/sandbox2/tmp/tmp.cCfpHL69FN/Vampire---4.8_12267',empty_set_defn) ).
tff(f31,plain,
! [X0: $i,X1: $i] :
( member(sK2(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f20]) ).
tff(f20,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ member(sK2(X0,X1),X1)
& member(sK2(X0,X1),X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f18,f19]) ).
tff(f19,plain,
! [X0,X1] :
( ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) )
=> ( ~ member(sK2(X0,X1),X1)
& member(sK2(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
tff(f18,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f17]) ).
tff(f17,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f10]) ).
tff(f10,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f1]) ).
tff(f1,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.cCfpHL69FN/Vampire---4.8_12267',subset_defn) ).
tff(f52,plain,
( ~ subset(sK0,empty_set)
| ~ subset(empty_set,sK0) ),
inference(resolution,[],[f38,f37]) ).
tff(f37,plain,
~ sQ3_eqProxy($i,empty_set,sK0),
inference(equality_proxy_replacement,[],[f22,f36]) ).
tff(f36,plain,
! [X0: $tType,X2: X0,X1: X0] :
( sQ3_eqProxy(X0,X1,X2)
<=> ( X1 = X2 ) ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ3_eqProxy])]) ).
tff(f22,plain,
empty_set != sK0,
inference(cnf_transformation,[],[f12]) ).
tff(f12,plain,
( ( empty_set != sK0 )
& subset(sK0,difference(sK1,sK0)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f9,f11]) ).
tff(f11,plain,
( ? [X0,X1] :
( ( empty_set != X0 )
& subset(X0,difference(X1,X0)) )
=> ( ( empty_set != sK0 )
& subset(sK0,difference(sK1,sK0)) ) ),
introduced(choice_axiom,[]) ).
tff(f9,plain,
? [X0,X1] :
( ( empty_set != X0 )
& subset(X0,difference(X1,X0)) ),
inference(ennf_transformation,[],[f8]) ).
tff(f8,negated_conjecture,
~ ! [X0,X1] :
( subset(X0,difference(X1,X0))
=> ( empty_set = X0 ) ),
inference(negated_conjecture,[],[f7]) ).
tff(f7,conjecture,
! [X0,X1] :
( subset(X0,difference(X1,X0))
=> ( empty_set = X0 ) ),
file('/export/starexec/sandbox2/tmp/tmp.cCfpHL69FN/Vampire---4.8_12267',prove_th50) ).
tff(f38,plain,
! [X0: $i,X1: $i] :
( sQ3_eqProxy($i,X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(equality_proxy_replacement,[],[f25,f36]) ).
tff(f25,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f14]) ).
tff(f14,plain,
! [X0,X1] :
( ( ( X0 = X1 )
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| ( X0 != X1 ) ) ),
inference(flattening,[],[f13]) ).
tff(f13,plain,
! [X0,X1] :
( ( ( X0 = X1 )
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| ( X0 != X1 ) ) ),
inference(nnf_transformation,[],[f4]) ).
tff(f4,axiom,
! [X0,X1] :
( ( X0 = X1 )
<=> ( subset(X1,X0)
& subset(X0,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.cCfpHL69FN/Vampire---4.8_12267',equal_defn) ).
tff(f64,plain,
! [X0: $i] : subset(sK0,X0),
inference(resolution,[],[f63,f31]) ).
tff(f63,plain,
! [X0: $i] : ~ member(X0,sK0),
inference(duplicate_literal_removal,[],[f60]) ).
tff(f60,plain,
! [X0: $i] :
( ~ member(X0,sK0)
| ~ member(X0,sK0) ),
inference(resolution,[],[f49,f21]) ).
tff(f21,plain,
subset(sK0,difference(sK1,sK0)),
inference(cnf_transformation,[],[f12]) ).
tff(f49,plain,
! [X2: $i,X3: $i,X0: $i,X1: $i] :
( ~ subset(X1,difference(X2,X3))
| ~ member(X0,X1)
| ~ member(X0,X3) ),
inference(resolution,[],[f30,f27]) ).
tff(f27,plain,
! [X2: $i,X0: $i,X1: $i] :
( ~ member(X2,difference(X0,X1))
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f16]) ).
tff(f16,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,[],[f15]) ).
tff(f15,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]) ).
tff(f2,axiom,
! [X0,X1,X2] :
( member(X2,difference(X0,X1))
<=> ( ~ member(X2,X1)
& member(X2,X0) ) ),
file('/export/starexec/sandbox2/tmp/tmp.cCfpHL69FN/Vampire---4.8_12267',difference_defn) ).
tff(f30,plain,
! [X3: $i,X0: $i,X1: $i] :
( member(X3,X1)
| ~ member(X3,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.08 % Problem : SET591+3 : TPTP v8.1.2. Released v2.2.0.
% 0.01/0.09 % 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.13/0.28 % Computer : n032.cluster.edu
% 0.13/0.28 % Model : x86_64 x86_64
% 0.13/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.28 % Memory : 8042.1875MB
% 0.13/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.28 % CPULimit : 300
% 0.13/0.28 % WCLimit : 300
% 0.13/0.28 % DateTime : Fri May 3 16:41:23 EDT 2024
% 0.13/0.28 % CPUTime :
% 0.13/0.28 This is a FOF_THM_RFO_SEQ problem
% 0.13/0.28 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.cCfpHL69FN/Vampire---4.8_12267
% 0.43/0.62 % (12461)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.43/0.62 % (12464)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.43/0.62 % (12463)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.43/0.62 % (12466)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.43/0.62 % (12465)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.43/0.62 % (12462)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.43/0.62 % (12467)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.43/0.62 % (12468)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.43/0.62 % (12461)First to succeed.
% 0.43/0.62 % (12465)Refutation not found, incomplete strategy% (12465)------------------------------
% 0.43/0.62 % (12465)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.43/0.62 % (12465)Termination reason: Refutation not found, incomplete strategy
% 0.43/0.62
% 0.43/0.62 % (12464)Also succeeded, but the first one will report.
% 0.43/0.62 % (12465)Memory used [KB]: 969
% 0.43/0.62 % (12466)Refutation not found, incomplete strategy% (12466)------------------------------
% 0.43/0.62 % (12466)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.43/0.62 % (12466)Termination reason: Refutation not found, incomplete strategy
% 0.43/0.62
% 0.43/0.62 % (12466)Memory used [KB]: 968
% 0.43/0.62 % (12466)Time elapsed: 0.003 s
% 0.43/0.62 % (12466)Instructions burned: 2 (million)
% 0.43/0.62 % (12465)Time elapsed: 0.003 s
% 0.43/0.62 % (12465)Instructions burned: 2 (million)
% 0.43/0.62 % (12461)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-12460"
% 0.43/0.62 % (12466)------------------------------
% 0.43/0.62 % (12466)------------------------------
% 0.43/0.62 % (12465)------------------------------
% 0.43/0.62 % (12465)------------------------------
% 0.43/0.62 % (12468)Also succeeded, but the first one will report.
% 0.43/0.62 % (12461)Refutation found. Thanks to Tanya!
% 0.43/0.62 % SZS status Theorem for Vampire---4
% 0.43/0.62 % SZS output start Proof for Vampire---4
% See solution above
% 0.43/0.62 % (12461)------------------------------
% 0.43/0.62 % (12461)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.43/0.62 % (12461)Termination reason: Refutation
% 0.43/0.62
% 0.43/0.62 % (12461)Memory used [KB]: 980
% 0.43/0.62 % (12461)Time elapsed: 0.003 s
% 0.43/0.62 % (12461)Instructions burned: 4 (million)
% 0.43/0.62 % (12460)Success in time 0.337 s
% 0.46/0.62 % Vampire---4.8 exiting
%------------------------------------------------------------------------------