TSTP Solution File: SET929+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET929+1 : TPTP v8.1.2. Released v3.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 : n016.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:49:32 EDT 2024
% Result : Theorem 0.61s 0.81s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 47 ( 1 unt; 0 def)
% Number of atoms : 138 ( 22 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 150 ( 59 ~; 62 |; 19 &)
% ( 8 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 4 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 50 ( 38 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f78,plain,
$false,
inference(avatar_sat_refutation,[],[f59,f60,f61,f70,f76,f77]) ).
fof(f77,plain,
( spl6_3
| ~ spl6_1 ),
inference(avatar_split_clause,[],[f73,f48,f56]) ).
fof(f56,plain,
( spl6_3
<=> in(sK1,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_3])]) ).
fof(f48,plain,
( spl6_1
<=> sQ5_eqProxy(empty_set,set_difference(unordered_pair(sK0,sK1),sK2)) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_1])]) ).
fof(f73,plain,
( in(sK1,sK2)
| ~ spl6_1 ),
inference(resolution,[],[f71,f30]) ).
fof(f30,plain,
! [X2,X0,X1] :
( ~ subset(unordered_pair(X0,X1),X2)
| in(X1,X2) ),
inference(cnf_transformation,[],[f19]) ).
fof(f19,plain,
! [X0,X1,X2] :
( ( subset(unordered_pair(X0,X1),X2)
| ~ in(X1,X2)
| ~ in(X0,X2) )
& ( ( in(X1,X2)
& in(X0,X2) )
| ~ subset(unordered_pair(X0,X1),X2) ) ),
inference(flattening,[],[f18]) ).
fof(f18,plain,
! [X0,X1,X2] :
( ( subset(unordered_pair(X0,X1),X2)
| ~ in(X1,X2)
| ~ in(X0,X2) )
& ( ( in(X1,X2)
& in(X0,X2) )
| ~ subset(unordered_pair(X0,X1),X2) ) ),
inference(nnf_transformation,[],[f8]) ).
fof(f8,axiom,
! [X0,X1,X2] :
( subset(unordered_pair(X0,X1),X2)
<=> ( in(X1,X2)
& in(X0,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.2cbzF6JVC5/Vampire---4.8_26263',t38_zfmisc_1) ).
fof(f71,plain,
( subset(unordered_pair(sK0,sK1),sK2)
| ~ spl6_1 ),
inference(resolution,[],[f49,f45]) ).
fof(f45,plain,
! [X0,X1] :
( ~ sQ5_eqProxy(empty_set,set_difference(X0,X1))
| subset(X0,X1) ),
inference(equality_proxy_replacement,[],[f34,f39]) ).
fof(f39,plain,
! [X0,X1] :
( sQ5_eqProxy(X0,X1)
<=> X0 = X1 ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ5_eqProxy])]) ).
fof(f34,plain,
! [X0,X1] :
( subset(X0,X1)
| empty_set != set_difference(X0,X1) ),
inference(cnf_transformation,[],[f20]) ).
fof(f20,plain,
! [X0,X1] :
( ( empty_set = set_difference(X0,X1)
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| empty_set != set_difference(X0,X1) ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f7,axiom,
! [X0,X1] :
( empty_set = set_difference(X0,X1)
<=> subset(X0,X1) ),
file('/export/starexec/sandbox/tmp/tmp.2cbzF6JVC5/Vampire---4.8_26263',t37_xboole_1) ).
fof(f49,plain,
( sQ5_eqProxy(empty_set,set_difference(unordered_pair(sK0,sK1),sK2))
| ~ spl6_1 ),
inference(avatar_component_clause,[],[f48]) ).
fof(f76,plain,
( spl6_2
| ~ spl6_1 ),
inference(avatar_split_clause,[],[f72,f48,f52]) ).
fof(f52,plain,
( spl6_2
<=> in(sK0,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_2])]) ).
fof(f72,plain,
( in(sK0,sK2)
| ~ spl6_1 ),
inference(resolution,[],[f71,f29]) ).
fof(f29,plain,
! [X2,X0,X1] :
( ~ subset(unordered_pair(X0,X1),X2)
| in(X0,X2) ),
inference(cnf_transformation,[],[f19]) ).
fof(f70,plain,
( spl6_1
| ~ spl6_2
| ~ spl6_3 ),
inference(avatar_contradiction_clause,[],[f69]) ).
fof(f69,plain,
( $false
| spl6_1
| ~ spl6_2
| ~ spl6_3 ),
inference(subsumption_resolution,[],[f68,f53]) ).
fof(f53,plain,
( in(sK0,sK2)
| ~ spl6_2 ),
inference(avatar_component_clause,[],[f52]) ).
fof(f68,plain,
( ~ in(sK0,sK2)
| spl6_1
| ~ spl6_3 ),
inference(subsumption_resolution,[],[f67,f57]) ).
fof(f57,plain,
( in(sK1,sK2)
| ~ spl6_3 ),
inference(avatar_component_clause,[],[f56]) ).
fof(f67,plain,
( ~ in(sK1,sK2)
| ~ in(sK0,sK2)
| spl6_1 ),
inference(resolution,[],[f66,f31]) ).
fof(f31,plain,
! [X2,X0,X1] :
( subset(unordered_pair(X0,X1),X2)
| ~ in(X1,X2)
| ~ in(X0,X2) ),
inference(cnf_transformation,[],[f19]) ).
fof(f66,plain,
( ~ subset(unordered_pair(sK0,sK1),sK2)
| spl6_1 ),
inference(resolution,[],[f50,f44]) ).
fof(f44,plain,
! [X0,X1] :
( sQ5_eqProxy(empty_set,set_difference(X0,X1))
| ~ subset(X0,X1) ),
inference(equality_proxy_replacement,[],[f35,f39]) ).
fof(f35,plain,
! [X0,X1] :
( empty_set = set_difference(X0,X1)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f20]) ).
fof(f50,plain,
( ~ sQ5_eqProxy(empty_set,set_difference(unordered_pair(sK0,sK1),sK2))
| spl6_1 ),
inference(avatar_component_clause,[],[f48]) ).
fof(f61,plain,
( spl6_1
| spl6_2 ),
inference(avatar_split_clause,[],[f42,f52,f48]) ).
fof(f42,plain,
( in(sK0,sK2)
| sQ5_eqProxy(empty_set,set_difference(unordered_pair(sK0,sK1),sK2)) ),
inference(equality_proxy_replacement,[],[f25,f39]) ).
fof(f25,plain,
( in(sK0,sK2)
| empty_set = set_difference(unordered_pair(sK0,sK1),sK2) ),
inference(cnf_transformation,[],[f17]) ).
fof(f17,plain,
( ( ~ in(sK1,sK2)
| ~ in(sK0,sK2)
| empty_set != set_difference(unordered_pair(sK0,sK1),sK2) )
& ( ( in(sK1,sK2)
& in(sK0,sK2) )
| empty_set = set_difference(unordered_pair(sK0,sK1),sK2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f15,f16]) ).
fof(f16,plain,
( ? [X0,X1,X2] :
( ( ~ in(X1,X2)
| ~ in(X0,X2)
| empty_set != set_difference(unordered_pair(X0,X1),X2) )
& ( ( in(X1,X2)
& in(X0,X2) )
| empty_set = set_difference(unordered_pair(X0,X1),X2) ) )
=> ( ( ~ in(sK1,sK2)
| ~ in(sK0,sK2)
| empty_set != set_difference(unordered_pair(sK0,sK1),sK2) )
& ( ( in(sK1,sK2)
& in(sK0,sK2) )
| empty_set = set_difference(unordered_pair(sK0,sK1),sK2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f15,plain,
? [X0,X1,X2] :
( ( ~ in(X1,X2)
| ~ in(X0,X2)
| empty_set != set_difference(unordered_pair(X0,X1),X2) )
& ( ( in(X1,X2)
& in(X0,X2) )
| empty_set = set_difference(unordered_pair(X0,X1),X2) ) ),
inference(flattening,[],[f14]) ).
fof(f14,plain,
? [X0,X1,X2] :
( ( ~ in(X1,X2)
| ~ in(X0,X2)
| empty_set != set_difference(unordered_pair(X0,X1),X2) )
& ( ( in(X1,X2)
& in(X0,X2) )
| empty_set = set_difference(unordered_pair(X0,X1),X2) ) ),
inference(nnf_transformation,[],[f12]) ).
fof(f12,plain,
? [X0,X1,X2] :
( empty_set = set_difference(unordered_pair(X0,X1),X2)
<~> ( in(X1,X2)
& in(X0,X2) ) ),
inference(ennf_transformation,[],[f10]) ).
fof(f10,negated_conjecture,
~ ! [X0,X1,X2] :
( empty_set = set_difference(unordered_pair(X0,X1),X2)
<=> ( in(X1,X2)
& in(X0,X2) ) ),
inference(negated_conjecture,[],[f9]) ).
fof(f9,conjecture,
! [X0,X1,X2] :
( empty_set = set_difference(unordered_pair(X0,X1),X2)
<=> ( in(X1,X2)
& in(X0,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.2cbzF6JVC5/Vampire---4.8_26263',t73_zfmisc_1) ).
fof(f60,plain,
( spl6_1
| spl6_3 ),
inference(avatar_split_clause,[],[f41,f56,f48]) ).
fof(f41,plain,
( in(sK1,sK2)
| sQ5_eqProxy(empty_set,set_difference(unordered_pair(sK0,sK1),sK2)) ),
inference(equality_proxy_replacement,[],[f26,f39]) ).
fof(f26,plain,
( in(sK1,sK2)
| empty_set = set_difference(unordered_pair(sK0,sK1),sK2) ),
inference(cnf_transformation,[],[f17]) ).
fof(f59,plain,
( ~ spl6_1
| ~ spl6_2
| ~ spl6_3 ),
inference(avatar_split_clause,[],[f40,f56,f52,f48]) ).
fof(f40,plain,
( ~ in(sK1,sK2)
| ~ in(sK0,sK2)
| ~ sQ5_eqProxy(empty_set,set_difference(unordered_pair(sK0,sK1),sK2)) ),
inference(equality_proxy_replacement,[],[f27,f39]) ).
fof(f27,plain,
( ~ in(sK1,sK2)
| ~ in(sK0,sK2)
| empty_set != set_difference(unordered_pair(sK0,sK1),sK2) ),
inference(cnf_transformation,[],[f17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.11 % Problem : SET929+1 : TPTP v8.1.2. Released v3.2.0.
% 0.08/0.12 % 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.10/0.32 % Computer : n016.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Tue Apr 30 17:49:11 EDT 2024
% 0.10/0.32 % CPUTime :
% 0.10/0.32 This is a FOF_THM_RFO_SEQ problem
% 0.10/0.32 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.2cbzF6JVC5/Vampire---4.8_26263
% 0.61/0.80 % (26376)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.61/0.80 % (26378)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.61/0.80 % (26377)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.61/0.80 % (26379)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.61/0.80 % (26380)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.61/0.81 % (26381)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.61/0.81 % (26383)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.61/0.81 % (26382)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.61/0.81 % (26383)First to succeed.
% 0.61/0.81 % (26376)Also succeeded, but the first one will report.
% 0.61/0.81 % (26381)Also succeeded, but the first one will report.
% 0.61/0.81 % (26383)Refutation found. Thanks to Tanya!
% 0.61/0.81 % SZS status Theorem for Vampire---4
% 0.61/0.81 % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.81 % (26383)------------------------------
% 0.61/0.81 % (26383)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.81 % (26383)Termination reason: Refutation
% 0.61/0.81
% 0.61/0.81 % (26383)Memory used [KB]: 989
% 0.61/0.81 % (26383)Time elapsed: 0.004 s
% 0.61/0.81 % (26383)Instructions burned: 4 (million)
% 0.61/0.81 % (26383)------------------------------
% 0.61/0.81 % (26383)------------------------------
% 0.61/0.81 % (26374)Success in time 0.48 s
% 0.61/0.81 % Vampire---4.8 exiting
%------------------------------------------------------------------------------