TSTP Solution File: SWC030+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC030+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 : n024.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:48:04 EDT 2024
% Result : Theorem 0.59s 0.77s
% Output : Refutation 0.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 14
% Syntax : Number of formulae : 71 ( 9 unt; 0 def)
% Number of atoms : 343 ( 178 equ)
% Maximal formula atoms : 28 ( 4 avg)
% Number of connectives : 388 ( 116 ~; 106 |; 138 &)
% ( 7 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 6 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 73 ( 25 !; 48 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f250,plain,
$false,
inference(avatar_sat_refutation,[],[f187,f188,f218,f231,f232,f233,f249]) ).
fof(f249,plain,
( ~ spl10_1
| spl10_2
| ~ spl10_3
| ~ spl10_5 ),
inference(avatar_contradiction_clause,[],[f248]) ).
fof(f248,plain,
( $false
| ~ spl10_1
| spl10_2
| ~ spl10_3
| ~ spl10_5 ),
inference(subsumption_resolution,[],[f247,f186]) ).
fof(f186,plain,
( nil != sK3
| spl10_2 ),
inference(avatar_component_clause,[],[f184]) ).
fof(f184,plain,
( spl10_2
<=> nil = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl10_2])]) ).
fof(f247,plain,
( nil = sK3
| ~ spl10_1
| ~ spl10_3
| ~ spl10_5 ),
inference(backward_demodulation,[],[f245,f246]) ).
fof(f246,plain,
( nil = app(nil,nil)
| ~ spl10_1
| ~ spl10_3
| ~ spl10_5 ),
inference(backward_demodulation,[],[f236,f243]) ).
fof(f243,plain,
( nil = sK5
| ~ spl10_1
| ~ spl10_3
| ~ spl10_5 ),
inference(subsumption_resolution,[],[f239,f221]) ).
fof(f221,plain,
( ssList(sK5)
| ~ spl10_3 ),
inference(avatar_component_clause,[],[f220]) ).
fof(f220,plain,
( spl10_3
<=> ssList(sK5) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_3])]) ).
fof(f239,plain,
( nil = sK5
| ~ ssList(sK5)
| ~ spl10_1
| ~ spl10_5 ),
inference(superposition,[],[f236,f147]) ).
fof(f147,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f100]) ).
fof(f100,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox/tmp/tmp.d1lmDipuM5/Vampire---4.8_16300',ax84) ).
fof(f236,plain,
( nil = app(sK5,nil)
| ~ spl10_1
| ~ spl10_5 ),
inference(backward_demodulation,[],[f234,f230]) ).
fof(f230,plain,
( nil = sK4
| ~ spl10_5 ),
inference(avatar_component_clause,[],[f228]) ).
fof(f228,plain,
( spl10_5
<=> nil = sK4 ),
introduced(avatar_definition,[new_symbols(naming,[spl10_5])]) ).
fof(f234,plain,
( nil = app(sK5,sK4)
| ~ spl10_1 ),
inference(backward_demodulation,[],[f142,f181]) ).
fof(f181,plain,
( nil = sK2
| ~ spl10_1 ),
inference(avatar_component_clause,[],[f180]) ).
fof(f180,plain,
( spl10_1
<=> nil = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl10_1])]) ).
fof(f142,plain,
sK2 = app(sK5,sK4),
inference(cnf_transformation,[],[f124]) ).
fof(f124,plain,
( ( ( nil != sK1
& nil = sK0 )
| ( nil != sK0
& nil = sK1 ) )
& sK2 = app(sK5,sK4)
& sK3 = app(sK4,sK5)
& ssList(sK5)
& ssList(sK4)
& sK0 = sK2
& sK1 = sK3
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f99,f123,f122,f121,f120,f119,f118]) ).
fof(f118,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil != X1
& nil = X0 )
| ( nil != X0
& nil = X1 ) )
& ? [X4] :
( ? [X5] :
( app(X5,X4) = X2
& app(X4,X5) = X3
& ssList(X5) )
& ssList(X4) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil != X1
& nil = sK0 )
| ( nil != sK0
& nil = X1 ) )
& ? [X4] :
( ? [X5] :
( app(X5,X4) = X2
& app(X4,X5) = X3
& ssList(X5) )
& ssList(X4) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f119,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil != X1
& nil = sK0 )
| ( nil != sK0
& nil = X1 ) )
& ? [X4] :
( ? [X5] :
( app(X5,X4) = X2
& app(X4,X5) = X3
& ssList(X5) )
& ssList(X4) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( nil != sK1
& nil = sK0 )
| ( nil != sK0
& nil = sK1 ) )
& ? [X4] :
( ? [X5] :
( app(X5,X4) = X2
& app(X4,X5) = X3
& ssList(X5) )
& ssList(X4) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f120,plain,
( ? [X2] :
( ? [X3] :
( ( ( nil != sK1
& nil = sK0 )
| ( nil != sK0
& nil = sK1 ) )
& ? [X4] :
( ? [X5] :
( app(X5,X4) = X2
& app(X4,X5) = X3
& ssList(X5) )
& ssList(X4) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( nil != sK1
& nil = sK0 )
| ( nil != sK0
& nil = sK1 ) )
& ? [X4] :
( ? [X5] :
( app(X5,X4) = sK2
& app(X4,X5) = X3
& ssList(X5) )
& ssList(X4) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f121,plain,
( ? [X3] :
( ( ( nil != sK1
& nil = sK0 )
| ( nil != sK0
& nil = sK1 ) )
& ? [X4] :
( ? [X5] :
( app(X5,X4) = sK2
& app(X4,X5) = X3
& ssList(X5) )
& ssList(X4) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( ( nil != sK1
& nil = sK0 )
| ( nil != sK0
& nil = sK1 ) )
& ? [X4] :
( ? [X5] :
( app(X5,X4) = sK2
& app(X4,X5) = sK3
& ssList(X5) )
& ssList(X4) )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f122,plain,
( ? [X4] :
( ? [X5] :
( app(X5,X4) = sK2
& app(X4,X5) = sK3
& ssList(X5) )
& ssList(X4) )
=> ( ? [X5] :
( sK2 = app(X5,sK4)
& sK3 = app(sK4,X5)
& ssList(X5) )
& ssList(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f123,plain,
( ? [X5] :
( sK2 = app(X5,sK4)
& sK3 = app(sK4,X5)
& ssList(X5) )
=> ( sK2 = app(sK5,sK4)
& sK3 = app(sK4,sK5)
& ssList(sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil != X1
& nil = X0 )
| ( nil != X0
& nil = X1 ) )
& ? [X4] :
( ? [X5] :
( app(X5,X4) = X2
& app(X4,X5) = X3
& ssList(X5) )
& ssList(X4) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil != X1
& nil = X0 )
| ( nil != X0
& nil = X1 ) )
& ? [X4] :
( ? [X5] :
( app(X5,X4) = X2
& app(X4,X5) = X3
& ssList(X5) )
& ssList(X4) )
& 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 = X1
| nil != X0 )
& ( nil = X0
| nil != X1 ) )
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(X5,X4) != X2
| app(X4,X5) != X3 ) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( nil = X1
| nil != X0 )
& ( nil = X0
| nil != X1 ) )
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(X5,X4) != X2
| app(X4,X5) != X3 ) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.d1lmDipuM5/Vampire---4.8_16300',co1) ).
fof(f245,plain,
( sK3 = app(nil,nil)
| ~ spl10_1
| ~ spl10_3
| ~ spl10_5 ),
inference(backward_demodulation,[],[f237,f243]) ).
fof(f237,plain,
( sK3 = app(nil,sK5)
| ~ spl10_5 ),
inference(backward_demodulation,[],[f141,f230]) ).
fof(f141,plain,
sK3 = app(sK4,sK5),
inference(cnf_transformation,[],[f124]) ).
fof(f233,plain,
spl10_3,
inference(avatar_split_clause,[],[f140,f220]) ).
fof(f140,plain,
ssList(sK5),
inference(cnf_transformation,[],[f124]) ).
fof(f232,plain,
spl10_4,
inference(avatar_split_clause,[],[f139,f224]) ).
fof(f224,plain,
( spl10_4
<=> ssList(sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_4])]) ).
fof(f139,plain,
ssList(sK4),
inference(cnf_transformation,[],[f124]) ).
fof(f231,plain,
( ~ spl10_3
| ~ spl10_4
| spl10_5
| ~ spl10_1 ),
inference(avatar_split_clause,[],[f200,f180,f228,f224,f220]) ).
fof(f200,plain,
( nil != sK2
| nil = sK4
| ~ ssList(sK4)
| ~ ssList(sK5) ),
inference(superposition,[],[f148,f142]) ).
fof(f148,plain,
! [X0,X1] :
( nil != app(X0,X1)
| nil = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f126]) ).
fof(f126,plain,
! [X0] :
( ! [X1] :
( ( ( nil = app(X0,X1)
| nil != X0
| nil != X1 )
& ( ( nil = X0
& nil = X1 )
| nil != app(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f125]) ).
fof(f125,plain,
! [X0] :
( ! [X1] :
( ( ( nil = app(X0,X1)
| nil != X0
| nil != X1 )
& ( ( nil = X0
& nil = X1 )
| nil != app(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f101]) ).
fof(f101,plain,
! [X0] :
( ! [X1] :
( ( nil = app(X0,X1)
<=> ( nil = X0
& nil = X1 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f83]) ).
fof(f83,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( nil = app(X0,X1)
<=> ( nil = X0
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.d1lmDipuM5/Vampire---4.8_16300',ax83) ).
fof(f218,plain,
( spl10_1
| ~ spl10_2 ),
inference(avatar_contradiction_clause,[],[f217]) ).
fof(f217,plain,
( $false
| spl10_1
| ~ spl10_2 ),
inference(subsumption_resolution,[],[f216,f182]) ).
fof(f182,plain,
( nil != sK2
| spl10_1 ),
inference(avatar_component_clause,[],[f180]) ).
fof(f216,plain,
( nil = sK2
| ~ spl10_2 ),
inference(backward_demodulation,[],[f213,f214]) ).
fof(f214,plain,
( nil = app(nil,nil)
| ~ spl10_2 ),
inference(backward_demodulation,[],[f205,f212]) ).
fof(f212,plain,
( nil = sK4
| ~ spl10_2 ),
inference(subsumption_resolution,[],[f208,f139]) ).
fof(f208,plain,
( nil = sK4
| ~ ssList(sK4)
| ~ spl10_2 ),
inference(superposition,[],[f205,f147]) ).
fof(f205,plain,
( nil = app(sK4,nil)
| ~ spl10_2 ),
inference(backward_demodulation,[],[f190,f204]) ).
fof(f204,plain,
( nil = sK5
| ~ spl10_2 ),
inference(subsumption_resolution,[],[f203,f139]) ).
fof(f203,plain,
( nil = sK5
| ~ ssList(sK4)
| ~ spl10_2 ),
inference(subsumption_resolution,[],[f201,f140]) ).
fof(f201,plain,
( nil = sK5
| ~ ssList(sK5)
| ~ ssList(sK4)
| ~ spl10_2 ),
inference(trivial_inequality_removal,[],[f199]) ).
fof(f199,plain,
( nil != nil
| nil = sK5
| ~ ssList(sK5)
| ~ ssList(sK4)
| ~ spl10_2 ),
inference(superposition,[],[f148,f190]) ).
fof(f190,plain,
( nil = app(sK4,sK5)
| ~ spl10_2 ),
inference(backward_demodulation,[],[f141,f185]) ).
fof(f185,plain,
( nil = sK3
| ~ spl10_2 ),
inference(avatar_component_clause,[],[f184]) ).
fof(f213,plain,
( sK2 = app(nil,nil)
| ~ spl10_2 ),
inference(backward_demodulation,[],[f207,f212]) ).
fof(f207,plain,
( sK2 = app(nil,sK4)
| ~ spl10_2 ),
inference(backward_demodulation,[],[f142,f204]) ).
fof(f188,plain,
( spl10_2
| spl10_1 ),
inference(avatar_split_clause,[],[f173,f180,f184]) ).
fof(f173,plain,
( nil = sK2
| nil = sK3 ),
inference(definition_unfolding,[],[f143,f138,f137]) ).
fof(f137,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f124]) ).
fof(f138,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f124]) ).
fof(f143,plain,
( nil = sK0
| nil = sK1 ),
inference(cnf_transformation,[],[f124]) ).
fof(f187,plain,
( ~ spl10_1
| ~ spl10_2 ),
inference(avatar_split_clause,[],[f170,f184,f180]) ).
fof(f170,plain,
( nil != sK3
| nil != sK2 ),
inference(definition_unfolding,[],[f146,f137,f138]) ).
fof(f146,plain,
( nil != sK1
| nil != sK0 ),
inference(cnf_transformation,[],[f124]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC030+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/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.16/0.36 % Computer : n024.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Fri May 3 20:25:38 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.16/0.37 This is a FOF_THM_RFO_SEQ problem
% 0.16/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.d1lmDipuM5/Vampire---4.8_16300
% 0.59/0.76 % (16565)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.59/0.77 % (16564)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.59/0.77 % (16558)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.59/0.77 % (16560)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.59/0.77 % (16561)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.59/0.77 % (16559)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.59/0.77 % (16563)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.59/0.77 % (16562)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.59/0.77 % (16560)First to succeed.
% 0.59/0.77 % (16563)Also succeeded, but the first one will report.
% 0.59/0.77 % (16558)Refutation not found, incomplete strategy% (16558)------------------------------
% 0.59/0.77 % (16558)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.77 % (16558)Termination reason: Refutation not found, incomplete strategy
% 0.59/0.77
% 0.59/0.77 % (16558)Memory used [KB]: 1164
% 0.59/0.77 % (16558)Time elapsed: 0.007 s
% 0.59/0.77 % (16558)Instructions burned: 9 (million)
% 0.59/0.77 % (16561)Also succeeded, but the first one will report.
% 0.59/0.77 % (16560)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-16554"
% 0.59/0.77 % (16558)------------------------------
% 0.59/0.77 % (16558)------------------------------
% 0.59/0.77 % (16560)Refutation found. Thanks to Tanya!
% 0.59/0.77 % SZS status Theorem for Vampire---4
% 0.59/0.77 % SZS output start Proof for Vampire---4
% See solution above
% 0.59/0.77 % (16560)------------------------------
% 0.59/0.77 % (16560)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.77 % (16560)Termination reason: Refutation
% 0.59/0.77
% 0.59/0.77 % (16560)Memory used [KB]: 1166
% 0.59/0.77 % (16560)Time elapsed: 0.007 s
% 0.59/0.77 % (16560)Instructions burned: 9 (million)
% 0.59/0.77 % (16554)Success in time 0.398 s
% 0.59/0.77 % Vampire---4.8 exiting
%------------------------------------------------------------------------------