TSTP Solution File: SET185+3 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET185+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 : n029.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:04:39 EDT 2024
% Result : Theorem 0.53s 0.74s
% Output : Refutation 0.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 39 ( 8 unt; 0 def)
% Number of atoms : 134 ( 17 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 152 ( 57 ~; 56 |; 27 &)
% ( 6 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 74 ( 64 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f91,plain,
$false,
inference(subsumption_resolution,[],[f90,f81]) ).
fof(f81,plain,
~ member(sK1(sK3,union(sK2,sK3)),sK2),
inference(resolution,[],[f62,f56]) ).
fof(f56,plain,
! [X0] :
( member(X0,sK3)
| ~ member(X0,sK2) ),
inference(resolution,[],[f40,f28]) ).
fof(f28,plain,
! [X3,X0,X1] :
( member(X3,X1)
| ~ member(X3,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f16]) ).
fof(f16,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f14,f15]) ).
fof(f15,plain,
! [X0,X1] :
( ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) )
=> ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f14,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,[],[f13]) ).
fof(f13,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,[],[f9]) ).
fof(f9,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.GqahXPVFaa/Vampire---4.8_5435',subset_defn) ).
fof(f40,plain,
subset(sK2,sK3),
inference(cnf_transformation,[],[f24]) ).
fof(f24,plain,
( sK3 != union(sK2,sK3)
& subset(sK2,sK3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f10,f23]) ).
fof(f23,plain,
( ? [X0,X1] :
( union(X0,X1) != X1
& subset(X0,X1) )
=> ( sK3 != union(sK2,sK3)
& subset(sK2,sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f10,plain,
? [X0,X1] :
( union(X0,X1) != X1
& subset(X0,X1) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,negated_conjecture,
~ ! [X0,X1] :
( subset(X0,X1)
=> union(X0,X1) = X1 ),
inference(negated_conjecture,[],[f7]) ).
fof(f7,conjecture,
! [X0,X1] :
( subset(X0,X1)
=> union(X0,X1) = X1 ),
file('/export/starexec/sandbox2/tmp/tmp.GqahXPVFaa/Vampire---4.8_5435',prove_subset_union) ).
fof(f62,plain,
~ member(sK1(sK3,union(sK2,sK3)),sK3),
inference(subsumption_resolution,[],[f58,f61]) ).
fof(f61,plain,
member(sK1(sK3,union(sK2,sK3)),union(sK2,sK3)),
inference(subsumption_resolution,[],[f57,f27]) ).
fof(f27,plain,
! [X2,X0,X1] :
( member(X2,union(X0,X1))
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f12]) ).
fof(f12,plain,
! [X0,X1,X2] :
( ( member(X2,union(X0,X1))
| ( ~ member(X2,X1)
& ~ member(X2,X0) ) )
& ( member(X2,X1)
| member(X2,X0)
| ~ member(X2,union(X0,X1)) ) ),
inference(flattening,[],[f11]) ).
fof(f11,plain,
! [X0,X1,X2] :
( ( member(X2,union(X0,X1))
| ( ~ member(X2,X1)
& ~ member(X2,X0) ) )
& ( member(X2,X1)
| member(X2,X0)
| ~ member(X2,union(X0,X1)) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1,X2] :
( member(X2,union(X0,X1))
<=> ( member(X2,X1)
| member(X2,X0) ) ),
file('/export/starexec/sandbox2/tmp/tmp.GqahXPVFaa/Vampire---4.8_5435',union_defn) ).
fof(f57,plain,
( member(sK1(sK3,union(sK2,sK3)),union(sK2,sK3))
| member(sK1(sK3,union(sK2,sK3)),sK3) ),
inference(resolution,[],[f51,f50]) ).
fof(f50,plain,
! [X0,X1] :
( sQ4_eqProxy(X0,X1)
| member(sK1(X0,X1),X1)
| member(sK1(X0,X1),X0) ),
inference(equality_proxy_replacement,[],[f38,f46]) ).
fof(f46,plain,
! [X0,X1] :
( sQ4_eqProxy(X0,X1)
<=> X0 = X1 ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ4_eqProxy])]) ).
fof(f38,plain,
! [X0,X1] :
( X0 = X1
| member(sK1(X0,X1),X1)
| member(sK1(X0,X1),X0) ),
inference(cnf_transformation,[],[f22]) ).
fof(f22,plain,
! [X0,X1] :
( ( X0 = X1
| ( ( ~ member(sK1(X0,X1),X1)
| ~ member(sK1(X0,X1),X0) )
& ( member(sK1(X0,X1),X1)
| member(sK1(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,[sK1])],[f20,f21]) ).
fof(f21,plain,
! [X0,X1] :
( ? [X2] :
( ( ~ member(X2,X1)
| ~ member(X2,X0) )
& ( member(X2,X1)
| member(X2,X0) ) )
=> ( ( ~ member(sK1(X0,X1),X1)
| ~ member(sK1(X0,X1),X0) )
& ( member(sK1(X0,X1),X1)
| member(sK1(X0,X1),X0) ) ) ),
introduced(choice_axiom,[]) ).
fof(f20,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,[],[f19]) ).
fof(f19,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,[],[f6]) ).
fof(f6,axiom,
! [X0,X1] :
( X0 = X1
<=> ! [X2] :
( member(X2,X0)
<=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.GqahXPVFaa/Vampire---4.8_5435',equal_member_defn) ).
fof(f51,plain,
~ sQ4_eqProxy(sK3,union(sK2,sK3)),
inference(equality_proxy_replacement,[],[f41,f46]) ).
fof(f41,plain,
sK3 != union(sK2,sK3),
inference(cnf_transformation,[],[f24]) ).
fof(f58,plain,
( ~ member(sK1(sK3,union(sK2,sK3)),union(sK2,sK3))
| ~ member(sK1(sK3,union(sK2,sK3)),sK3) ),
inference(resolution,[],[f51,f49]) ).
fof(f49,plain,
! [X0,X1] :
( sQ4_eqProxy(X0,X1)
| ~ member(sK1(X0,X1),X1)
| ~ member(sK1(X0,X1),X0) ),
inference(equality_proxy_replacement,[],[f39,f46]) ).
fof(f39,plain,
! [X0,X1] :
( X0 = X1
| ~ member(sK1(X0,X1),X1)
| ~ member(sK1(X0,X1),X0) ),
inference(cnf_transformation,[],[f22]) ).
fof(f90,plain,
member(sK1(sK3,union(sK2,sK3)),sK2),
inference(subsumption_resolution,[],[f86,f62]) ).
fof(f86,plain,
( member(sK1(sK3,union(sK2,sK3)),sK3)
| member(sK1(sK3,union(sK2,sK3)),sK2) ),
inference(resolution,[],[f61,f25]) ).
fof(f25,plain,
! [X2,X0,X1] :
( member(X2,X1)
| member(X2,X0)
| ~ member(X2,union(X0,X1)) ),
inference(cnf_transformation,[],[f12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET185+3 : TPTP v8.1.2. 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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.36 % Computer : n029.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Fri May 3 16:38:38 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.14/0.37 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.GqahXPVFaa/Vampire---4.8_5435
% 0.53/0.74 % (5543)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.53/0.74 % (5546)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.53/0.74 % (5549)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.53/0.74 % (5545)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.53/0.74 % (5547)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.53/0.74 % (5544)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.53/0.74 % (5548)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.53/0.74 % (5550)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.53/0.74 % (5546)Refutation not found, incomplete strategy% (5546)------------------------------
% 0.53/0.74 % (5546)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.53/0.74 % (5546)Termination reason: Refutation not found, incomplete strategy
% 0.53/0.74
% 0.53/0.74 % (5546)Memory used [KB]: 967
% 0.53/0.74 % (5546)Time elapsed: 0.003 s
% 0.53/0.74 % (5546)Instructions burned: 2 (million)
% 0.53/0.74 % (5547)First to succeed.
% 0.53/0.74 % (5548)Refutation not found, incomplete strategy% (5548)------------------------------
% 0.53/0.74 % (5548)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.53/0.74 % (5548)Termination reason: Refutation not found, incomplete strategy
% 0.53/0.74
% 0.53/0.74 % (5548)Memory used [KB]: 970
% 0.53/0.74 % (5548)Time elapsed: 0.003 s
% 0.53/0.74 % (5548)Instructions burned: 3 (million)
% 0.53/0.74 % (5546)------------------------------
% 0.53/0.74 % (5546)------------------------------
% 0.53/0.74 % (5550)Also succeeded, but the first one will report.
% 0.53/0.74 % (5548)------------------------------
% 0.53/0.74 % (5548)------------------------------
% 0.53/0.74 % (5543)Also succeeded, but the first one will report.
% 0.53/0.74 % (5547)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-5542"
% 0.53/0.74 % (5547)Refutation found. Thanks to Tanya!
% 0.53/0.74 % SZS status Theorem for Vampire---4
% 0.53/0.74 % SZS output start Proof for Vampire---4
% See solution above
% 0.53/0.75 % (5547)------------------------------
% 0.53/0.75 % (5547)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.53/0.75 % (5547)Termination reason: Refutation
% 0.53/0.75
% 0.53/0.75 % (5547)Memory used [KB]: 1047
% 0.53/0.75 % (5547)Time elapsed: 0.004 s
% 0.53/0.75 % (5547)Instructions burned: 4 (million)
% 0.53/0.75 % (5542)Success in time 0.374 s
% 0.53/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------