TSTP Solution File: SWC398+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC398+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/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 : Tue May 21 04:38:42 EDT 2024
% Result : Theorem 0.76s 0.93s
% Output : Refutation 0.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of formulae : 33 ( 12 unt; 0 def)
% Number of atoms : 337 ( 107 equ)
% Maximal formula atoms : 38 ( 10 avg)
% Number of connectives : 446 ( 142 ~; 115 |; 160 &)
% ( 2 <=>; 27 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 9 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 130 ( 75 !; 55 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f273,plain,
$false,
inference(subsumption_resolution,[],[f272,f167]) ).
fof(f167,plain,
ssItem(sK4),
inference(cnf_transformation,[],[f132]) ).
fof(f132,plain,
( ( nil != sK2
| nil = sK3 )
& ~ memberP(sK1,sK4)
& memberP(sK0,sK4)
& ssItem(sK4)
& ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != sK2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != sK5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& equalelemsP(sK2)
& sK3 = app(sK2,sK5)
& ssList(sK5)
& 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])],[f100,f131,f130,f129,f128,f127,f126]) ).
fof(f126,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ~ memberP(X1,X4)
& memberP(X0,X4)
& ssItem(X4) )
& ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != X2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& equalelemsP(X2)
& app(X2,X5) = X3
& ssList(X5) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ~ memberP(X1,X4)
& memberP(sK0,X4)
& ssItem(X4) )
& ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != X2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& equalelemsP(X2)
& app(X2,X5) = X3
& ssList(X5) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f127,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ~ memberP(X1,X4)
& memberP(sK0,X4)
& ssItem(X4) )
& ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != X2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& equalelemsP(X2)
& app(X2,X5) = X3
& ssList(X5) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ~ memberP(sK1,X4)
& memberP(sK0,X4)
& ssItem(X4) )
& ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != X2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& equalelemsP(X2)
& app(X2,X5) = X3
& ssList(X5) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f128,plain,
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ~ memberP(sK1,X4)
& memberP(sK0,X4)
& ssItem(X4) )
& ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != X2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& equalelemsP(X2)
& app(X2,X5) = X3
& ssList(X5) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( nil != sK2
| nil = X3 )
& ? [X4] :
( ~ memberP(sK1,X4)
& memberP(sK0,X4)
& ssItem(X4) )
& ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != sK2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& equalelemsP(sK2)
& app(sK2,X5) = X3
& ssList(X5) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f129,plain,
( ? [X3] :
( ( nil != sK2
| nil = X3 )
& ? [X4] :
( ~ memberP(sK1,X4)
& memberP(sK0,X4)
& ssItem(X4) )
& ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != sK2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& equalelemsP(sK2)
& app(sK2,X5) = X3
& ssList(X5) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( nil != sK2
| nil = sK3 )
& ? [X4] :
( ~ memberP(sK1,X4)
& memberP(sK0,X4)
& ssItem(X4) )
& ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != sK2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& equalelemsP(sK2)
& app(sK2,X5) = sK3
& ssList(X5) )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f130,plain,
( ? [X4] :
( ~ memberP(sK1,X4)
& memberP(sK0,X4)
& ssItem(X4) )
=> ( ~ memberP(sK1,sK4)
& memberP(sK0,sK4)
& ssItem(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f131,plain,
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != sK2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& equalelemsP(sK2)
& app(sK2,X5) = sK3
& ssList(X5) )
=> ( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != sK2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != sK5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& equalelemsP(sK2)
& sK3 = app(sK2,sK5)
& ssList(sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f100,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ~ memberP(X1,X4)
& memberP(X0,X4)
& ssItem(X4) )
& ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != X2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& equalelemsP(X2)
& app(X2,X5) = X3
& ssList(X5) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f99]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ~ memberP(X1,X4)
& memberP(X0,X4)
& ssItem(X4) )
& ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != X2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& equalelemsP(X2)
& app(X2,X5) = X3
& ssList(X5) )
& 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)
=> ( ( nil = X2
& nil != X3 )
| ! [X4] :
( ssItem(X4)
=> ( memberP(X1,X4)
| ~ memberP(X0,X4) ) )
| ! [X5] :
( ssList(X5)
=> ( ? [X6] :
( ? [X7] :
( ? [X8] :
( app(X8,cons(X6,nil)) = X2
& ssList(X8) )
& app(cons(X6,nil),X7) = X5
& ssList(X7) )
& ssItem(X6) )
| ~ equalelemsP(X2)
| app(X2,X5) != X3 ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( nil = X2
& nil != X3 )
| ! [X8] :
( ssItem(X8)
=> ( memberP(X1,X8)
| ~ memberP(X0,X8) ) )
| ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( app(X7,cons(X5,nil)) = X2
& ssList(X7) )
& app(cons(X5,nil),X6) = X4
& ssList(X6) )
& ssItem(X5) )
| ~ equalelemsP(X2)
| app(X2,X4) != 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 = X2
& nil != X3 )
| ! [X8] :
( ssItem(X8)
=> ( memberP(X1,X8)
| ~ memberP(X0,X8) ) )
| ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( app(X7,cons(X5,nil)) = X2
& ssList(X7) )
& app(cons(X5,nil),X6) = X4
& ssList(X6) )
& ssItem(X5) )
| ~ equalelemsP(X2)
| app(X2,X4) != X3 ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f272,plain,
~ ssItem(sK4),
inference(subsumption_resolution,[],[f271,f215]) ).
fof(f215,plain,
memberP(sK2,sK4),
inference(definition_unfolding,[],[f168,f162]) ).
fof(f162,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f132]) ).
fof(f168,plain,
memberP(sK0,sK4),
inference(cnf_transformation,[],[f132]) ).
fof(f271,plain,
( ~ memberP(sK2,sK4)
| ~ ssItem(sK4) ),
inference(resolution,[],[f268,f214]) ).
fof(f214,plain,
~ memberP(sK3,sK4),
inference(definition_unfolding,[],[f169,f161]) ).
fof(f161,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f132]) ).
fof(f169,plain,
~ memberP(sK1,sK4),
inference(cnf_transformation,[],[f132]) ).
fof(f268,plain,
! [X0] :
( memberP(sK3,X0)
| ~ memberP(sK2,X0)
| ~ ssItem(X0) ),
inference(subsumption_resolution,[],[f267,f159]) ).
fof(f159,plain,
ssList(sK2),
inference(cnf_transformation,[],[f132]) ).
fof(f267,plain,
! [X0] :
( memberP(sK3,X0)
| ~ memberP(sK2,X0)
| ~ ssList(sK2)
| ~ ssItem(X0) ),
inference(subsumption_resolution,[],[f244,f163]) ).
fof(f163,plain,
ssList(sK5),
inference(cnf_transformation,[],[f132]) ).
fof(f244,plain,
! [X0] :
( memberP(sK3,X0)
| ~ memberP(sK2,X0)
| ~ ssList(sK5)
| ~ ssList(sK2)
| ~ ssItem(X0) ),
inference(superposition,[],[f199,f164]) ).
fof(f164,plain,
sK3 = app(sK2,sK5),
inference(cnf_transformation,[],[f132]) ).
fof(f199,plain,
! [X2,X0,X1] :
( memberP(app(X1,X2),X0)
| ~ memberP(X1,X0)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f144]) ).
fof(f144,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( ( memberP(app(X1,X2),X0)
| ( ~ memberP(X2,X0)
& ~ memberP(X1,X0) ) )
& ( memberP(X2,X0)
| memberP(X1,X0)
| ~ memberP(app(X1,X2),X0) ) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(flattening,[],[f143]) ).
fof(f143,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( ( memberP(app(X1,X2),X0)
| ( ~ memberP(X2,X0)
& ~ memberP(X1,X0) ) )
& ( memberP(X2,X0)
| memberP(X1,X0)
| ~ memberP(app(X1,X2),X0) ) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(nnf_transformation,[],[f121]) ).
fof(f121,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( memberP(app(X1,X2),X0)
<=> ( memberP(X2,X0)
| memberP(X1,X0) ) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f36]) ).
fof(f36,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( memberP(app(X1,X2),X0)
<=> ( memberP(X2,X0)
| memberP(X1,X0) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax36) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : SWC398+1 : TPTP v8.2.0. Released v2.4.0.
% 0.08/0.14 % 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.14/0.35 % Computer : n024.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:45:23 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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.74/0.93 % (23282)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2994ds/78Mi)
% 0.74/0.93 % (23280)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.74/0.93 % (23283)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.74/0.93 % (23281)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.74/0.93 % (23284)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.74/0.93 % (23285)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.74/0.93 % (23286)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.74/0.93 % (23287)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.74/0.93 % (23285)First to succeed.
% 0.76/0.93 % (23285)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-23271"
% 0.76/0.93 % (23285)Refutation found. Thanks to Tanya!
% 0.76/0.93 % SZS status Theorem for theBenchmark
% 0.76/0.93 % SZS output start Proof for theBenchmark
% See solution above
% 0.76/0.93 % (23285)------------------------------
% 0.76/0.93 % (23285)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.76/0.93 % (23285)Termination reason: Refutation
% 0.76/0.93
% 0.76/0.93 % (23285)Memory used [KB]: 1170
% 0.76/0.93 % (23285)Time elapsed: 0.006 s
% 0.76/0.93 % (23285)Instructions burned: 9 (million)
% 0.76/0.93 % (23271)Success in time 0.573 s
% 0.76/0.93 % Vampire---4.8 exiting
%------------------------------------------------------------------------------