TSTP Solution File: SWC415+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC415+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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n005.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 04:02:01 EDT 2024
% Result : Theorem 0.66s 0.82s
% Output : Refutation 0.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of formulae : 58 ( 12 unt; 0 def)
% Number of atoms : 348 ( 107 equ)
% Maximal formula atoms : 34 ( 6 avg)
% Number of connectives : 456 ( 166 ~; 154 |; 109 &)
% ( 7 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 6 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 83 ( 53 !; 30 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f210,plain,
$false,
inference(avatar_sat_refutation,[],[f173,f178,f181,f183,f196,f209]) ).
fof(f209,plain,
( ~ spl5_4
| spl5_5 ),
inference(avatar_contradiction_clause,[],[f208]) ).
fof(f208,plain,
( $false
| ~ spl5_4
| spl5_5 ),
inference(subsumption_resolution,[],[f204,f186]) ).
fof(f186,plain,
~ neq(nil,nil),
inference(unit_resulting_resolution,[],[f136,f155]) ).
fof(f155,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f154]) ).
fof(f154,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f134]) ).
fof(f134,plain,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f119]) ).
fof(f119,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f103]) ).
fof(f103,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/sandbox2/tmp/tmp.lYMySKSp4d/Vampire---4.8_15188',ax15) ).
fof(f136,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.lYMySKSp4d/Vampire---4.8_15188',ax17) ).
fof(f204,plain,
( neq(nil,nil)
| ~ spl5_4
| spl5_5 ),
inference(backward_demodulation,[],[f171,f198]) ).
fof(f198,plain,
( nil = sK3
| spl5_5 ),
inference(unit_resulting_resolution,[],[f125,f177,f142]) ).
fof(f142,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f113]) ).
fof(f113,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f112]) ).
fof(f112,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f24]) ).
fof(f24,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ssList(tl(X0)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.lYMySKSp4d/Vampire---4.8_15188',ax24) ).
fof(f177,plain,
( ~ ssList(tl(sK3))
| spl5_5 ),
inference(avatar_component_clause,[],[f175]) ).
fof(f175,plain,
( spl5_5
<=> ssList(tl(sK3)) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_5])]) ).
fof(f125,plain,
ssList(sK3),
inference(cnf_transformation,[],[f118]) ).
fof(f118,plain,
( ( ( ~ neq(sK3,nil)
& neq(sK1,nil) )
| ( ! [X4] :
( ~ neq(nil,sK1)
| sK0 != X4
| tl(sK1) != X4
| ~ ssList(X4) )
& ! [X5] :
( ~ neq(nil,sK3)
| tl(sK3) != X5
| sK2 = X5
| ~ ssList(X5) )
& 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])],[f102,f117,f116,f115,f114]) ).
fof(f114,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ! [X4] :
( ~ neq(nil,X1)
| X0 != X4
| tl(X1) != X4
| ~ ssList(X4) )
& ! [X5] :
( ~ neq(nil,X3)
| tl(X3) != X5
| X2 = X5
| ~ ssList(X5) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ! [X4] :
( ~ neq(nil,X1)
| sK0 != X4
| tl(X1) != X4
| ~ ssList(X4) )
& ! [X5] :
( ~ neq(nil,X3)
| tl(X3) != X5
| X2 = X5
| ~ ssList(X5) )
& neq(X1,nil) ) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f115,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ! [X4] :
( ~ neq(nil,X1)
| sK0 != X4
| tl(X1) != X4
| ~ ssList(X4) )
& ! [X5] :
( ~ neq(nil,X3)
| tl(X3) != X5
| X2 = X5
| ~ ssList(X5) )
& neq(X1,nil) ) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK1,nil) )
| ( ! [X4] :
( ~ neq(nil,sK1)
| sK0 != X4
| tl(sK1) != X4
| ~ ssList(X4) )
& ! [X5] :
( ~ neq(nil,X3)
| tl(X3) != X5
| X2 = X5
| ~ ssList(X5) )
& neq(sK1,nil) ) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f116,plain,
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK1,nil) )
| ( ! [X4] :
( ~ neq(nil,sK1)
| sK0 != X4
| tl(sK1) != X4
| ~ ssList(X4) )
& ! [X5] :
( ~ neq(nil,X3)
| tl(X3) != X5
| X2 = X5
| ~ ssList(X5) )
& neq(sK1,nil) ) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK1,nil) )
| ( ! [X4] :
( ~ neq(nil,sK1)
| sK0 != X4
| tl(sK1) != X4
| ~ ssList(X4) )
& ! [X5] :
( ~ neq(nil,X3)
| tl(X3) != X5
| sK2 = X5
| ~ ssList(X5) )
& neq(sK1,nil) ) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f117,plain,
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK1,nil) )
| ( ! [X4] :
( ~ neq(nil,sK1)
| sK0 != X4
| tl(sK1) != X4
| ~ ssList(X4) )
& ! [X5] :
( ~ neq(nil,X3)
| tl(X3) != X5
| sK2 = X5
| ~ ssList(X5) )
& neq(sK1,nil) ) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( ( ~ neq(sK3,nil)
& neq(sK1,nil) )
| ( ! [X4] :
( ~ neq(nil,sK1)
| sK0 != X4
| tl(sK1) != X4
| ~ ssList(X4) )
& ! [X5] :
( ~ neq(nil,sK3)
| tl(sK3) != X5
| sK2 = X5
| ~ ssList(X5) )
& neq(sK1,nil) ) )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f102,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ! [X4] :
( ~ neq(nil,X1)
| X0 != X4
| tl(X1) != X4
| ~ ssList(X4) )
& ! [X5] :
( ~ neq(nil,X3)
| tl(X3) != X5
| X2 = X5
| ~ ssList(X5) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f101]) ).
fof(f101,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ! [X4] :
( ~ neq(nil,X1)
| X0 != X4
| tl(X1) != X4
| ~ ssList(X4) )
& ! [X5] :
( ~ neq(nil,X3)
| tl(X3) != X5
| X2 = X5
| ~ ssList(X5) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( ? [X4] :
( neq(nil,X1)
& X0 = X4
& tl(X1) = X4
& ssList(X4) )
| ? [X5] :
( neq(nil,X3)
& tl(X3) = X5
& X2 != X5
& ssList(X5) )
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( ? [X5] :
( neq(nil,X1)
& X0 = X5
& tl(X1) = X5
& ssList(X5) )
| ? [X4] :
( neq(nil,X3)
& tl(X3) = X4
& X2 != X4
& ssList(X4) )
| ~ 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)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( ? [X5] :
( neq(nil,X1)
& X0 = X5
& tl(X1) = X5
& ssList(X5) )
| ? [X4] :
( neq(nil,X3)
& tl(X3) = X4
& X2 != X4
& ssList(X4) )
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.lYMySKSp4d/Vampire---4.8_15188',co1) ).
fof(f171,plain,
( neq(sK3,nil)
| ~ spl5_4 ),
inference(avatar_component_clause,[],[f170]) ).
fof(f170,plain,
( spl5_4
<=> neq(sK3,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_4])]) ).
fof(f196,plain,
( spl5_3
| ~ spl5_4 ),
inference(avatar_contradiction_clause,[],[f195]) ).
fof(f195,plain,
( $false
| spl5_3
| ~ spl5_4 ),
inference(subsumption_resolution,[],[f193,f186]) ).
fof(f193,plain,
( neq(nil,nil)
| spl5_3
| ~ spl5_4 ),
inference(backward_demodulation,[],[f171,f187]) ).
fof(f187,plain,
( nil = sK3
| spl5_3 ),
inference(unit_resulting_resolution,[],[f136,f125,f168,f135]) ).
fof(f135,plain,
! [X0,X1] :
( X0 = X1
| neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f119]) ).
fof(f168,plain,
( ~ neq(nil,sK3)
| spl5_3 ),
inference(avatar_component_clause,[],[f166]) ).
fof(f166,plain,
( spl5_3
<=> neq(nil,sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_3])]) ).
fof(f183,plain,
spl5_1,
inference(avatar_split_clause,[],[f149,f158]) ).
fof(f158,plain,
( spl5_1
<=> ssList(sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_1])]) ).
fof(f149,plain,
ssList(sK2),
inference(definition_unfolding,[],[f122,f127]) ).
fof(f127,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f118]) ).
fof(f122,plain,
ssList(sK0),
inference(cnf_transformation,[],[f118]) ).
fof(f181,plain,
spl5_4,
inference(avatar_split_clause,[],[f156,f170]) ).
fof(f156,plain,
neq(sK3,nil),
inference(duplicate_literal_removal,[],[f147]) ).
fof(f147,plain,
( neq(sK3,nil)
| neq(sK3,nil) ),
inference(definition_unfolding,[],[f128,f126,f126]) ).
fof(f126,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f118]) ).
fof(f128,plain,
( neq(sK1,nil)
| neq(sK1,nil) ),
inference(cnf_transformation,[],[f118]) ).
fof(f178,plain,
( ~ spl5_5
| spl5_2
| ~ spl5_3
| ~ spl5_4 ),
inference(avatar_split_clause,[],[f151,f170,f166,f162,f175]) ).
fof(f162,plain,
( spl5_2
<=> sK2 = tl(sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_2])]) ).
fof(f151,plain,
( ~ neq(sK3,nil)
| ~ neq(nil,sK3)
| sK2 = tl(sK3)
| ~ ssList(tl(sK3)) ),
inference(equality_resolution,[],[f132]) ).
fof(f132,plain,
! [X5] :
( ~ neq(sK3,nil)
| ~ neq(nil,sK3)
| tl(sK3) != X5
| sK2 = X5
| ~ ssList(X5) ),
inference(cnf_transformation,[],[f118]) ).
fof(f173,plain,
( ~ spl5_1
| ~ spl5_2
| ~ spl5_3
| ~ spl5_4 ),
inference(avatar_split_clause,[],[f150,f170,f166,f162,f158]) ).
fof(f150,plain,
( ~ neq(sK3,nil)
| ~ neq(nil,sK3)
| sK2 != tl(sK3)
| ~ ssList(sK2) ),
inference(equality_resolution,[],[f143]) ).
fof(f143,plain,
! [X4] :
( ~ neq(sK3,nil)
| ~ neq(nil,sK3)
| sK2 != X4
| tl(sK3) != X4
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f133,f126,f127,f126]) ).
fof(f133,plain,
! [X4] :
( ~ neq(sK3,nil)
| ~ neq(nil,sK1)
| sK0 != X4
| tl(sK1) != X4
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f118]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SWC415+1 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.12/0.33 % Computer : n005.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Apr 30 18:15:26 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.12/0.33 This is a FOF_THM_RFO_SEQ problem
% 0.12/0.33 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.lYMySKSp4d/Vampire---4.8_15188
% 0.66/0.81 % (15303)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.66/0.81 % (15301)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.66/0.81 % (15298)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.66/0.81 % (15300)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.66/0.81 % (15299)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.66/0.81 % (15302)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.66/0.81 % (15304)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.66/0.81 % (15305)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.66/0.81 % (15301)First to succeed.
% 0.66/0.81 % (15305)Refutation not found, incomplete strategy% (15305)------------------------------
% 0.66/0.81 % (15305)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.66/0.81 % (15305)Termination reason: Refutation not found, incomplete strategy
% 0.66/0.81
% 0.66/0.81 % (15305)Memory used [KB]: 1151
% 0.66/0.81 % (15305)Time elapsed: 0.004 s
% 0.66/0.81 % (15305)Instructions burned: 5 (million)
% 0.66/0.81 % (15305)------------------------------
% 0.66/0.81 % (15305)------------------------------
% 0.66/0.82 % (15303)Also succeeded, but the first one will report.
% 0.66/0.82 % (15301)Refutation found. Thanks to Tanya!
% 0.66/0.82 % SZS status Theorem for Vampire---4
% 0.66/0.82 % SZS output start Proof for Vampire---4
% See solution above
% 0.66/0.82 % (15301)------------------------------
% 0.66/0.82 % (15301)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.66/0.82 % (15301)Termination reason: Refutation
% 0.66/0.82
% 0.66/0.82 % (15301)Memory used [KB]: 1149
% 0.66/0.82 % (15301)Time elapsed: 0.005 s
% 0.66/0.82 % (15301)Instructions burned: 6 (million)
% 0.66/0.82 % (15301)------------------------------
% 0.66/0.82 % (15301)------------------------------
% 0.66/0.82 % (15297)Success in time 0.479 s
% 0.66/0.82 % Vampire---4.8 exiting
%------------------------------------------------------------------------------