TSTP Solution File: SEU149+2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU149+2 : TPTP v8.2.0. 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 : n008.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 : Tue May 21 03:45:03 EDT 2024
% Result : Theorem 0.56s 0.73s
% Output : Refutation 0.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 9 unt; 0 def)
% Number of atoms : 107 ( 79 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 128 ( 46 ~; 48 |; 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 : 57 ( 47 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f419,plain,
$false,
inference(subsumption_resolution,[],[f418,f203]) ).
fof(f203,plain,
sK2 != sK3,
inference(cnf_transformation,[],[f120]) ).
fof(f120,plain,
( sK2 != sK3
& singleton(sK2) = unordered_pair(sK3,sK4) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f101,f119]) ).
fof(f119,plain,
( ? [X0,X1,X2] :
( X0 != X1
& singleton(X0) = unordered_pair(X1,X2) )
=> ( sK2 != sK3
& singleton(sK2) = unordered_pair(sK3,sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f101,plain,
? [X0,X1,X2] :
( X0 != X1
& singleton(X0) = unordered_pair(X1,X2) ),
inference(ennf_transformation,[],[f73]) ).
fof(f73,negated_conjecture,
~ ! [X0,X1,X2] :
( singleton(X0) = unordered_pair(X1,X2)
=> X0 = X1 ),
inference(negated_conjecture,[],[f72]) ).
fof(f72,conjecture,
! [X0,X1,X2] :
( singleton(X0) = unordered_pair(X1,X2)
=> X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_zfmisc_1) ).
fof(f418,plain,
sK2 = sK3,
inference(duplicate_literal_removal,[],[f416]) ).
fof(f416,plain,
( sK2 = sK3
| sK2 = sK3 ),
inference(resolution,[],[f414,f317]) ).
fof(f317,plain,
! [X0,X1,X4] :
( ~ in(X4,unordered_pair(X0,X1))
| X0 = X4
| X1 = X4 ),
inference(equality_resolution,[],[f256]) ).
fof(f256,plain,
! [X2,X0,X1,X4] :
( X1 = X4
| X0 = X4
| ~ in(X4,X2)
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f162]) ).
fof(f162,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])],[f160,f161]) ).
fof(f161,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(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) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( X1 != X4
& X0 != X4 ) )
& ( X1 = X4
| X0 = X4
| ~ in(X4,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(rectify,[],[f159]) ).
fof(f159,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,[],[f158]) ).
fof(f158,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/benchmark/theBenchmark.p',d2_tarski) ).
fof(f414,plain,
in(sK3,unordered_pair(sK2,sK2)),
inference(superposition,[],[f316,f278]) ).
fof(f278,plain,
unordered_pair(sK3,sK4) = unordered_pair(sK2,sK2),
inference(definition_unfolding,[],[f202,f196]) ).
fof(f196,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/benchmark/theBenchmark.p',t69_enumset1) ).
fof(f202,plain,
singleton(sK2) = unordered_pair(sK3,sK4),
inference(cnf_transformation,[],[f120]) ).
fof(f316,plain,
! [X1,X4] : in(X4,unordered_pair(X4,X1)),
inference(equality_resolution,[],[f315]) ).
fof(f315,plain,
! [X2,X1,X4] :
( in(X4,X2)
| unordered_pair(X4,X1) != X2 ),
inference(equality_resolution,[],[f257]) ).
fof(f257,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| X0 != X4
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f162]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : SEU149+2 : TPTP v8.2.0. Released v3.3.0.
% 0.02/0.10 % 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.30 % Computer : n008.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Sun May 19 16:11:22 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.10/0.30 This is a FOF_THM_RFO_SEQ problem
% 0.10/0.31 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/benchmark/theBenchmark.p
% 0.56/0.72 % (22704)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 theBenchmark for (2995ds/34Mi)
% 0.56/0.72 % (22705)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2995ds/45Mi)
% 0.56/0.72 % (22706)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 theBenchmark for (2995ds/83Mi)
% 0.56/0.72 % (22703)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2995ds/33Mi)
% 0.56/0.72 % (22700)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 theBenchmark for (2995ds/34Mi)
% 0.56/0.72 % (22701)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 theBenchmark for (2995ds/51Mi)
% 0.56/0.72 % (22702)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.56/0.72 % (22707)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2995ds/56Mi)
% 0.56/0.73 % (22705)First to succeed.
% 0.56/0.73 % (22705)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-22699"
% 0.56/0.73 % (22702)Also succeeded, but the first one will report.
% 0.56/0.73 % (22705)Refutation found. Thanks to Tanya!
% 0.56/0.73 % SZS status Theorem for theBenchmark
% 0.56/0.73 % SZS output start Proof for theBenchmark
% See solution above
% 0.56/0.73 % (22705)------------------------------
% 0.56/0.73 % (22705)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.73 % (22705)Termination reason: Refutation
% 0.56/0.73
% 0.56/0.73 % (22705)Memory used [KB]: 1156
% 0.56/0.73 % (22705)Time elapsed: 0.008 s
% 0.56/0.73 % (22705)Instructions burned: 12 (million)
% 0.56/0.73 % (22699)Success in time 0.414 s
% 0.56/0.73 % Vampire---4.8 exiting
%------------------------------------------------------------------------------