TSTP Solution File: SWC018-1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC018-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 : n020.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:35 EDT 2024
% Result : Unsatisfiable 0.57s 0.73s
% Output : Refutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 25
% Syntax : Number of formulae : 73 ( 13 unt; 0 def)
% Number of atoms : 195 ( 29 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 243 ( 121 ~; 114 |; 0 &)
% ( 8 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 9 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 21 ( 21 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f358,plain,
$false,
inference(avatar_sat_refutation,[],[f227,f236,f237,f238,f248,f254,f296,f303,f334,f335,f357]) ).
fof(f357,plain,
( ~ spl0_1
| ~ spl0_2
| ~ spl0_3
| ~ spl0_4
| ~ spl0_7 ),
inference(avatar_contradiction_clause,[],[f356]) ).
fof(f356,plain,
( $false
| ~ spl0_1
| ~ spl0_2
| ~ spl0_3
| ~ spl0_4
| ~ spl0_7 ),
inference(subsumption_resolution,[],[f351,f253]) ).
fof(f253,plain,
( frontsegP(nil,nil)
| ~ spl0_7 ),
inference(avatar_component_clause,[],[f251]) ).
fof(f251,plain,
( spl0_7
<=> frontsegP(nil,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_7])]) ).
fof(f351,plain,
( ~ frontsegP(nil,nil)
| ~ spl0_1
| ~ spl0_2
| ~ spl0_3
| ~ spl0_4 ),
inference(backward_demodulation,[],[f341,f222]) ).
fof(f222,plain,
( nil = sk4
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f220]) ).
fof(f220,plain,
( spl0_1
<=> nil = sk4 ),
introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).
fof(f341,plain,
( ~ frontsegP(nil,sk4)
| ~ spl0_2
| ~ spl0_3
| ~ spl0_4 ),
inference(backward_demodulation,[],[f259,f225]) ).
fof(f225,plain,
( nil = sk3
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f224]) ).
fof(f224,plain,
( spl0_2
<=> nil = sk3 ),
introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).
fof(f259,plain,
( ~ frontsegP(sk3,sk4)
| ~ spl0_3
| ~ spl0_4 ),
inference(subsumption_resolution,[],[f258,f231]) ).
fof(f231,plain,
( neq(sk4,nil)
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f229]) ).
fof(f229,plain,
( spl0_3
<=> neq(sk4,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_3])]) ).
fof(f258,plain,
( ~ neq(sk4,nil)
| ~ frontsegP(sk3,sk4)
| ~ spl0_4 ),
inference(subsumption_resolution,[],[f257,f202]) ).
fof(f202,plain,
ssList(sk4),
inference(definition_unfolding,[],[f187,f190]) ).
fof(f190,axiom,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
fof(f187,axiom,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
fof(f257,plain,
( ~ ssList(sk4)
| ~ neq(sk4,nil)
| ~ frontsegP(sk3,sk4)
| ~ spl0_4 ),
inference(duplicate_literal_removal,[],[f256]) ).
fof(f256,plain,
( ~ ssList(sk4)
| ~ ssList(sk4)
| ~ neq(sk4,nil)
| ~ frontsegP(sk3,sk4)
| ~ spl0_4 ),
inference(resolution,[],[f61,f235]) ).
fof(f235,plain,
( ! [X6] :
( ~ frontsegP(sk4,X6)
| ~ ssList(X6)
| ~ neq(X6,nil)
| ~ frontsegP(sk3,X6) )
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f234]) ).
fof(f234,plain,
( spl0_4
<=> ! [X6] :
( ~ frontsegP(sk3,X6)
| ~ ssList(X6)
| ~ neq(X6,nil)
| ~ frontsegP(sk4,X6) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_4])]) ).
fof(f61,axiom,
! [X0] :
( frontsegP(X0,X0)
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause61) ).
fof(f335,plain,
( spl0_2
| ~ spl0_1 ),
inference(avatar_split_clause,[],[f312,f220,f224]) ).
fof(f312,plain,
( nil != sk4
| nil = sk3 ),
inference(subsumption_resolution,[],[f311,f192]) ).
fof(f192,axiom,
ssList(sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
fof(f311,plain,
( nil != sk4
| ~ ssList(sk5)
| nil = sk3 ),
inference(subsumption_resolution,[],[f306,f201]) ).
fof(f201,plain,
ssList(sk3),
inference(definition_unfolding,[],[f186,f191]) ).
fof(f191,axiom,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
fof(f186,axiom,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
fof(f306,plain,
( nil != sk4
| ~ ssList(sk3)
| ~ ssList(sk5)
| nil = sk3 ),
inference(superposition,[],[f118,f193]) ).
fof(f193,axiom,
sk4 = app(sk3,sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
fof(f118,axiom,
! [X0,X1] :
( nil != app(X0,X1)
| ~ ssList(X0)
| ~ ssList(X1)
| nil = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause118) ).
fof(f334,plain,
( spl0_2
| ~ spl0_5
| spl0_9 ),
inference(avatar_split_clause,[],[f333,f293,f240,f224]) ).
fof(f240,plain,
( spl0_5
<=> ssList(nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_5])]) ).
fof(f293,plain,
( spl0_9
<=> neq(sk3,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_9])]) ).
fof(f333,plain,
( nil = sk3
| ~ spl0_5
| spl0_9 ),
inference(subsumption_resolution,[],[f332,f241]) ).
fof(f241,plain,
( ssList(nil)
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f240]) ).
fof(f332,plain,
( nil = sk3
| ~ ssList(nil)
| spl0_9 ),
inference(subsumption_resolution,[],[f320,f201]) ).
fof(f320,plain,
( nil = sk3
| ~ ssList(sk3)
| ~ ssList(nil)
| spl0_9 ),
inference(resolution,[],[f295,f100]) ).
fof(f100,axiom,
! [X0,X1] :
( neq(X1,X0)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause100) ).
fof(f295,plain,
( ~ neq(sk3,nil)
| spl0_9 ),
inference(avatar_component_clause,[],[f293]) ).
fof(f303,plain,
spl0_8,
inference(avatar_contradiction_clause,[],[f302]) ).
fof(f302,plain,
( $false
| spl0_8 ),
inference(subsumption_resolution,[],[f301,f201]) ).
fof(f301,plain,
( ~ ssList(sk3)
| spl0_8 ),
inference(resolution,[],[f291,f61]) ).
fof(f291,plain,
( ~ frontsegP(sk3,sk3)
| spl0_8 ),
inference(avatar_component_clause,[],[f289]) ).
fof(f289,plain,
( spl0_8
<=> frontsegP(sk3,sk3) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_8])]) ).
fof(f296,plain,
( ~ spl0_8
| ~ spl0_9
| ~ spl0_4 ),
inference(avatar_split_clause,[],[f287,f234,f293,f289]) ).
fof(f287,plain,
( ~ neq(sk3,nil)
| ~ frontsegP(sk3,sk3)
| ~ spl0_4 ),
inference(subsumption_resolution,[],[f286,f201]) ).
fof(f286,plain,
( ~ ssList(sk3)
| ~ neq(sk3,nil)
| ~ frontsegP(sk3,sk3)
| ~ spl0_4 ),
inference(resolution,[],[f285,f235]) ).
fof(f285,plain,
frontsegP(sk4,sk3),
inference(subsumption_resolution,[],[f284,f192]) ).
fof(f284,plain,
( frontsegP(sk4,sk3)
| ~ ssList(sk5) ),
inference(subsumption_resolution,[],[f277,f201]) ).
fof(f277,plain,
( frontsegP(sk4,sk3)
| ~ ssList(sk3)
| ~ ssList(sk5) ),
inference(superposition,[],[f249,f193]) ).
fof(f249,plain,
! [X0,X1] :
( frontsegP(app(X0,X1),X0)
| ~ ssList(X0)
| ~ ssList(X1) ),
inference(subsumption_resolution,[],[f213,f85]) ).
fof(f85,axiom,
! [X0,X1] :
( ssList(app(X1,X0))
| ~ ssList(X1)
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause85) ).
fof(f213,plain,
! [X0,X1] :
( frontsegP(app(X0,X1),X0)
| ~ ssList(app(X0,X1))
| ~ ssList(X0)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f144]) ).
fof(f144,axiom,
! [X2,X0,X1] :
( frontsegP(X2,X0)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ ssList(X1)
| app(X0,X1) != X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause144) ).
fof(f254,plain,
( ~ spl0_5
| spl0_7 ),
inference(avatar_split_clause,[],[f214,f251,f240]) ).
fof(f214,plain,
( frontsegP(nil,nil)
| ~ ssList(nil) ),
inference(equality_resolution,[],[f83]) ).
fof(f83,axiom,
! [X0] :
( frontsegP(nil,X0)
| ~ ssList(X0)
| nil != X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause83) ).
fof(f248,plain,
spl0_5,
inference(avatar_split_clause,[],[f8,f240]) ).
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause8) ).
fof(f238,plain,
( ~ spl0_2
| spl0_4 ),
inference(avatar_split_clause,[],[f206,f234,f224]) ).
fof(f206,plain,
! [X6] :
( ~ frontsegP(sk3,X6)
| ~ frontsegP(sk4,X6)
| ~ neq(X6,nil)
| ~ ssList(X6)
| nil != sk3 ),
inference(definition_unfolding,[],[f200,f191,f190,f191]) ).
fof(f200,axiom,
! [X6] :
( ~ frontsegP(sk1,X6)
| ~ frontsegP(sk2,X6)
| ~ neq(X6,nil)
| ~ ssList(X6)
| nil != sk1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).
fof(f237,plain,
( ~ spl0_2
| spl0_3 ),
inference(avatar_split_clause,[],[f205,f229,f224]) ).
fof(f205,plain,
( neq(sk4,nil)
| nil != sk3 ),
inference(definition_unfolding,[],[f199,f190,f191]) ).
fof(f199,axiom,
( neq(sk2,nil)
| nil != sk1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
fof(f236,plain,
( spl0_1
| spl0_4 ),
inference(avatar_split_clause,[],[f204,f234,f220]) ).
fof(f204,plain,
! [X6] :
( ~ frontsegP(sk3,X6)
| ~ frontsegP(sk4,X6)
| ~ neq(X6,nil)
| ~ ssList(X6)
| nil = sk4 ),
inference(definition_unfolding,[],[f198,f191,f190,f190]) ).
fof(f198,axiom,
! [X6] :
( ~ frontsegP(sk1,X6)
| ~ frontsegP(sk2,X6)
| ~ neq(X6,nil)
| ~ ssList(X6)
| nil = sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
fof(f227,plain,
( spl0_1
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f196,f224,f220]) ).
fof(f196,axiom,
( nil != sk3
| nil = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC018-1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/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.13/0.35 % Computer : n020.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 02:36:08 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a CNF_UNS_RFO_SEQ_NHN problem
% 0.13/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.55/0.72 % (21950)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.55/0.73 % (21943)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.55/0.73 % (21945)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.55/0.73 % (21944)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.55/0.73 % (21946)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.57/0.73 % (21947)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.57/0.73 % (21945)First to succeed.
% 0.57/0.73 % (21946)Also succeeded, but the first one will report.
% 0.57/0.73 % (21945)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-21942"
% 0.57/0.73 % (21945)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 % (21945)------------------------------
% 0.57/0.73 % (21945)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.73 % (21945)Termination reason: Refutation
% 0.57/0.73
% 0.57/0.73 % (21945)Memory used [KB]: 1227
% 0.57/0.73 % (21945)Time elapsed: 0.008 s
% 0.57/0.73 % (21945)Instructions burned: 10 (million)
% 0.57/0.73 % (21942)Success in time 0.379 s
% 0.57/0.73 % Vampire---4.8 exiting
%------------------------------------------------------------------------------