TSTP Solution File: SWC279-1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC279-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 : n032.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:37:43 EDT 2024
% Result : Unsatisfiable 0.47s 0.64s
% Output : Refutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 16
% Syntax : Number of formulae : 42 ( 8 unt; 0 def)
% Number of atoms : 119 ( 7 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 149 ( 72 ~; 73 |; 0 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 5 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 18 ( 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f252,plain,
$false,
inference(avatar_sat_refutation,[],[f220,f225,f230,f231,f247,f251]) ).
fof(f251,plain,
( ~ spl0_1
| spl0_4 ),
inference(avatar_contradiction_clause,[],[f250]) ).
fof(f250,plain,
( $false
| ~ spl0_1
| spl0_4 ),
inference(subsumption_resolution,[],[f249,f229]) ).
fof(f229,plain,
( ~ leq(sk8,sk5)
| spl0_4 ),
inference(avatar_component_clause,[],[f227]) ).
fof(f227,plain,
( spl0_4
<=> leq(sk8,sk5) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_4])]) ).
fof(f249,plain,
( leq(sk8,sk5)
| ~ spl0_1 ),
inference(subsumption_resolution,[],[f248,f198]) ).
fof(f198,axiom,
ssItem(sk8),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
fof(f248,plain,
( ~ ssItem(sk8)
| leq(sk8,sk5)
| ~ spl0_1 ),
inference(resolution,[],[f242,f215]) ).
fof(f215,plain,
( memberP(sk6,sk8)
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f213]) ).
fof(f213,plain,
( spl0_1
<=> memberP(sk6,sk8) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).
fof(f242,plain,
! [X0] :
( ~ memberP(sk6,X0)
| ~ ssItem(X0)
| leq(X0,sk5) ),
inference(subsumption_resolution,[],[f241,f194]) ).
fof(f194,axiom,
ssItem(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
fof(f241,plain,
! [X0] :
( leq(X0,sk5)
| ~ ssItem(X0)
| ~ memberP(sk6,X0)
| ~ ssItem(sk5) ),
inference(subsumption_resolution,[],[f240,f195]) ).
fof(f195,axiom,
ssList(sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
fof(f240,plain,
! [X0] :
( leq(X0,sk5)
| ~ ssItem(X0)
| ~ memberP(sk6,X0)
| ~ ssList(sk6)
| ~ ssItem(sk5) ),
inference(subsumption_resolution,[],[f239,f196]) ).
fof(f196,axiom,
ssList(sk7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
fof(f239,plain,
! [X0] :
( leq(X0,sk5)
| ~ ssItem(X0)
| ~ memberP(sk6,X0)
| ~ ssList(sk7)
| ~ ssList(sk6)
| ~ ssItem(sk5) ),
inference(trivial_inequality_removal,[],[f238]) ).
fof(f238,plain,
! [X0] :
( sk3 != sk3
| leq(X0,sk5)
| ~ ssItem(X0)
| ~ memberP(sk6,X0)
| ~ ssList(sk7)
| ~ ssList(sk6)
| ~ ssItem(sk5) ),
inference(superposition,[],[f193,f205]) ).
fof(f205,plain,
sk3 = app(app(sk6,cons(sk5,nil)),sk7),
inference(definition_unfolding,[],[f197,f191]) ).
fof(f191,axiom,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
fof(f197,axiom,
sk1 = app(app(sk6,cons(sk5,nil)),sk7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
fof(f193,axiom,
! [X8,X6,X9,X7] :
( sk3 != app(app(X7,cons(X6,nil)),X8)
| leq(X9,X6)
| ~ ssItem(X9)
| ~ memberP(X7,X9)
| ~ ssList(X8)
| ~ ssList(X7)
| ~ ssItem(X6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
fof(f247,plain,
( spl0_3
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f244,f217,f222]) ).
fof(f222,plain,
( spl0_3
<=> leq(sk5,sk8) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_3])]) ).
fof(f217,plain,
( spl0_2
<=> memberP(sk7,sk8) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).
fof(f244,plain,
( leq(sk5,sk8)
| ~ spl0_2 ),
inference(subsumption_resolution,[],[f243,f198]) ).
fof(f243,plain,
( ~ ssItem(sk8)
| leq(sk5,sk8)
| ~ spl0_2 ),
inference(resolution,[],[f237,f219]) ).
fof(f219,plain,
( memberP(sk7,sk8)
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f217]) ).
fof(f237,plain,
! [X0] :
( ~ memberP(sk7,X0)
| ~ ssItem(X0)
| leq(sk5,X0) ),
inference(subsumption_resolution,[],[f236,f194]) ).
fof(f236,plain,
! [X0] :
( leq(sk5,X0)
| ~ ssItem(X0)
| ~ memberP(sk7,X0)
| ~ ssItem(sk5) ),
inference(subsumption_resolution,[],[f235,f195]) ).
fof(f235,plain,
! [X0] :
( leq(sk5,X0)
| ~ ssItem(X0)
| ~ memberP(sk7,X0)
| ~ ssList(sk6)
| ~ ssItem(sk5) ),
inference(subsumption_resolution,[],[f234,f196]) ).
fof(f234,plain,
! [X0] :
( leq(sk5,X0)
| ~ ssItem(X0)
| ~ memberP(sk7,X0)
| ~ ssList(sk7)
| ~ ssList(sk6)
| ~ ssItem(sk5) ),
inference(trivial_inequality_removal,[],[f233]) ).
fof(f233,plain,
! [X0] :
( sk3 != sk3
| leq(sk5,X0)
| ~ ssItem(X0)
| ~ memberP(sk7,X0)
| ~ ssList(sk7)
| ~ ssList(sk6)
| ~ ssItem(sk5) ),
inference(superposition,[],[f192,f205]) ).
fof(f192,axiom,
! [X8,X6,X9,X7] :
( sk3 != app(app(X7,cons(X6,nil)),X8)
| leq(X6,X9)
| ~ ssItem(X9)
| ~ memberP(X8,X9)
| ~ ssList(X8)
| ~ ssList(X7)
| ~ ssItem(X6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
fof(f231,plain,
( ~ spl0_4
| ~ spl0_3 ),
inference(avatar_split_clause,[],[f202,f222,f227]) ).
fof(f202,axiom,
( ~ leq(sk5,sk8)
| ~ leq(sk8,sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_17) ).
fof(f230,plain,
( ~ spl0_4
| spl0_2 ),
inference(avatar_split_clause,[],[f201,f217,f227]) ).
fof(f201,axiom,
( memberP(sk7,sk8)
| ~ leq(sk8,sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_16) ).
fof(f225,plain,
( spl0_1
| ~ spl0_3 ),
inference(avatar_split_clause,[],[f200,f222,f213]) ).
fof(f200,axiom,
( ~ leq(sk5,sk8)
| memberP(sk6,sk8) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).
fof(f220,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f199,f217,f213]) ).
fof(f199,axiom,
( memberP(sk7,sk8)
| memberP(sk6,sk8) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.09 % Problem : SWC279-1 : TPTP v8.2.0. Released v2.4.0.
% 0.03/0.11 % 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.11/0.30 % Computer : n032.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 300
% 0.11/0.30 % DateTime : Sun May 19 03:31:07 EDT 2024
% 0.11/0.30 % CPUTime :
% 0.11/0.30 This is a CNF_UNS_RFO_SEQ_NHN problem
% 0.11/0.30 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.47/0.64 % (15701)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.47/0.64 % (15703)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 (2996ds/34Mi)
% 0.47/0.64 % (15702)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.47/0.64 % (15705)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 (2996ds/83Mi)
% 0.47/0.64 % (15706)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 (2996ds/56Mi)
% 0.47/0.64 % (15704)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.47/0.64 % (15699)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 (2996ds/34Mi)
% 0.47/0.64 % (15700)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 (2996ds/51Mi)
% 0.47/0.64 % (15701)First to succeed.
% 0.47/0.64 % (15706)Also succeeded, but the first one will report.
% 0.47/0.64 % (15701)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-15698"
% 0.47/0.64 % (15701)Refutation found. Thanks to Tanya!
% 0.47/0.64 % SZS status Unsatisfiable for theBenchmark
% 0.47/0.64 % SZS output start Proof for theBenchmark
% See solution above
% 0.47/0.64 % (15701)------------------------------
% 0.47/0.64 % (15701)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.47/0.64 % (15701)Termination reason: Refutation
% 0.47/0.64
% 0.47/0.64 % (15701)Memory used [KB]: 1205
% 0.47/0.64 % (15701)Time elapsed: 0.003 s
% 0.47/0.64 % (15701)Instructions burned: 6 (million)
% 0.47/0.64 % (15698)Success in time 0.336 s
% 0.47/0.64 % Vampire---4.8 exiting
%------------------------------------------------------------------------------