TSTP Solution File: SWC010-1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC010-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 : n023.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:33 EDT 2024
% Result : Unsatisfiable 0.57s 0.73s
% Output : Refutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 18
% Syntax : Number of formulae : 44 ( 5 unt; 1 typ; 0 def)
% Number of atoms : 276 ( 9 equ)
% Maximal formula atoms : 7 ( 6 avg)
% Number of connectives : 166 ( 83 ~; 75 |; 0 &)
% ( 8 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 150 ( 150 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 23 ( 21 usr; 16 prp; 0-3 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 19 ( 18 !; 0 ?; 16 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_20,type,
sQ0_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f321,plain,
$false,
inference(avatar_sat_refutation,[],[f297,f298,f299,f300,f301,f302,f314,f320]) ).
tff(f320,plain,
( ~ spl1_1
| ~ spl1_3
| ~ spl1_4
| ~ spl1_5
| ~ spl1_6
| ~ spl1_7 ),
inference(avatar_contradiction_clause,[],[f319]) ).
tff(f319,plain,
( $false
| ~ spl1_1
| ~ spl1_3
| ~ spl1_4
| ~ spl1_5
| ~ spl1_6
| ~ spl1_7 ),
inference(subsumption_resolution,[],[f318,f291]) ).
tff(f291,plain,
( sQ0_eqProxy($i,sk3,app(sk6,sk7))
| ~ spl1_7 ),
inference(avatar_component_clause,[],[f289]) ).
tff(f289,plain,
( spl1_7
<=> sQ0_eqProxy($i,sk3,app(sk6,sk7)) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_7])]) ).
tff(f318,plain,
( ~ sQ0_eqProxy($i,sk3,app(sk6,sk7))
| ~ spl1_1
| ~ spl1_3
| ~ spl1_4
| ~ spl1_5
| ~ spl1_6 ),
inference(subsumption_resolution,[],[f317,f281]) ).
tff(f281,plain,
( ssList(sk7)
| ~ spl1_5 ),
inference(avatar_component_clause,[],[f279]) ).
tff(f279,plain,
( spl1_5
<=> ssList(sk7) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_5])]) ).
tff(f317,plain,
( ~ ssList(sk7)
| ~ sQ0_eqProxy($i,sk3,app(sk6,sk7))
| ~ spl1_1
| ~ spl1_3
| ~ spl1_4
| ~ spl1_6 ),
inference(subsumption_resolution,[],[f316,f276]) ).
tff(f276,plain,
( ssList(sk6)
| ~ spl1_4 ),
inference(avatar_component_clause,[],[f274]) ).
tff(f274,plain,
( spl1_4
<=> ssList(sk6) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_4])]) ).
tff(f316,plain,
( ~ ssList(sk6)
| ~ ssList(sk7)
| ~ sQ0_eqProxy($i,sk3,app(sk6,sk7))
| ~ spl1_1
| ~ spl1_3
| ~ spl1_6 ),
inference(subsumption_resolution,[],[f315,f271]) ).
tff(f271,plain,
( ssItem(sk5)
| ~ spl1_3 ),
inference(avatar_component_clause,[],[f269]) ).
tff(f269,plain,
( spl1_3
<=> ssItem(sk5) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_3])]) ).
tff(f315,plain,
( ~ ssItem(sk5)
| ~ ssList(sk6)
| ~ ssList(sk7)
| ~ sQ0_eqProxy($i,sk3,app(sk6,sk7))
| ~ spl1_1
| ~ spl1_6 ),
inference(resolution,[],[f262,f286]) ).
tff(f286,plain,
( sQ0_eqProxy($i,sk4,app(app(sk6,cons(sk5,nil)),sk7))
| ~ spl1_6 ),
inference(avatar_component_clause,[],[f284]) ).
tff(f284,plain,
( spl1_6
<=> sQ0_eqProxy($i,sk4,app(app(sk6,cons(sk5,nil)),sk7)) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_6])]) ).
tff(f262,plain,
( ! [X8: $i,X6: $i,X7: $i] :
( ~ sQ0_eqProxy($i,sk4,app(app(X7,cons(X6,nil)),X8))
| ~ ssItem(X6)
| ~ ssList(X7)
| ~ ssList(X8)
| ~ sQ0_eqProxy($i,sk3,app(X7,X8)) )
| ~ spl1_1 ),
inference(avatar_component_clause,[],[f261]) ).
tff(f261,plain,
( spl1_1
<=> ! [X6,X8,X7] :
( ~ sQ0_eqProxy($i,sk3,app(X7,X8))
| ~ ssItem(X6)
| ~ ssList(X7)
| ~ ssList(X8)
| ~ sQ0_eqProxy($i,sk4,app(app(X7,cons(X6,nil)),X8)) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_1])]) ).
tff(f314,plain,
spl1_2,
inference(avatar_split_clause,[],[f259,f264]) ).
tff(f264,plain,
( spl1_2
<=> neq(sk4,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_2])]) ).
tff(f259,plain,
neq(sk4,nil),
inference(duplicate_literal_removal,[],[f210]) ).
tff(f210,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(f302,plain,
( spl1_7
| ~ spl1_2 ),
inference(avatar_split_clause,[],[f233,f264,f289]) ).
tff(f233,plain,
( ~ neq(sk4,nil)
| sQ0_eqProxy($i,sk3,app(sk6,sk7)) ),
inference(equality_proxy_replacement,[],[f206,f226]) ).
tff(f226,plain,
! [X0: $tType,X2: X0,X1: X0] :
( sQ0_eqProxy(X0,X1,X2)
<=> ( X1 = X2 ) ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ0_eqProxy])]) ).
tff(f206,axiom,
( ~ neq(sk4,nil)
| ( sk3 = app(sk6,sk7) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_21) ).
tff(f301,plain,
( spl1_6
| ~ spl1_2 ),
inference(avatar_split_clause,[],[f232,f264,f284]) ).
tff(f232,plain,
( ~ neq(sk4,nil)
| sQ0_eqProxy($i,sk4,app(app(sk6,cons(sk5,nil)),sk7)) ),
inference(equality_proxy_replacement,[],[f205,f226]) ).
tff(f205,axiom,
( ~ neq(sk4,nil)
| ( sk4 = app(app(sk6,cons(sk5,nil)),sk7) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_20) ).
tff(f300,plain,
( spl1_5
| ~ spl1_2 ),
inference(avatar_split_clause,[],[f204,f264,f279]) ).
tff(f204,axiom,
( ~ neq(sk4,nil)
| ssList(sk7) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_19) ).
tff(f299,plain,
( spl1_4
| ~ spl1_2 ),
inference(avatar_split_clause,[],[f203,f264,f274]) ).
tff(f203,axiom,
( ~ neq(sk4,nil)
| ssList(sk6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_18) ).
tff(f298,plain,
( spl1_3
| ~ spl1_2 ),
inference(avatar_split_clause,[],[f202,f264,f269]) ).
tff(f202,axiom,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_17) ).
tff(f297,plain,
( spl1_1
| ~ spl1_2 ),
inference(avatar_split_clause,[],[f231,f264,f261]) ).
tff(f231,plain,
! [X8: $i,X6: $i,X7: $i] :
( ~ neq(sk4,nil)
| ~ sQ0_eqProxy($i,sk3,app(X7,X8))
| ~ sQ0_eqProxy($i,sk4,app(app(X7,cons(X6,nil)),X8))
| ~ ssList(X8)
| ~ ssList(X7)
| ~ ssItem(X6) ),
inference(equality_proxy_replacement,[],[f219,f226]) ).
tff(f219,plain,
! [X8: $i,X6: $i,X7: $i] :
( ~ neq(sk4,nil)
| ( sk3 != app(X7,X8) )
| ( sk4 != app(app(X7,cons(X6,nil)),X8) )
| ~ ssList(X8)
| ~ ssList(X7)
| ~ ssItem(X6) ),
inference(definition_unfolding,[],[f201,f191,f190]) ).
tff(f191,axiom,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
tff(f201,axiom,
! [X8: $i,X6: $i,X7: $i] :
( ~ neq(sk4,nil)
| ( sk1 != app(X7,X8) )
| ( sk2 != app(app(X7,cons(X6,nil)),X8) )
| ~ ssList(X8)
| ~ ssList(X7)
| ~ ssItem(X6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_16) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC010-1 : TPTP v8.2.0. Released v2.4.0.
% 0.11/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.34 % Computer : n023.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun May 19 03:10:38 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.14/0.34 This is a CNF_UNS_RFO_SEQ_NHN 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.47/0.73 % (26242)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.73 % (26237)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.73 % (26239)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.73 % (26240)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.73 % (26241)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.73 % (26238)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.57/0.73 % (26237)First to succeed.
% 0.57/0.73 % (26239)Also succeeded, but the first one will report.
% 0.57/0.73 % (26237)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-26236"
% 0.57/0.73 % (26244)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.57/0.73 % (26242)Also succeeded, but the first one will report.
% 0.57/0.73 % (26237)Refutation found. Thanks to Tanya!
% 0.57/0.73 % SZS status Unsatisfiable for theBenchmark
% 0.57/0.73 % SZS output start Proof for theBenchmark
% See solution above
% 0.57/0.73 % (26237)------------------------------
% 0.57/0.73 % (26237)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.73 % (26237)Termination reason: Refutation
% 0.57/0.73
% 0.57/0.73 % (26237)Memory used [KB]: 1200
% 0.57/0.73 % (26237)Time elapsed: 0.005 s
% 0.57/0.73 % (26237)Instructions burned: 6 (million)
% 0.57/0.73 % (26236)Success in time 0.377 s
% 0.57/0.73 % Vampire---4.8 exiting
%------------------------------------------------------------------------------