TSTP Solution File: SWC004-1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC004-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 : n025.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:35:30 EDT 2024
% Result : Unsatisfiable 0.58s 0.76s
% Output : Refutation 0.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 25
% Syntax : Number of formulae : 67 ( 7 unt; 1 typ; 0 def)
% Number of atoms : 405 ( 11 equ)
% Maximal formula atoms : 7 ( 6 avg)
% Number of connectives : 267 ( 131 ~; 125 |; 0 &)
% ( 11 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 203 ( 203 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 26 ( 24 usr; 19 prp; 0-3 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 35 ( 34 !; 0 ?; 32 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_20,type,
sQ0_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f394,plain,
$false,
inference(avatar_sat_refutation,[],[f283,f284,f285,f286,f287,f288,f298,f299,f312,f388,f393]) ).
tff(f393,plain,
( ~ spl1_3
| ~ spl1_8
| spl1_11 ),
inference(avatar_contradiction_clause,[],[f392]) ).
tff(f392,plain,
( $false
| ~ spl1_3
| ~ spl1_8
| spl1_11 ),
inference(subsumption_resolution,[],[f391,f261]) ).
tff(f261,plain,
( ssItem(sk5)
| ~ spl1_3 ),
inference(avatar_component_clause,[],[f259]) ).
tff(f259,plain,
( spl1_3
<=> ssItem(sk5) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_3])]) ).
tff(f391,plain,
( ~ ssItem(sk5)
| ~ spl1_8
| spl1_11 ),
inference(subsumption_resolution,[],[f390,f291]) ).
tff(f291,plain,
( ssList(nil)
| ~ spl1_8 ),
inference(avatar_component_clause,[],[f290]) ).
tff(f290,plain,
( spl1_8
<=> ssList(nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_8])]) ).
tff(f390,plain,
( ~ ssList(nil)
| ~ ssItem(sk5)
| spl1_11 ),
inference(resolution,[],[f311,f86]) ).
tff(f86,axiom,
! [X0: $i,X1: $i] :
( ssList(cons(X0,X1))
| ~ ssList(X1)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause86) ).
tff(f311,plain,
( ~ ssList(cons(sk5,nil))
| spl1_11 ),
inference(avatar_component_clause,[],[f309]) ).
tff(f309,plain,
( spl1_11
<=> ssList(cons(sk5,nil)) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_11])]) ).
tff(f388,plain,
( ~ spl1_3
| ~ spl1_8
| spl1_10 ),
inference(avatar_contradiction_clause,[],[f387]) ).
tff(f387,plain,
( $false
| ~ spl1_3
| ~ spl1_8
| spl1_10 ),
inference(subsumption_resolution,[],[f386,f291]) ).
tff(f386,plain,
( ~ ssList(nil)
| ~ spl1_3
| ~ spl1_8
| spl1_10 ),
inference(subsumption_resolution,[],[f385,f261]) ).
tff(f385,plain,
( ~ ssItem(sk5)
| ~ ssList(nil)
| ~ spl1_8
| spl1_10 ),
inference(resolution,[],[f345,f307]) ).
tff(f307,plain,
( ~ neq(cons(sk5,nil),nil)
| spl1_10 ),
inference(avatar_component_clause,[],[f305]) ).
tff(f305,plain,
( spl1_10
<=> neq(cons(sk5,nil),nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_10])]) ).
tff(f345,plain,
( ! [X0: $i,X1: $i] :
( neq(cons(X0,X1),nil)
| ~ ssItem(X0)
| ~ ssList(X1) )
| ~ spl1_8 ),
inference(subsumption_resolution,[],[f344,f86]) ).
tff(f344,plain,
( ! [X0: $i,X1: $i] :
( neq(cons(X0,X1),nil)
| ~ ssList(cons(X0,X1))
| ~ ssItem(X0)
| ~ ssList(X1) )
| ~ spl1_8 ),
inference(subsumption_resolution,[],[f340,f291]) ).
tff(f340,plain,
! [X0: $i,X1: $i] :
( neq(cons(X0,X1),nil)
| ~ ssList(cons(X0,X1))
| ~ ssList(nil)
| ~ ssItem(X0)
| ~ ssList(X1) ),
inference(resolution,[],[f243,f239]) ).
tff(f239,plain,
! [X0: $i,X1: $i] :
( ~ sQ0_eqProxy($i,nil,cons(X0,X1))
| ~ ssItem(X0)
| ~ ssList(X1) ),
inference(equality_proxy_replacement,[],[f98,f221]) ).
tff(f221,plain,
! [X0: $tType,X2: X0,X1: X0] :
( sQ0_eqProxy(X0,X1,X2)
<=> ( X1 = X2 ) ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ0_eqProxy])]) ).
tff(f98,axiom,
! [X0: $i,X1: $i] :
( ~ ssList(X1)
| ~ ssItem(X0)
| ( nil != cons(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause98) ).
tff(f243,plain,
! [X0: $i,X1: $i] :
( sQ0_eqProxy($i,X0,X1)
| neq(X1,X0)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(equality_proxy_replacement,[],[f100,f221]) ).
tff(f100,axiom,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| neq(X1,X0)
| ~ ssList(X1)
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause100) ).
tff(f312,plain,
( ~ spl1_10
| ~ spl1_11
| ~ spl1_1
| ~ spl1_4
| ~ spl1_5
| ~ spl1_6
| ~ spl1_7 ),
inference(avatar_split_clause,[],[f303,f279,f274,f269,f264,f251,f309,f305]) ).
tff(f251,plain,
( spl1_1
<=> ! [X6,X7,X8] :
( ~ neq(X7,nil)
| ~ ssList(X6)
| ~ ssList(X7)
| ~ ssList(X8)
| ~ sQ0_eqProxy($i,sk4,app(app(X6,X7),X8))
| ~ sQ0_eqProxy($i,sk3,app(X6,X8)) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_1])]) ).
tff(f264,plain,
( spl1_4
<=> ssList(sk6) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_4])]) ).
tff(f269,plain,
( spl1_5
<=> ssList(sk7) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_5])]) ).
tff(f274,plain,
( spl1_6
<=> sQ0_eqProxy($i,sk4,app(app(sk6,cons(sk5,nil)),sk7)) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_6])]) ).
tff(f279,plain,
( spl1_7
<=> sQ0_eqProxy($i,sk3,app(sk6,sk7)) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_7])]) ).
tff(f303,plain,
( ~ ssList(cons(sk5,nil))
| ~ neq(cons(sk5,nil),nil)
| ~ spl1_1
| ~ spl1_4
| ~ spl1_5
| ~ spl1_6
| ~ spl1_7 ),
inference(subsumption_resolution,[],[f302,f281]) ).
tff(f281,plain,
( sQ0_eqProxy($i,sk3,app(sk6,sk7))
| ~ spl1_7 ),
inference(avatar_component_clause,[],[f279]) ).
tff(f302,plain,
( ~ ssList(cons(sk5,nil))
| ~ neq(cons(sk5,nil),nil)
| ~ sQ0_eqProxy($i,sk3,app(sk6,sk7))
| ~ spl1_1
| ~ spl1_4
| ~ spl1_5
| ~ spl1_6 ),
inference(subsumption_resolution,[],[f301,f271]) ).
tff(f271,plain,
( ssList(sk7)
| ~ spl1_5 ),
inference(avatar_component_clause,[],[f269]) ).
tff(f301,plain,
( ~ ssList(cons(sk5,nil))
| ~ ssList(sk7)
| ~ neq(cons(sk5,nil),nil)
| ~ sQ0_eqProxy($i,sk3,app(sk6,sk7))
| ~ spl1_1
| ~ spl1_4
| ~ spl1_6 ),
inference(subsumption_resolution,[],[f300,f266]) ).
tff(f266,plain,
( ssList(sk6)
| ~ spl1_4 ),
inference(avatar_component_clause,[],[f264]) ).
tff(f300,plain,
( ~ ssList(sk6)
| ~ ssList(cons(sk5,nil))
| ~ ssList(sk7)
| ~ neq(cons(sk5,nil),nil)
| ~ sQ0_eqProxy($i,sk3,app(sk6,sk7))
| ~ spl1_1
| ~ spl1_6 ),
inference(resolution,[],[f252,f276]) ).
tff(f276,plain,
( sQ0_eqProxy($i,sk4,app(app(sk6,cons(sk5,nil)),sk7))
| ~ spl1_6 ),
inference(avatar_component_clause,[],[f274]) ).
tff(f252,plain,
( ! [X8: $i,X6: $i,X7: $i] :
( ~ sQ0_eqProxy($i,sk4,app(app(X6,X7),X8))
| ~ ssList(X6)
| ~ ssList(X7)
| ~ ssList(X8)
| ~ neq(X7,nil)
| ~ sQ0_eqProxy($i,sk3,app(X6,X8)) )
| ~ spl1_1 ),
inference(avatar_component_clause,[],[f251]) ).
tff(f299,plain,
spl1_2,
inference(avatar_split_clause,[],[f249,f254]) ).
tff(f254,plain,
( spl1_2
<=> neq(sk4,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_2])]) ).
tff(f249,plain,
neq(sk4,nil),
inference(duplicate_literal_removal,[],[f208]) ).
tff(f208,plain,
( neq(sk4,nil)
| neq(sk4,nil) ),
inference(definition_unfolding,[],[f192,f190,f190]) ).
tff(f190,axiom,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
tff(f192,axiom,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
tff(f298,plain,
spl1_8,
inference(avatar_split_clause,[],[f8,f290]) ).
tff(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause8) ).
tff(f288,plain,
( spl1_7
| ~ spl1_2 ),
inference(avatar_split_clause,[],[f227,f254,f279]) ).
tff(f227,plain,
( ~ neq(sk4,nil)
| sQ0_eqProxy($i,sk3,app(sk6,sk7)) ),
inference(equality_proxy_replacement,[],[f205,f221]) ).
tff(f205,axiom,
( ~ neq(sk4,nil)
| ( sk3 = app(sk6,sk7) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_20) ).
tff(f287,plain,
( spl1_6
| ~ spl1_2 ),
inference(avatar_split_clause,[],[f226,f254,f274]) ).
tff(f226,plain,
( ~ neq(sk4,nil)
| sQ0_eqProxy($i,sk4,app(app(sk6,cons(sk5,nil)),sk7)) ),
inference(equality_proxy_replacement,[],[f204,f221]) ).
tff(f204,axiom,
( ~ neq(sk4,nil)
| ( sk4 = app(app(sk6,cons(sk5,nil)),sk7) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_19) ).
tff(f286,plain,
( spl1_5
| ~ spl1_2 ),
inference(avatar_split_clause,[],[f203,f254,f269]) ).
tff(f203,axiom,
( ~ neq(sk4,nil)
| ssList(sk7) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_18) ).
tff(f285,plain,
( spl1_4
| ~ spl1_2 ),
inference(avatar_split_clause,[],[f202,f254,f264]) ).
tff(f202,axiom,
( ~ neq(sk4,nil)
| ssList(sk6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_17) ).
tff(f284,plain,
( spl1_3
| ~ spl1_2 ),
inference(avatar_split_clause,[],[f201,f254,f259]) ).
tff(f201,axiom,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_16) ).
tff(f283,plain,
( spl1_1
| ~ spl1_2 ),
inference(avatar_split_clause,[],[f225,f254,f251]) ).
tff(f225,plain,
! [X8: $i,X6: $i,X7: $i] :
( ~ neq(sk4,nil)
| ~ neq(X7,nil)
| ~ sQ0_eqProxy($i,sk3,app(X6,X8))
| ~ sQ0_eqProxy($i,sk4,app(app(X6,X7),X8))
| ~ ssList(X8)
| ~ ssList(X7)
| ~ ssList(X6) ),
inference(equality_proxy_replacement,[],[f216,f221]) ).
tff(f216,plain,
! [X8: $i,X6: $i,X7: $i] :
( ~ neq(sk4,nil)
| ~ neq(X7,nil)
| ( sk3 != app(X6,X8) )
| ( sk4 != app(app(X6,X7),X8) )
| ~ ssList(X8)
| ~ ssList(X7)
| ~ ssList(X6) ),
inference(definition_unfolding,[],[f200,f191,f190]) ).
tff(f191,axiom,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
tff(f200,axiom,
! [X8: $i,X6: $i,X7: $i] :
( ~ neq(sk4,nil)
| ~ neq(X7,nil)
| ( sk1 != app(X6,X8) )
| ( sk2 != app(app(X6,X7),X8) )
| ~ ssList(X8)
| ~ ssList(X7)
| ~ ssList(X6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : SWC004-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.36 % Computer : n025.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sun May 19 02:49:08 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a CNF_UNS_RFO_SEQ_NHN problem
% 0.14/0.36 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.58/0.75 % (3589)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.58/0.75 % (3582)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.58/0.75 % (3584)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.58/0.75 % (3583)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.58/0.75 % (3585)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.58/0.75 % (3586)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.58/0.75 % (3588)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.58/0.75 % (3589)Refutation not found, incomplete strategy% (3589)------------------------------
% 0.58/0.75 % (3589)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.75 % (3589)Termination reason: Refutation not found, incomplete strategy
% 0.58/0.75
% 0.58/0.75 % (3589)Memory used [KB]: 1199
% 0.58/0.75 % (3589)Time elapsed: 0.003 s
% 0.58/0.75 % (3589)Instructions burned: 4 (million)
% 0.58/0.75 % (3587)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.58/0.75 % (3589)------------------------------
% 0.58/0.75 % (3589)------------------------------
% 0.58/0.75 % (3590)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on theBenchmark for (2996ds/55Mi)
% 0.58/0.75 % (3582)First to succeed.
% 0.58/0.76 % (3582)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3448"
% 0.58/0.76 % (3586)Refutation not found, incomplete strategy% (3586)------------------------------
% 0.58/0.76 % (3586)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.76 % (3586)Termination reason: Refutation not found, incomplete strategy
% 0.58/0.76
% 0.58/0.76 % (3586)Memory used [KB]: 1280
% 0.58/0.76 % (3586)Time elapsed: 0.008 s
% 0.58/0.76 % (3586)Instructions burned: 12 (million)
% 0.58/0.76 % (3582)Refutation found. Thanks to Tanya!
% 0.58/0.76 % SZS status Unsatisfiable for theBenchmark
% 0.58/0.76 % SZS output start Proof for theBenchmark
% See solution above
% 0.58/0.76 % (3582)------------------------------
% 0.58/0.76 % (3582)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.76 % (3582)Termination reason: Refutation
% 0.58/0.76
% 0.58/0.76 % (3582)Memory used [KB]: 1246
% 0.58/0.76 % (3582)Time elapsed: 0.007 s
% 0.58/0.76 % (3582)Instructions burned: 9 (million)
% 0.58/0.76 % (3448)Success in time 0.393 s
% 0.58/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------