TSTP Solution File: SET183+3 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET183+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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n021.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:45:39 EDT 2024
% Result : Theorem 0.60s 0.82s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% 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 : 156 ( 61 ~; 55 |; 28 &)
% ( 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(f88,plain,
$false,
inference(subsumption_resolution,[],[f84,f63]) ).
fof(f63,plain,
member(sK1(sK2,intersection(sK2,sK3)),sK2),
inference(subsumption_resolution,[],[f59,f26]) ).
fof(f26,plain,
! [X2,X0,X1] :
( member(X2,X0)
| ~ member(X2,intersection(X0,X1)) ),
inference(cnf_transformation,[],[f13]) ).
fof(f13,plain,
! [X0,X1,X2] :
( ( member(X2,intersection(X0,X1))
| ~ member(X2,X1)
| ~ member(X2,X0) )
& ( ( member(X2,X1)
& member(X2,X0) )
| ~ member(X2,intersection(X0,X1)) ) ),
inference(flattening,[],[f12]) ).
fof(f12,plain,
! [X0,X1,X2] :
( ( member(X2,intersection(X0,X1))
| ~ member(X2,X1)
| ~ member(X2,X0) )
& ( ( member(X2,X1)
& member(X2,X0) )
| ~ member(X2,intersection(X0,X1)) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1,X2] :
( member(X2,intersection(X0,X1))
<=> ( member(X2,X1)
& member(X2,X0) ) ),
file('/export/starexec/sandbox/tmp/tmp.7HvGyN1CkD/Vampire---4.8_19951',intersection_defn) ).
fof(f59,plain,
( member(sK1(sK2,intersection(sK2,sK3)),intersection(sK2,sK3))
| member(sK1(sK2,intersection(sK2,sK3)),sK2) ),
inference(resolution,[],[f53,f52]) ).
fof(f52,plain,
! [X0,X1] :
( sQ4_eqProxy(X0,X1)
| member(sK1(X0,X1),X1)
| member(sK1(X0,X1),X0) ),
inference(equality_proxy_replacement,[],[f40,f48]) ).
fof(f48,plain,
! [X0,X1] :
( sQ4_eqProxy(X0,X1)
<=> X0 = X1 ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ4_eqProxy])]) ).
fof(f40,plain,
! [X0,X1] :
( X0 = X1
| member(sK1(X0,X1),X1)
| member(sK1(X0,X1),X0) ),
inference(cnf_transformation,[],[f23]) ).
fof(f23,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])],[f21,f22]) ).
fof(f22,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(f21,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,[],[f20]) ).
fof(f20,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,[],[f7]) ).
fof(f7,axiom,
! [X0,X1] :
( X0 = X1
<=> ! [X2] :
( member(X2,X0)
<=> member(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.7HvGyN1CkD/Vampire---4.8_19951',equal_member_defn) ).
fof(f53,plain,
~ sQ4_eqProxy(sK2,intersection(sK2,sK3)),
inference(equality_proxy_replacement,[],[f43,f48]) ).
fof(f43,plain,
sK2 != intersection(sK2,sK3),
inference(cnf_transformation,[],[f25]) ).
fof(f25,plain,
( sK2 != intersection(sK2,sK3)
& subset(sK2,sK3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f11,f24]) ).
fof(f24,plain,
( ? [X0,X1] :
( intersection(X0,X1) != X0
& subset(X0,X1) )
=> ( sK2 != intersection(sK2,sK3)
& subset(sK2,sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f11,plain,
? [X0,X1] :
( intersection(X0,X1) != X0
& subset(X0,X1) ),
inference(ennf_transformation,[],[f9]) ).
fof(f9,negated_conjecture,
~ ! [X0,X1] :
( subset(X0,X1)
=> intersection(X0,X1) = X0 ),
inference(negated_conjecture,[],[f8]) ).
fof(f8,conjecture,
! [X0,X1] :
( subset(X0,X1)
=> intersection(X0,X1) = X0 ),
file('/export/starexec/sandbox/tmp/tmp.7HvGyN1CkD/Vampire---4.8_19951',prove_subset_intersection) ).
fof(f84,plain,
~ member(sK1(sK2,intersection(sK2,sK3)),sK2),
inference(resolution,[],[f83,f58]) ).
fof(f58,plain,
! [X0] :
( member(X0,sK3)
| ~ member(X0,sK2) ),
inference(resolution,[],[f42,f30]) ).
fof(f30,plain,
! [X3,X0,X1] :
( member(X3,X1)
| ~ member(X3,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f17]) ).
fof(f17,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])],[f15,f16]) ).
fof(f16,plain,
! [X0,X1] :
( ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) )
=> ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f15,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,[],[f14]) ).
fof(f14,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]) ).
fof(f10,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.7HvGyN1CkD/Vampire---4.8_19951',subset_defn) ).
fof(f42,plain,
subset(sK2,sK3),
inference(cnf_transformation,[],[f25]) ).
fof(f83,plain,
~ member(sK1(sK2,intersection(sK2,sK3)),sK3),
inference(subsumption_resolution,[],[f79,f63]) ).
fof(f79,plain,
( ~ member(sK1(sK2,intersection(sK2,sK3)),sK3)
| ~ member(sK1(sK2,intersection(sK2,sK3)),sK2) ),
inference(resolution,[],[f64,f28]) ).
fof(f28,plain,
! [X2,X0,X1] :
( member(X2,intersection(X0,X1))
| ~ member(X2,X1)
| ~ member(X2,X0) ),
inference(cnf_transformation,[],[f13]) ).
fof(f64,plain,
~ member(sK1(sK2,intersection(sK2,sK3)),intersection(sK2,sK3)),
inference(subsumption_resolution,[],[f60,f63]) ).
fof(f60,plain,
( ~ member(sK1(sK2,intersection(sK2,sK3)),intersection(sK2,sK3))
| ~ member(sK1(sK2,intersection(sK2,sK3)),sK2) ),
inference(resolution,[],[f53,f51]) ).
fof(f51,plain,
! [X0,X1] :
( sQ4_eqProxy(X0,X1)
| ~ member(sK1(X0,X1),X1)
| ~ member(sK1(X0,X1),X0) ),
inference(equality_proxy_replacement,[],[f41,f48]) ).
fof(f41,plain,
! [X0,X1] :
( X0 = X1
| ~ member(sK1(X0,X1),X1)
| ~ member(sK1(X0,X1),X0) ),
inference(cnf_transformation,[],[f23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SET183+3 : TPTP v8.1.2. Released v2.2.0.
% 0.03/0.13 % 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.12/0.33 % Computer : n021.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Apr 30 17:22:25 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.12/0.33 This is a FOF_THM_RFO_SEQ problem
% 0.12/0.33 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.7HvGyN1CkD/Vampire---4.8_19951
% 0.60/0.82 % (20066)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.60/0.82 % (20067)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.60/0.82 % (20068)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 (2995ds/34Mi)
% 0.60/0.82 % (20064)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 (2995ds/34Mi)
% 0.60/0.82 % (20069)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.60/0.82 % (20065)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 (2995ds/51Mi)
% 0.60/0.82 % (20070)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 (2995ds/83Mi)
% 0.60/0.82 % (20071)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 (2995ds/56Mi)
% 0.60/0.82 % (20071)Refutation not found, incomplete strategy% (20071)------------------------------
% 0.60/0.82 % (20071)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.82 % (20071)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.82
% 0.60/0.82 % (20071)Memory used [KB]: 951
% 0.60/0.82 % (20071)Time elapsed: 0.003 s
% 0.60/0.82 % (20071)Instructions burned: 2 (million)
% 0.60/0.82 % (20071)------------------------------
% 0.60/0.82 % (20071)------------------------------
% 0.60/0.82 % (20067)Refutation not found, incomplete strategy% (20067)------------------------------
% 0.60/0.82 % (20067)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.82 % (20067)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.82
% 0.60/0.82 % (20067)Memory used [KB]: 954
% 0.60/0.82 % (20067)Time elapsed: 0.003 s
% 0.60/0.82 % (20067)Instructions burned: 2 (million)
% 0.60/0.82 % (20067)------------------------------
% 0.60/0.82 % (20067)------------------------------
% 0.60/0.82 % (20069)Refutation not found, incomplete strategy% (20069)------------------------------
% 0.60/0.82 % (20069)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.82 % (20069)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.82
% 0.60/0.82 % (20069)Memory used [KB]: 966
% 0.60/0.82 % (20068)First to succeed.
% 0.60/0.82 % (20069)Time elapsed: 0.003 s
% 0.60/0.82 % (20069)Instructions burned: 2 (million)
% 0.60/0.82 % (20069)------------------------------
% 0.60/0.82 % (20069)------------------------------
% 0.60/0.82 % (20070)Also succeeded, but the first one will report.
% 0.60/0.82 % (20068)Refutation found. Thanks to Tanya!
% 0.60/0.82 % SZS status Theorem for Vampire---4
% 0.60/0.82 % SZS output start Proof for Vampire---4
% See solution above
% 0.60/0.82 % (20068)------------------------------
% 0.60/0.82 % (20068)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.82 % (20068)Termination reason: Refutation
% 0.60/0.82
% 0.60/0.82 % (20068)Memory used [KB]: 981
% 0.60/0.82 % (20068)Time elapsed: 0.004 s
% 0.60/0.82 % (20068)Instructions burned: 4 (million)
% 0.60/0.82 % (20068)------------------------------
% 0.60/0.82 % (20068)------------------------------
% 0.60/0.82 % (20059)Success in time 0.487 s
% 0.60/0.83 % Vampire---4.8 exiting
%------------------------------------------------------------------------------