TSTP Solution File: SWC256+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC256+1 : TPTP v8.1.2. Released v2.4.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 : n011.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 : Sun May 5 09:49:45 EDT 2024
% Result : Theorem 0.57s 0.75s
% Output : Refutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 13
% Syntax : Number of formulae : 53 ( 11 unt; 0 def)
% Number of atoms : 278 ( 92 equ)
% Maximal formula atoms : 26 ( 5 avg)
% Number of connectives : 309 ( 84 ~; 73 |; 126 &)
% ( 7 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 4 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 72 ( 32 !; 40 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f325,plain,
$false,
inference(avatar_sat_refutation,[],[f249,f250,f258,f311]) ).
fof(f311,plain,
( ~ spl12_3
| ~ spl12_4 ),
inference(avatar_contradiction_clause,[],[f310]) ).
fof(f310,plain,
( $false
| ~ spl12_3
| ~ spl12_4 ),
inference(subsumption_resolution,[],[f309,f156]) ).
fof(f156,plain,
ssList(sK2),
inference(cnf_transformation,[],[f130]) ).
fof(f130,plain,
( ( ( nil = sK2
& nil = sK3 )
| ( memberP(sK3,sK4)
& sK2 = cons(sK4,nil)
& ssItem(sK4) ) )
& ~ singletonP(sK0)
& neq(sK1,nil)
& sK0 = sK2
& sK1 = sK3
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f99,f129,f128,f127,f126,f125]) ).
fof(f125,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ~ singletonP(X0)
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ~ singletonP(sK0)
& neq(X1,nil)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f126,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ~ singletonP(sK0)
& neq(X1,nil)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ~ singletonP(sK0)
& neq(sK1,nil)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f127,plain,
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ~ singletonP(sK0)
& neq(sK1,nil)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( nil = sK2
& nil = X3 )
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = sK2
& ssItem(X4) ) )
& ~ singletonP(sK0)
& neq(sK1,nil)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f128,plain,
( ? [X3] :
( ( ( nil = sK2
& nil = X3 )
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = sK2
& ssItem(X4) ) )
& ~ singletonP(sK0)
& neq(sK1,nil)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( ( nil = sK2
& nil = sK3 )
| ? [X4] :
( memberP(sK3,X4)
& cons(X4,nil) = sK2
& ssItem(X4) ) )
& ~ singletonP(sK0)
& neq(sK1,nil)
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f129,plain,
( ? [X4] :
( memberP(sK3,X4)
& cons(X4,nil) = sK2
& ssItem(X4) )
=> ( memberP(sK3,sK4)
& sK2 = cons(sK4,nil)
& ssItem(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ~ singletonP(X0)
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ~ singletonP(X0)
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssItem(X4)
=> ( ~ memberP(X3,X4)
| cons(X4,nil) != X2 ) ) )
| singletonP(X0)
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssItem(X4)
=> ( ~ memberP(X3,X4)
| cons(X4,nil) != X2 ) ) )
| singletonP(X0)
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.vHyY1pWUVK/Vampire---4.8_23093',co1) ).
fof(f309,plain,
( ~ ssList(sK2)
| ~ spl12_3
| ~ spl12_4 ),
inference(subsumption_resolution,[],[f308,f242]) ).
fof(f242,plain,
( ssItem(sK4)
| ~ spl12_4 ),
inference(avatar_component_clause,[],[f240]) ).
fof(f240,plain,
( spl12_4
<=> ssItem(sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_4])]) ).
fof(f308,plain,
( ~ ssItem(sK4)
| ~ ssList(sK2)
| ~ spl12_3 ),
inference(subsumption_resolution,[],[f294,f210]) ).
fof(f210,plain,
~ singletonP(sK2),
inference(definition_unfolding,[],[f161,f159]) ).
fof(f159,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f130]) ).
fof(f161,plain,
~ singletonP(sK0),
inference(cnf_transformation,[],[f130]) ).
fof(f294,plain,
( singletonP(sK2)
| ~ ssItem(sK4)
| ~ ssList(sK2)
| ~ spl12_3 ),
inference(superposition,[],[f218,f237]) ).
fof(f237,plain,
( sK2 = cons(sK4,nil)
| ~ spl12_3 ),
inference(avatar_component_clause,[],[f235]) ).
fof(f235,plain,
( spl12_3
<=> sK2 = cons(sK4,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_3])]) ).
fof(f218,plain,
! [X1] :
( singletonP(cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(equality_resolution,[],[f198]) ).
fof(f198,plain,
! [X0,X1] :
( singletonP(X0)
| cons(X1,nil) != X0
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f151]) ).
fof(f151,plain,
! [X0] :
( ( ( singletonP(X0)
| ! [X1] :
( cons(X1,nil) != X0
| ~ ssItem(X1) ) )
& ( ( cons(sK11(X0),nil) = X0
& ssItem(sK11(X0)) )
| ~ singletonP(X0) ) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK11])],[f149,f150]) ).
fof(f150,plain,
! [X0] :
( ? [X2] :
( cons(X2,nil) = X0
& ssItem(X2) )
=> ( cons(sK11(X0),nil) = X0
& ssItem(sK11(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f149,plain,
! [X0] :
( ( ( singletonP(X0)
| ! [X1] :
( cons(X1,nil) != X0
| ~ ssItem(X1) ) )
& ( ? [X2] :
( cons(X2,nil) = X0
& ssItem(X2) )
| ~ singletonP(X0) ) )
| ~ ssList(X0) ),
inference(rectify,[],[f148]) ).
fof(f148,plain,
! [X0] :
( ( ( singletonP(X0)
| ! [X1] :
( cons(X1,nil) != X0
| ~ ssItem(X1) ) )
& ( ? [X1] :
( cons(X1,nil) = X0
& ssItem(X1) )
| ~ singletonP(X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f113]) ).
fof(f113,plain,
! [X0] :
( ( singletonP(X0)
<=> ? [X1] :
( cons(X1,nil) = X0
& ssItem(X1) ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0] :
( ssList(X0)
=> ( singletonP(X0)
<=> ? [X1] :
( cons(X1,nil) = X0
& ssItem(X1) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.vHyY1pWUVK/Vampire---4.8_23093',ax4) ).
fof(f258,plain,
~ spl12_5,
inference(avatar_contradiction_clause,[],[f257]) ).
fof(f257,plain,
( $false
| ~ spl12_5 ),
inference(subsumption_resolution,[],[f256,f183]) ).
fof(f183,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.vHyY1pWUVK/Vampire---4.8_23093',ax17) ).
fof(f256,plain,
( ~ ssList(nil)
| ~ spl12_5 ),
inference(resolution,[],[f253,f221]) ).
fof(f221,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f214]) ).
fof(f214,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f179]) ).
fof(f179,plain,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f137]) ).
fof(f137,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f107]) ).
fof(f107,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.vHyY1pWUVK/Vampire---4.8_23093',ax15) ).
fof(f253,plain,
( neq(nil,nil)
| ~ spl12_5 ),
inference(superposition,[],[f211,f247]) ).
fof(f247,plain,
( nil = sK3
| ~ spl12_5 ),
inference(avatar_component_clause,[],[f245]) ).
fof(f245,plain,
( spl12_5
<=> nil = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl12_5])]) ).
fof(f211,plain,
neq(sK3,nil),
inference(definition_unfolding,[],[f160,f158]) ).
fof(f158,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f130]) ).
fof(f160,plain,
neq(sK1,nil),
inference(cnf_transformation,[],[f130]) ).
fof(f250,plain,
( spl12_4
| spl12_5 ),
inference(avatar_split_clause,[],[f162,f245,f240]) ).
fof(f162,plain,
( nil = sK3
| ssItem(sK4) ),
inference(cnf_transformation,[],[f130]) ).
fof(f249,plain,
( spl12_3
| spl12_5 ),
inference(avatar_split_clause,[],[f163,f245,f235]) ).
fof(f163,plain,
( nil = sK3
| sK2 = cons(sK4,nil) ),
inference(cnf_transformation,[],[f130]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SWC256+1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/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 : n011.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.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 20:32:38 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 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.vHyY1pWUVK/Vampire---4.8_23093
% 0.57/0.75 % (23356)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 % (23350)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.75 % (23353)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.75 % (23352)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.75 % (23351)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.75 % (23354)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.75 % (23355)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.75 % (23357)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 % (23357)Refutation not found, incomplete strategy% (23357)------------------------------
% 0.57/0.75 % (23357)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.75 % (23357)Termination reason: Refutation not found, incomplete strategy
% 0.57/0.75
% 0.57/0.75 % (23357)Memory used [KB]: 1137
% 0.57/0.75 % (23357)Time elapsed: 0.004 s
% 0.57/0.75 % (23357)Instructions burned: 5 (million)
% 0.57/0.75 % (23357)------------------------------
% 0.57/0.75 % (23357)------------------------------
% 0.57/0.75 % (23355)First to succeed.
% 0.57/0.75 % (23356)Also succeeded, but the first one will report.
% 0.57/0.75 % (23355)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-23346"
% 0.57/0.75 % (23352)Also succeeded, but the first one will report.
% 0.57/0.75 % (23355)Refutation found. Thanks to Tanya!
% 0.57/0.75 % SZS status Theorem for Vampire---4
% 0.57/0.75 % SZS output start Proof for Vampire---4
% See solution above
% 0.57/0.75 % (23355)------------------------------
% 0.57/0.75 % (23355)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.75 % (23355)Termination reason: Refutation
% 0.57/0.75
% 0.57/0.75 % (23355)Memory used [KB]: 1180
% 0.57/0.75 % (23355)Time elapsed: 0.007 s
% 0.57/0.75 % (23355)Instructions burned: 9 (million)
% 0.57/0.75 % (23346)Success in time 0.378 s
% 0.57/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------