TSTP Solution File: SET688+4 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET688+4 : 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 : n007.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:08:01 EDT 2024
% Result : Theorem 0.54s 0.74s
% Output : Refutation 0.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 32 ( 11 unt; 0 def)
% Number of atoms : 106 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 123 ( 49 ~; 23 |; 42 &)
% ( 3 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 55 ( 43 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f69,plain,
$false,
inference(subsumption_resolution,[],[f67,f65]) ).
fof(f65,plain,
~ member(sK3(sK1,sK0),sK2),
inference(unit_resulting_resolution,[],[f38,f45,f31]) ).
fof(f31,plain,
! [X3,X0,X1] :
( member(X3,X1)
| ~ member(X3,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f23]) ).
fof(f23,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ member(sK3(X0,X1),X1)
& member(sK3(X0,X1),X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f21,f22]) ).
fof(f22,plain,
! [X0,X1] :
( ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) )
=> ( ~ member(sK3(X0,X1),X1)
& member(sK3(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f21,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,[],[f20]) ).
fof(f20,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,[],[f17]) ).
fof(f17,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.H4A6lGgRbH/Vampire---4.8_27782',subset) ).
fof(f45,plain,
~ member(sK3(sK1,sK0),sK0),
inference(unit_resulting_resolution,[],[f41,f33]) ).
fof(f33,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ member(sK3(X0,X1),X1) ),
inference(cnf_transformation,[],[f23]) ).
fof(f41,plain,
~ subset(sK1,sK0),
inference(unit_resulting_resolution,[],[f26,f27,f36]) ).
fof(f36,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f25]) ).
fof(f25,plain,
! [X0,X1] :
( ( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| ~ equal_set(X0,X1) ) ),
inference(flattening,[],[f24]) ).
fof(f24,plain,
! [X0,X1] :
( ( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| ~ equal_set(X0,X1) ) ),
inference(nnf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0,X1] :
( equal_set(X0,X1)
<=> ( subset(X1,X0)
& subset(X0,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.H4A6lGgRbH/Vampire---4.8_27782',equal_set) ).
fof(f27,plain,
~ equal_set(sK0,sK1),
inference(cnf_transformation,[],[f19]) ).
fof(f19,plain,
( equal_set(sK0,sK2)
& ~ equal_set(sK1,sK2)
& subset(sK1,sK2)
& ~ equal_set(sK0,sK1)
& subset(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f16,f18]) ).
fof(f18,plain,
( ? [X0,X1,X2] :
( equal_set(X0,X2)
& ~ equal_set(X1,X2)
& subset(X1,X2)
& ~ equal_set(X0,X1)
& subset(X0,X1) )
=> ( equal_set(sK0,sK2)
& ~ equal_set(sK1,sK2)
& subset(sK1,sK2)
& ~ equal_set(sK0,sK1)
& subset(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f16,plain,
? [X0,X1,X2] :
( equal_set(X0,X2)
& ~ equal_set(X1,X2)
& subset(X1,X2)
& ~ equal_set(X0,X1)
& subset(X0,X1) ),
inference(flattening,[],[f15]) ).
fof(f15,plain,
? [X0,X1,X2] :
( equal_set(X0,X2)
& ~ equal_set(X1,X2)
& subset(X1,X2)
& ~ equal_set(X0,X1)
& subset(X0,X1) ),
inference(ennf_transformation,[],[f14]) ).
fof(f14,plain,
~ ! [X0,X1,X2] :
( ( ~ equal_set(X1,X2)
& subset(X1,X2)
& ~ equal_set(X0,X1)
& subset(X0,X1) )
=> ~ equal_set(X0,X2) ),
inference(rectify,[],[f13]) ).
fof(f13,negated_conjecture,
~ ! [X0,X1,X5] :
( ( ~ equal_set(X1,X5)
& subset(X1,X5)
& ~ equal_set(X0,X1)
& subset(X0,X1) )
=> ~ equal_set(X0,X5) ),
inference(negated_conjecture,[],[f12]) ).
fof(f12,conjecture,
! [X0,X1,X5] :
( ( ~ equal_set(X1,X5)
& subset(X1,X5)
& ~ equal_set(X0,X1)
& subset(X0,X1) )
=> ~ equal_set(X0,X5) ),
file('/export/starexec/sandbox2/tmp/tmp.H4A6lGgRbH/Vampire---4.8_27782',thI04) ).
fof(f26,plain,
subset(sK0,sK1),
inference(cnf_transformation,[],[f19]) ).
fof(f38,plain,
subset(sK2,sK0),
inference(unit_resulting_resolution,[],[f30,f35]) ).
fof(f35,plain,
! [X0,X1] :
( subset(X1,X0)
| ~ equal_set(X0,X1) ),
inference(cnf_transformation,[],[f25]) ).
fof(f30,plain,
equal_set(sK0,sK2),
inference(cnf_transformation,[],[f19]) ).
fof(f67,plain,
member(sK3(sK1,sK0),sK2),
inference(unit_resulting_resolution,[],[f28,f46,f31]) ).
fof(f46,plain,
member(sK3(sK1,sK0),sK1),
inference(unit_resulting_resolution,[],[f41,f32]) ).
fof(f32,plain,
! [X0,X1] :
( member(sK3(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f23]) ).
fof(f28,plain,
subset(sK1,sK2),
inference(cnf_transformation,[],[f19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET688+4 : TPTP v8.1.2. Released v2.2.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.15/0.35 % Computer : n007.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 16:51:53 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.36 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.H4A6lGgRbH/Vampire---4.8_27782
% 0.54/0.74 % (27899)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.54/0.74 % (27899)Refutation not found, incomplete strategy% (27899)------------------------------
% 0.54/0.74 % (27899)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.74 % (27899)Termination reason: Refutation not found, incomplete strategy
% 0.54/0.74
% 0.54/0.74 % (27899)Memory used [KB]: 964
% 0.54/0.74 % (27899)Time elapsed: 0.002 s
% 0.54/0.74 % (27899)Instructions burned: 2 (million)
% 0.54/0.74 % (27899)------------------------------
% 0.54/0.74 % (27899)------------------------------
% 0.54/0.74 % (27892)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.54/0.74 % (27897)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.54/0.74 % (27895)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.54/0.74 % (27893)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.54/0.74 % (27894)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.54/0.74 % (27896)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.54/0.74 % (27898)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.54/0.74 % (27897)Refutation not found, incomplete strategy% (27897)------------------------------
% 0.54/0.74 % (27897)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.74 % (27897)Termination reason: Refutation not found, incomplete strategy
% 0.54/0.74
% 0.54/0.74 % (27897)Memory used [KB]: 964
% 0.54/0.74 % (27897)Time elapsed: 0.002 s
% 0.54/0.74 % (27897)Instructions burned: 2 (million)
% 0.54/0.74 % (27897)------------------------------
% 0.54/0.74 % (27897)------------------------------
% 0.54/0.74 % (27895)First to succeed.
% 0.54/0.74 % (27896)Refutation not found, incomplete strategy% (27896)------------------------------
% 0.54/0.74 % (27896)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.74 % (27896)Termination reason: Refutation not found, incomplete strategy
% 0.54/0.74
% 0.54/0.74 % (27896)Memory used [KB]: 1038
% 0.54/0.74 % (27892)Also succeeded, but the first one will report.
% 0.54/0.74 % (27896)Time elapsed: 0.003 s
% 0.54/0.74 % (27896)Instructions burned: 3 (million)
% 0.54/0.74 % (27898)Also succeeded, but the first one will report.
% 0.54/0.74 % (27896)------------------------------
% 0.54/0.74 % (27896)------------------------------
% 0.54/0.74 % (27895)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-27891"
% 0.54/0.74 % (27895)Refutation found. Thanks to Tanya!
% 0.54/0.74 % SZS status Theorem for Vampire---4
% 0.54/0.74 % SZS output start Proof for Vampire---4
% See solution above
% 0.54/0.74 % (27895)------------------------------
% 0.54/0.74 % (27895)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.74 % (27895)Termination reason: Refutation
% 0.54/0.74
% 0.54/0.74 % (27895)Memory used [KB]: 987
% 0.54/0.74 % (27895)Time elapsed: 0.004 s
% 0.54/0.74 % (27895)Instructions burned: 4 (million)
% 0.54/0.74 % (27891)Success in time 0.377 s
% 0.54/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------