TSTP Solution File: SEU150+2 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SEU150+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n023.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 Apr 30 15:22:37 EDT 2024
% Result : Theorem 0.14s 0.33s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of formulae : 39 ( 15 unt; 0 def)
% Number of atoms : 162 ( 96 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 192 ( 69 ~; 71 |; 40 &)
% ( 7 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 89 ( 76 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f476,plain,
$false,
inference(trivial_inequality_removal,[],[f475]) ).
fof(f475,plain,
sK5 != sK5,
inference(superposition,[],[f187,f464]) ).
fof(f464,plain,
sK5 = sK6,
inference(resolution,[],[f459,f312]) ).
fof(f312,plain,
! [X3,X0] :
( ~ in(X3,singleton(X0))
| X0 = X3 ),
inference(equality_resolution,[],[f263]) ).
fof(f263,plain,
! [X3,X0,X1] :
( X0 = X3
| ~ in(X3,X1)
| singleton(X0) != X1 ),
inference(cnf_transformation,[],[f157]) ).
fof(f157,plain,
! [X0,X1] :
( ( singleton(X0) = X1
| ( ( sK13(X0,X1) != X0
| ~ in(sK13(X0,X1),X1) )
& ( sK13(X0,X1) = X0
| in(sK13(X0,X1),X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| X0 != X3 )
& ( X0 = X3
| ~ in(X3,X1) ) )
| singleton(X0) != X1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK13])],[f155,f156]) ).
fof(f156,plain,
! [X0,X1] :
( ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X0 = X2
| in(X2,X1) ) )
=> ( ( sK13(X0,X1) != X0
| ~ in(sK13(X0,X1),X1) )
& ( sK13(X0,X1) = X0
| in(sK13(X0,X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f155,plain,
! [X0,X1] :
( ( singleton(X0) = X1
| ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X0 = X2
| in(X2,X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| X0 != X3 )
& ( X0 = X3
| ~ in(X3,X1) ) )
| singleton(X0) != X1 ) ),
inference(rectify,[],[f154]) ).
fof(f154,plain,
! [X0,X1] :
( ( singleton(X0) = X1
| ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X0 = X2
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| X0 != X2 )
& ( X0 = X2
| ~ in(X2,X1) ) )
| singleton(X0) != X1 ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f7,axiom,
! [X0,X1] :
( singleton(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> X0 = X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_tarski) ).
fof(f459,plain,
in(sK5,singleton(sK6)),
inference(backward_demodulation,[],[f455,f456]) ).
fof(f456,plain,
sK4 = sK6,
inference(resolution,[],[f454,f312]) ).
fof(f454,plain,
in(sK6,singleton(sK4)),
inference(resolution,[],[f313,f346]) ).
fof(f346,plain,
sP0(sK6,sK5,singleton(sK4)),
inference(superposition,[],[f315,f186]) ).
fof(f186,plain,
singleton(sK4) = unordered_pair(sK5,sK6),
inference(cnf_transformation,[],[f125]) ).
fof(f125,plain,
( sK5 != sK6
& singleton(sK4) = unordered_pair(sK5,sK6) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6])],[f82,f124]) ).
fof(f124,plain,
( ? [X0,X1,X2] :
( X1 != X2
& singleton(X0) = unordered_pair(X1,X2) )
=> ( sK5 != sK6
& singleton(sK4) = unordered_pair(sK5,sK6) ) ),
introduced(choice_axiom,[]) ).
fof(f82,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/benchmark/theBenchmark.p',t9_zfmisc_1) ).
fof(f315,plain,
! [X0,X1] : sP0(X1,X0,unordered_pair(X0,X1)),
inference(equality_resolution,[],[f275]) ).
fof(f275,plain,
! [X2,X0,X1] :
( sP0(X1,X0,X2)
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f163]) ).
fof(f163,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) = X2
| ~ sP0(X1,X0,X2) )
& ( sP0(X1,X0,X2)
| unordered_pair(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f117]) ).
fof(f117,plain,
! [X0,X1,X2] :
( unordered_pair(X0,X1) = X2
<=> sP0(X1,X0,X2) ),
inference(definition_folding,[],[f10,f116]) ).
fof(f116,plain,
! [X1,X0,X2] :
( sP0(X1,X0,X2)
<=> ! [X3] :
( in(X3,X2)
<=> ( X1 = X3
| X0 = X3 ) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
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(f313,plain,
! [X2,X1,X4] :
( ~ sP0(X4,X1,X2)
| in(X4,X2) ),
inference(equality_resolution,[],[f271]) ).
fof(f271,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| X0 != X4
| ~ sP0(X0,X1,X2) ),
inference(cnf_transformation,[],[f162]) ).
fof(f162,plain,
! [X0,X1,X2] :
( ( sP0(X0,X1,X2)
| ( ( ( sK14(X0,X1,X2) != X0
& sK14(X0,X1,X2) != X1 )
| ~ in(sK14(X0,X1,X2),X2) )
& ( sK14(X0,X1,X2) = X0
| sK14(X0,X1,X2) = X1
| in(sK14(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( X0 != X4
& X1 != X4 ) )
& ( X0 = X4
| X1 = X4
| ~ in(X4,X2) ) )
| ~ sP0(X0,X1,X2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK14])],[f160,f161]) ).
fof(f161,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ( X0 != X3
& X1 != X3 )
| ~ in(X3,X2) )
& ( X0 = X3
| X1 = X3
| in(X3,X2) ) )
=> ( ( ( sK14(X0,X1,X2) != X0
& sK14(X0,X1,X2) != X1 )
| ~ in(sK14(X0,X1,X2),X2) )
& ( sK14(X0,X1,X2) = X0
| sK14(X0,X1,X2) = X1
| in(sK14(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f160,plain,
! [X0,X1,X2] :
( ( sP0(X0,X1,X2)
| ? [X3] :
( ( ( X0 != X3
& X1 != X3 )
| ~ in(X3,X2) )
& ( X0 = X3
| X1 = X3
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( X0 != X4
& X1 != X4 ) )
& ( X0 = X4
| X1 = X4
| ~ in(X4,X2) ) )
| ~ sP0(X0,X1,X2) ) ),
inference(rectify,[],[f159]) ).
fof(f159,plain,
! [X1,X0,X2] :
( ( sP0(X1,X0,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) ) )
| ~ sP0(X1,X0,X2) ) ),
inference(flattening,[],[f158]) ).
fof(f158,plain,
! [X1,X0,X2] :
( ( sP0(X1,X0,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) ) )
| ~ sP0(X1,X0,X2) ) ),
inference(nnf_transformation,[],[f116]) ).
fof(f455,plain,
in(sK5,singleton(sK4)),
inference(resolution,[],[f313,f368]) ).
fof(f368,plain,
sP0(sK5,sK6,singleton(sK4)),
inference(superposition,[],[f366,f186]) ).
fof(f366,plain,
! [X0,X1] : sP0(X1,X0,unordered_pair(X1,X0)),
inference(superposition,[],[f315,f240]) ).
fof(f240,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f187,plain,
sK5 != sK6,
inference(cnf_transformation,[],[f125]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SEU150+2 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.10 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.10/0.30 % Computer : n023.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 : Mon Apr 29 21:03:10 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.10/0.30 % (14673)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.31 % (14676)WARNING: value z3 for option sas not known
% 0.14/0.32 % (14680)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.14/0.32 % (14679)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.14/0.32 % (14674)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.14/0.32 % (14675)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.14/0.32 % (14676)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.14/0.32 % (14678)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.14/0.32 % (14677)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.14/0.32 TRYING [1]
% 0.14/0.32 TRYING [2]
% 0.14/0.32 % (14679)First to succeed.
% 0.14/0.33 % (14676)Also succeeded, but the first one will report.
% 0.14/0.33 % (14679)Refutation found. Thanks to Tanya!
% 0.14/0.33 % SZS status Theorem for theBenchmark
% 0.14/0.33 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.33 % (14679)------------------------------
% 0.14/0.33 % (14679)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.14/0.33 % (14679)Termination reason: Refutation
% 0.14/0.33
% 0.14/0.33 % (14679)Memory used [KB]: 949
% 0.14/0.33 % (14679)Time elapsed: 0.010 s
% 0.14/0.33 % (14679)Instructions burned: 16 (million)
% 0.14/0.33 % (14679)------------------------------
% 0.14/0.33 % (14679)------------------------------
% 0.14/0.33 % (14673)Success in time 0.026 s
%------------------------------------------------------------------------------