TSTP Solution File: SEU150+2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU150+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 : n026.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:17 EDT 2024
% Result : Theorem 0.57s 0.76s
% Output : Refutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 32 ( 13 unt; 0 def)
% Number of atoms : 118 ( 86 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 136 ( 50 ~; 52 |; 28 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 66 ( 56 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f433,plain,
$false,
inference(subsumption_resolution,[],[f432,f422]) ).
fof(f422,plain,
sK2 = sK3,
inference(duplicate_literal_removal,[],[f420]) ).
fof(f420,plain,
( sK2 = sK3
| sK2 = sK3 ),
inference(resolution,[],[f418,f321]) ).
fof(f321,plain,
! [X0,X1,X4] :
( ~ in(X4,unordered_pair(X0,X1))
| X0 = X4
| X1 = X4 ),
inference(equality_resolution,[],[f259]) ).
fof(f259,plain,
! [X2,X0,X1,X4] :
( X1 = X4
| X0 = X4
| ~ in(X4,X2)
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f164]) ).
fof(f164,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) = X2
| ( ( ( sK13(X0,X1,X2) != X1
& sK13(X0,X1,X2) != X0 )
| ~ in(sK13(X0,X1,X2),X2) )
& ( sK13(X0,X1,X2) = X1
| sK13(X0,X1,X2) = X0
| in(sK13(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( X1 != X4
& X0 != X4 ) )
& ( X1 = X4
| X0 = X4
| ~ in(X4,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK13])],[f162,f163]) ).
fof(f163,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ( X1 != X3
& X0 != X3 )
| ~ in(X3,X2) )
& ( X1 = X3
| X0 = X3
| in(X3,X2) ) )
=> ( ( ( sK13(X0,X1,X2) != X1
& sK13(X0,X1,X2) != X0 )
| ~ in(sK13(X0,X1,X2),X2) )
& ( sK13(X0,X1,X2) = X1
| sK13(X0,X1,X2) = X0
| in(sK13(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f162,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) = X2
| ? [X3] :
( ( ( X1 != X3
& X0 != X3 )
| ~ in(X3,X2) )
& ( X1 = X3
| X0 = X3
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( X1 != X4
& X0 != X4 ) )
& ( X1 = X4
| X0 = X4
| ~ in(X4,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(rectify,[],[f161]) ).
fof(f161,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) = X2
| ? [X3] :
( ( ( X1 != X3
& X0 != X3 )
| ~ in(X3,X2) )
& ( X1 = X3
| X0 = X3
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( X1 != X3
& X0 != X3 ) )
& ( X1 = X3
| X0 = X3
| ~ in(X3,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(flattening,[],[f160]) ).
fof(f160,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) = X2
| ? [X3] :
( ( ( X1 != X3
& X0 != X3 )
| ~ in(X3,X2) )
& ( X1 = X3
| X0 = X3
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( X1 != X3
& X0 != X3 ) )
& ( X1 = X3
| X0 = X3
| ~ in(X3,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f10,axiom,
! [X0,X1,X2] :
( unordered_pair(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( X1 = X3
| X0 = X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.3QSAOPqXk0/Vampire---4.8_30340',d2_tarski) ).
fof(f418,plain,
in(sK3,unordered_pair(sK2,sK2)),
inference(superposition,[],[f320,f282]) ).
fof(f282,plain,
unordered_pair(sK3,sK4) = unordered_pair(sK2,sK2),
inference(definition_unfolding,[],[f205,f198]) ).
fof(f198,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f64]) ).
fof(f64,axiom,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
file('/export/starexec/sandbox/tmp/tmp.3QSAOPqXk0/Vampire---4.8_30340',t69_enumset1) ).
fof(f205,plain,
singleton(sK2) = unordered_pair(sK3,sK4),
inference(cnf_transformation,[],[f122]) ).
fof(f122,plain,
( sK3 != sK4
& singleton(sK2) = unordered_pair(sK3,sK4) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f103,f121]) ).
fof(f121,plain,
( ? [X0,X1,X2] :
( X1 != X2
& singleton(X0) = unordered_pair(X1,X2) )
=> ( sK3 != sK4
& singleton(sK2) = unordered_pair(sK3,sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f103,plain,
? [X0,X1,X2] :
( X1 != X2
& singleton(X0) = unordered_pair(X1,X2) ),
inference(ennf_transformation,[],[f74]) ).
fof(f74,negated_conjecture,
~ ! [X0,X1,X2] :
( singleton(X0) = unordered_pair(X1,X2)
=> X1 = X2 ),
inference(negated_conjecture,[],[f73]) ).
fof(f73,conjecture,
! [X0,X1,X2] :
( singleton(X0) = unordered_pair(X1,X2)
=> X1 = X2 ),
file('/export/starexec/sandbox/tmp/tmp.3QSAOPqXk0/Vampire---4.8_30340',t9_zfmisc_1) ).
fof(f320,plain,
! [X1,X4] : in(X4,unordered_pair(X4,X1)),
inference(equality_resolution,[],[f319]) ).
fof(f319,plain,
! [X2,X1,X4] :
( in(X4,X2)
| unordered_pair(X4,X1) != X2 ),
inference(equality_resolution,[],[f260]) ).
fof(f260,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| X0 != X4
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f164]) ).
fof(f432,plain,
sK2 != sK3,
inference(superposition,[],[f206,f428]) ).
fof(f428,plain,
sK2 = sK4,
inference(duplicate_literal_removal,[],[f426]) ).
fof(f426,plain,
( sK2 = sK4
| sK2 = sK4 ),
inference(resolution,[],[f419,f321]) ).
fof(f419,plain,
in(sK4,unordered_pair(sK2,sK2)),
inference(superposition,[],[f318,f282]) ).
fof(f318,plain,
! [X0,X4] : in(X4,unordered_pair(X0,X4)),
inference(equality_resolution,[],[f317]) ).
fof(f317,plain,
! [X2,X0,X4] :
( in(X4,X2)
| unordered_pair(X0,X4) != X2 ),
inference(equality_resolution,[],[f261]) ).
fof(f261,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| X1 != X4
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f164]) ).
fof(f206,plain,
sK3 != sK4,
inference(cnf_transformation,[],[f122]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : SEU150+2 : TPTP v8.1.2. Released v3.3.0.
% 0.08/0.14 % 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.14/0.35 % Computer : n026.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Apr 30 16:35:04 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.14/0.36 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.3QSAOPqXk0/Vampire---4.8_30340
% 0.57/0.74 % (30716)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.57/0.74 % (30718)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.57/0.74 % (30719)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.57/0.74 % (30717)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.57/0.74 % (30720)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.57/0.74 % (30721)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.57/0.74 % (30722)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.57/0.75 % (30723)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.57/0.75 % (30721)First to succeed.
% 0.57/0.75 % (30718)Also succeeded, but the first one will report.
% 0.57/0.76 % (30717)Also succeeded, but the first one will report.
% 0.57/0.76 % (30721)Refutation found. Thanks to Tanya!
% 0.57/0.76 % SZS status Theorem for Vampire---4
% 0.57/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.57/0.76 % (30721)------------------------------
% 0.57/0.76 % (30721)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.57/0.76 % (30721)Termination reason: Refutation
% 0.57/0.76
% 0.57/0.76 % (30721)Memory used [KB]: 1157
% 0.57/0.76 % (30721)Time elapsed: 0.009 s
% 0.57/0.76 % (30721)Instructions burned: 12 (million)
% 0.57/0.76 % (30721)------------------------------
% 0.57/0.76 % (30721)------------------------------
% 0.57/0.76 % (30577)Success in time 0.39 s
% 0.57/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------