TSTP Solution File: SWC094+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC094+1 : TPTP v8.2.0. 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 : 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 : Tue May 21 04:36:11 EDT 2024
% Result : Theorem 0.71s 0.88s
% Output : Refutation 0.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 8
% Syntax : Number of formulae : 32 ( 9 unt; 0 def)
% Number of atoms : 197 ( 86 equ)
% Maximal formula atoms : 24 ( 6 avg)
% Number of connectives : 264 ( 99 ~; 78 |; 73 &)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 92 ( 62 !; 30 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f197,plain,
$false,
inference(subsumption_resolution,[],[f196,f134]) ).
fof(f134,plain,
ssList(sK3),
inference(cnf_transformation,[],[f122]) ).
fof(f122,plain,
( ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != sK1
| app(app(X4,X5),X6) != sK0
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& sK2 = sK3
& sK0 = sK2
& sK1 = sK3
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f99,f121,f120,f119,f118]) ).
fof(f118,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != X1
| app(app(X4,X5),X6) != X0
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& X2 = X3
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != X1
| app(app(X4,X5),X6) != sK0
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& X2 = X3
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f119,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != X1
| app(app(X4,X5),X6) != sK0
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& X2 = X3
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != sK1
| app(app(X4,X5),X6) != sK0
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& X2 = X3
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f120,plain,
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != sK1
| app(app(X4,X5),X6) != sK0
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& X2 = X3
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != sK1
| app(app(X4,X5),X6) != sK0
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& sK2 = X3
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f121,plain,
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != sK1
| app(app(X4,X5),X6) != sK0
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& sK2 = X3
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != sK1
| app(app(X4,X5),X6) != sK0
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& sK2 = sK3
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != X1
| app(app(X4,X5),X6) != X0
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& X2 = X3
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != X1
| app(app(X4,X5),X6) != X0
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& X2 = X3
& 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)
=> ( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X1
& app(app(X4,X5),X6) = X0
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
| X2 != X3
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X1
& app(app(X4,X5),X6) = X0
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
| X2 != X3
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f196,plain,
~ ssList(sK3),
inference(equality_resolution,[],[f194]) ).
fof(f194,plain,
! [X0] :
( sK3 != X0
| ~ ssList(X0) ),
inference(subsumption_resolution,[],[f193,f150]) ).
fof(f150,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f193,plain,
! [X0] :
( sK3 != X0
| ~ ssList(X0)
| ~ ssList(nil) ),
inference(duplicate_literal_removal,[],[f186]) ).
fof(f186,plain,
! [X0] :
( sK3 != X0
| ~ ssList(X0)
| ~ ssList(nil)
| ~ ssList(X0) ),
inference(superposition,[],[f185,f147]) ).
fof(f147,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f108]) ).
fof(f108,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax28) ).
fof(f185,plain,
! [X0,X1] :
( app(X0,X1) != sK3
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(subsumption_resolution,[],[f179,f150]) ).
fof(f179,plain,
! [X0,X1] :
( app(X0,X1) != sK3
| ~ ssList(X1)
| ~ ssList(nil)
| ~ ssList(X0) ),
inference(duplicate_literal_removal,[],[f173]) ).
fof(f173,plain,
! [X0,X1] :
( app(X0,X1) != sK3
| app(X0,X1) != sK3
| ~ ssList(X1)
| ~ ssList(nil)
| ~ ssList(X0)
| ~ ssList(X0) ),
inference(superposition,[],[f163,f139]) ).
fof(f139,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/sandbox2/benchmark/theBenchmark.p',ax84) ).
fof(f163,plain,
! [X6,X4,X5] :
( app(app(X4,X5),X6) != sK3
| app(X4,X6) != sK3
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f138,f135,f162]) ).
fof(f162,plain,
sK0 = sK3,
inference(definition_unfolding,[],[f136,f137]) ).
fof(f137,plain,
sK2 = sK3,
inference(cnf_transformation,[],[f122]) ).
fof(f136,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f122]) ).
fof(f135,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f122]) ).
fof(f138,plain,
! [X6,X4,X5] :
( app(X4,X6) != sK1
| app(app(X4,X5),X6) != sK0
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f122]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC094+1 : TPTP v8.2.0. Released v2.4.0.
% 0.14/0.14 % 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.14/0.35 % Computer : n011.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 02:40:38 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.14/0.35 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/benchmark/theBenchmark.p
% 0.71/0.87 % (28826)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2994ds/45Mi)
% 0.71/0.87 % (28827)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 (2994ds/83Mi)
% 0.71/0.87 % (28824)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2994ds/33Mi)
% 0.71/0.87 % (28823)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2994ds/78Mi)
% 0.71/0.87 % (28822)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 (2994ds/51Mi)
% 0.71/0.87 % (28825)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 (2994ds/34Mi)
% 0.71/0.87 % (28821)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 (2994ds/34Mi)
% 0.71/0.87 % (28828)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 (2994ds/56Mi)
% 0.71/0.88 % (28826)First to succeed.
% 0.71/0.88 % (28826)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-28795"
% 0.71/0.88 % (28826)Refutation found. Thanks to Tanya!
% 0.71/0.88 % SZS status Theorem for theBenchmark
% 0.71/0.88 % SZS output start Proof for theBenchmark
% See solution above
% 0.71/0.88 % (28826)------------------------------
% 0.71/0.88 % (28826)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.71/0.88 % (28826)Termination reason: Refutation
% 0.71/0.88
% 0.71/0.88 % (28826)Memory used [KB]: 1159
% 0.71/0.88 % (28826)Time elapsed: 0.006 s
% 0.71/0.88 % (28826)Instructions burned: 6 (million)
% 0.71/0.88 % (28795)Success in time 0.517 s
% 0.71/0.88 % Vampire---4.8 exiting
%------------------------------------------------------------------------------