TSTP Solution File: SEU160+2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU160+2 : TPTP v8.1.2. Released v3.3.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:50:20 EDT 2024
% Result : Theorem 0.65s 0.82s
% Output : Refutation 0.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 45 ( 5 unt; 0 def)
% Number of atoms : 136 ( 64 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 147 ( 56 ~; 63 |; 19 &)
% ( 7 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 4 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 38 ( 30 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f473,plain,
$false,
inference(avatar_sat_refutation,[],[f450,f455,f457,f464,f472]) ).
fof(f472,plain,
( spl23_1
| ~ spl23_3 ),
inference(avatar_contradiction_clause,[],[f471]) ).
fof(f471,plain,
( $false
| spl23_1
| ~ spl23_3 ),
inference(subsumption_resolution,[],[f470,f411]) ).
fof(f411,plain,
! [X1] : subset(empty_set,unordered_pair(X1,X1)),
inference(equality_resolution,[],[f368]) ).
fof(f368,plain,
! [X0,X1] :
( subset(X0,unordered_pair(X1,X1))
| empty_set != X0 ),
inference(definition_unfolding,[],[f227,f268]) ).
fof(f268,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f82]) ).
fof(f82,axiom,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
file('/export/starexec/sandbox/tmp/tmp.FjTNvWjrA4/Vampire---4.8_28097',t69_enumset1) ).
fof(f227,plain,
! [X0,X1] :
( subset(X0,singleton(X1))
| empty_set != X0 ),
inference(cnf_transformation,[],[f143]) ).
fof(f143,plain,
! [X0,X1] :
( ( subset(X0,singleton(X1))
| ( singleton(X1) != X0
& empty_set != X0 ) )
& ( singleton(X1) = X0
| empty_set = X0
| ~ subset(X0,singleton(X1)) ) ),
inference(flattening,[],[f142]) ).
fof(f142,plain,
! [X0,X1] :
( ( subset(X0,singleton(X1))
| ( singleton(X1) != X0
& empty_set != X0 ) )
& ( singleton(X1) = X0
| empty_set = X0
| ~ subset(X0,singleton(X1)) ) ),
inference(nnf_transformation,[],[f44]) ).
fof(f44,axiom,
! [X0,X1] :
( subset(X0,singleton(X1))
<=> ( singleton(X1) = X0
| empty_set = X0 ) ),
file('/export/starexec/sandbox/tmp/tmp.FjTNvWjrA4/Vampire---4.8_28097',l4_zfmisc_1) ).
fof(f470,plain,
( ~ subset(empty_set,unordered_pair(sK1,sK1))
| spl23_1
| ~ spl23_3 ),
inference(superposition,[],[f445,f453]) ).
fof(f453,plain,
( empty_set = sK0
| ~ spl23_3 ),
inference(avatar_component_clause,[],[f452]) ).
fof(f452,plain,
( spl23_3
<=> empty_set = sK0 ),
introduced(avatar_definition,[new_symbols(naming,[spl23_3])]) ).
fof(f445,plain,
( ~ subset(sK0,unordered_pair(sK1,sK1))
| spl23_1 ),
inference(avatar_component_clause,[],[f443]) ).
fof(f443,plain,
( spl23_1
<=> subset(sK0,unordered_pair(sK1,sK1)) ),
introduced(avatar_definition,[new_symbols(naming,[spl23_1])]) ).
fof(f464,plain,
( spl23_1
| ~ spl23_2 ),
inference(avatar_contradiction_clause,[],[f463]) ).
fof(f463,plain,
( $false
| spl23_1
| ~ spl23_2 ),
inference(subsumption_resolution,[],[f462,f420]) ).
fof(f420,plain,
! [X1] : subset(X1,X1),
inference(equality_resolution,[],[f301]) ).
fof(f301,plain,
! [X0,X1] :
( subset(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[],[f181]) ).
fof(f181,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 ) ),
inference(flattening,[],[f180]) ).
fof(f180,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f6,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X1,X0)
& subset(X0,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.FjTNvWjrA4/Vampire---4.8_28097',d10_xboole_0) ).
fof(f462,plain,
( ~ subset(unordered_pair(sK1,sK1),unordered_pair(sK1,sK1))
| spl23_1
| ~ spl23_2 ),
inference(forward_demodulation,[],[f445,f448]) ).
fof(f448,plain,
( sK0 = unordered_pair(sK1,sK1)
| ~ spl23_2 ),
inference(avatar_component_clause,[],[f447]) ).
fof(f447,plain,
( spl23_2
<=> sK0 = unordered_pair(sK1,sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl23_2])]) ).
fof(f457,plain,
( spl23_3
| spl23_2 ),
inference(avatar_split_clause,[],[f456,f447,f452]) ).
fof(f456,plain,
( sK0 = unordered_pair(sK1,sK1)
| empty_set = sK0 ),
inference(subsumption_resolution,[],[f384,f369]) ).
fof(f369,plain,
! [X0,X1] :
( unordered_pair(X1,X1) = X0
| empty_set = X0
| ~ subset(X0,unordered_pair(X1,X1)) ),
inference(definition_unfolding,[],[f226,f268,f268]) ).
fof(f226,plain,
! [X0,X1] :
( singleton(X1) = X0
| empty_set = X0
| ~ subset(X0,singleton(X1)) ),
inference(cnf_transformation,[],[f143]) ).
fof(f384,plain,
( sK0 = unordered_pair(sK1,sK1)
| empty_set = sK0
| subset(sK0,unordered_pair(sK1,sK1)) ),
inference(definition_unfolding,[],[f254,f268,f268]) ).
fof(f254,plain,
( sK0 = singleton(sK1)
| empty_set = sK0
| subset(sK0,singleton(sK1)) ),
inference(cnf_transformation,[],[f153]) ).
fof(f153,plain,
( ( ( sK0 != singleton(sK1)
& empty_set != sK0 )
| ~ subset(sK0,singleton(sK1)) )
& ( sK0 = singleton(sK1)
| empty_set = sK0
| subset(sK0,singleton(sK1)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f151,f152]) ).
fof(f152,plain,
( ? [X0,X1] :
( ( ( singleton(X1) != X0
& empty_set != X0 )
| ~ subset(X0,singleton(X1)) )
& ( singleton(X1) = X0
| empty_set = X0
| subset(X0,singleton(X1)) ) )
=> ( ( ( sK0 != singleton(sK1)
& empty_set != sK0 )
| ~ subset(sK0,singleton(sK1)) )
& ( sK0 = singleton(sK1)
| empty_set = sK0
| subset(sK0,singleton(sK1)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f151,plain,
? [X0,X1] :
( ( ( singleton(X1) != X0
& empty_set != X0 )
| ~ subset(X0,singleton(X1)) )
& ( singleton(X1) = X0
| empty_set = X0
| subset(X0,singleton(X1)) ) ),
inference(flattening,[],[f150]) ).
fof(f150,plain,
? [X0,X1] :
( ( ( singleton(X1) != X0
& empty_set != X0 )
| ~ subset(X0,singleton(X1)) )
& ( singleton(X1) = X0
| empty_set = X0
| subset(X0,singleton(X1)) ) ),
inference(nnf_transformation,[],[f115]) ).
fof(f115,plain,
? [X0,X1] :
( subset(X0,singleton(X1))
<~> ( singleton(X1) = X0
| empty_set = X0 ) ),
inference(ennf_transformation,[],[f71]) ).
fof(f71,negated_conjecture,
~ ! [X0,X1] :
( subset(X0,singleton(X1))
<=> ( singleton(X1) = X0
| empty_set = X0 ) ),
inference(negated_conjecture,[],[f70]) ).
fof(f70,conjecture,
! [X0,X1] :
( subset(X0,singleton(X1))
<=> ( singleton(X1) = X0
| empty_set = X0 ) ),
file('/export/starexec/sandbox/tmp/tmp.FjTNvWjrA4/Vampire---4.8_28097',t39_zfmisc_1) ).
fof(f455,plain,
( ~ spl23_1
| ~ spl23_3 ),
inference(avatar_split_clause,[],[f383,f452,f443]) ).
fof(f383,plain,
( empty_set != sK0
| ~ subset(sK0,unordered_pair(sK1,sK1)) ),
inference(definition_unfolding,[],[f255,f268]) ).
fof(f255,plain,
( empty_set != sK0
| ~ subset(sK0,singleton(sK1)) ),
inference(cnf_transformation,[],[f153]) ).
fof(f450,plain,
( ~ spl23_1
| ~ spl23_2 ),
inference(avatar_split_clause,[],[f382,f447,f443]) ).
fof(f382,plain,
( sK0 != unordered_pair(sK1,sK1)
| ~ subset(sK0,unordered_pair(sK1,sK1)) ),
inference(definition_unfolding,[],[f256,f268,f268]) ).
fof(f256,plain,
( sK0 != singleton(sK1)
| ~ subset(sK0,singleton(sK1)) ),
inference(cnf_transformation,[],[f153]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SEU160+2 : TPTP v8.1.2. Released v3.3.0.
% 0.04/0.15 % 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.15/0.36 % Computer : n021.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Tue Apr 30 16:13:26 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.15/0.37 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.37 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.FjTNvWjrA4/Vampire---4.8_28097
% 0.60/0.81 % (28513)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.81 % (28506)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.81 % (28508)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.81 % (28509)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.81 % (28507)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.81 % (28510)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.81 % (28511)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.81 % (28512)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.65/0.82 % (28511)First to succeed.
% 0.65/0.82 % (28508)Also succeeded, but the first one will report.
% 0.65/0.82 % (28509)Also succeeded, but the first one will report.
% 0.65/0.82 % (28511)Refutation found. Thanks to Tanya!
% 0.65/0.82 % SZS status Theorem for Vampire---4
% 0.65/0.82 % SZS output start Proof for Vampire---4
% See solution above
% 0.65/0.82 % (28511)------------------------------
% 0.65/0.82 % (28511)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.65/0.82 % (28511)Termination reason: Refutation
% 0.65/0.82
% 0.65/0.82 % (28511)Memory used [KB]: 1203
% 0.65/0.82 % (28511)Time elapsed: 0.009 s
% 0.65/0.82 % (28511)Instructions burned: 12 (million)
% 0.65/0.82 % (28511)------------------------------
% 0.65/0.82 % (28511)------------------------------
% 0.65/0.82 % (28350)Success in time 0.447 s
% 0.65/0.82 % Vampire---4.8 exiting
%------------------------------------------------------------------------------