TSTP Solution File: SWC024-1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC024-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 : n010.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:38 EDT 2024
% Result : Unsatisfiable 0.58s 0.75s
% Output : Refutation 0.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 16
% Syntax : Number of formulae : 50 ( 15 unt; 0 def)
% Number of atoms : 126 ( 18 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 158 ( 82 ~; 74 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 20 ( 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f349,plain,
$false,
inference(avatar_sat_refutation,[],[f218,f315,f342]) ).
fof(f342,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(avatar_contradiction_clause,[],[f341]) ).
fof(f341,plain,
( $false
| ~ spl0_1
| ~ spl0_2 ),
inference(subsumption_resolution,[],[f340,f330]) ).
fof(f330,plain,
( frontsegP(nil,nil)
| ~ spl0_1
| ~ spl0_2 ),
inference(forward_demodulation,[],[f326,f216]) ).
fof(f216,plain,
( nil = sk3
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f215]) ).
fof(f215,plain,
( spl0_2
<=> nil = sk3 ),
introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).
fof(f326,plain,
( frontsegP(nil,sk3)
| ~ spl0_1 ),
inference(superposition,[],[f250,f213]) ).
fof(f213,plain,
( nil = sk4
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f211]) ).
fof(f211,plain,
( spl0_1
<=> nil = sk4 ),
introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).
fof(f250,plain,
frontsegP(sk4,sk3),
inference(subsumption_resolution,[],[f249,f194]) ).
fof(f194,axiom,
ssList(sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
fof(f249,plain,
( frontsegP(sk4,sk3)
| ~ ssList(sk5) ),
inference(subsumption_resolution,[],[f248,f199]) ).
fof(f199,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(f248,plain,
( frontsegP(sk4,sk3)
| ~ ssList(sk3)
| ~ ssList(sk5) ),
inference(subsumption_resolution,[],[f228,f200]) ).
fof(f200,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(f228,plain,
( frontsegP(sk4,sk3)
| ~ ssList(sk4)
| ~ ssList(sk3)
| ~ ssList(sk5) ),
inference(superposition,[],[f204,f195]) ).
fof(f195,axiom,
sk4 = app(sk3,sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
fof(f204,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(f340,plain,
( ~ frontsegP(nil,nil)
| ~ spl0_1
| ~ spl0_2 ),
inference(forward_demodulation,[],[f339,f216]) ).
fof(f339,plain,
( ~ frontsegP(sk3,nil)
| ~ spl0_1
| ~ spl0_2 ),
inference(forward_demodulation,[],[f338,f213]) ).
fof(f338,plain,
( ~ frontsegP(sk3,sk4)
| ~ spl0_1
| ~ spl0_2 ),
inference(subsumption_resolution,[],[f337,f330]) ).
fof(f337,plain,
( ~ frontsegP(nil,nil)
| ~ frontsegP(sk3,sk4)
| ~ spl0_1 ),
inference(forward_demodulation,[],[f336,f213]) ).
fof(f336,plain,
( ~ frontsegP(sk4,sk4)
| ~ frontsegP(sk3,sk4) ),
inference(subsumption_resolution,[],[f302,f200]) ).
fof(f302,plain,
( ~ frontsegP(sk4,sk4)
| ~ frontsegP(sk3,sk4)
| ~ ssList(sk4) ),
inference(resolution,[],[f202,f201]) ).
fof(f201,plain,
neq(sk4,nil),
inference(definition_unfolding,[],[f192,f190]) ).
fof(f192,axiom,
neq(sk2,nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
fof(f202,plain,
! [X6] :
( ~ neq(X6,nil)
| ~ frontsegP(sk4,X6)
| ~ frontsegP(sk3,X6)
| ~ ssList(X6) ),
inference(definition_unfolding,[],[f193,f191,f190]) ).
fof(f193,axiom,
! [X6] :
( ~ frontsegP(sk1,X6)
| ~ frontsegP(sk2,X6)
| ~ neq(X6,nil)
| ~ ssList(X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
fof(f315,plain,
spl0_2,
inference(avatar_split_clause,[],[f312,f215]) ).
fof(f312,plain,
nil = sk3,
inference(subsumption_resolution,[],[f309,f199]) ).
fof(f309,plain,
( ~ ssList(sk3)
| nil = sk3 ),
inference(duplicate_literal_removal,[],[f307]) ).
fof(f307,plain,
( ~ ssList(sk3)
| nil = sk3
| ~ ssList(sk3) ),
inference(resolution,[],[f305,f61]) ).
fof(f61,axiom,
! [X0] :
( frontsegP(X0,X0)
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause61) ).
fof(f305,plain,
! [X0] :
( ~ frontsegP(sk3,X0)
| ~ ssList(X0)
| nil = X0 ),
inference(subsumption_resolution,[],[f304,f241]) ).
fof(f241,plain,
! [X0] :
( frontsegP(sk4,X0)
| ~ ssList(X0)
| ~ frontsegP(sk3,X0) ),
inference(subsumption_resolution,[],[f240,f194]) ).
fof(f240,plain,
! [X0] :
( frontsegP(sk4,X0)
| ~ ssList(X0)
| ~ ssList(sk5)
| ~ frontsegP(sk3,X0) ),
inference(subsumption_resolution,[],[f222,f199]) ).
fof(f222,plain,
! [X0] :
( frontsegP(sk4,X0)
| ~ ssList(sk3)
| ~ ssList(X0)
| ~ ssList(sk5)
| ~ frontsegP(sk3,X0) ),
inference(superposition,[],[f137,f195]) ).
fof(f137,axiom,
! [X2,X0,X1] :
( frontsegP(app(X0,X2),X1)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause137) ).
fof(f304,plain,
! [X0] :
( ~ frontsegP(sk4,X0)
| ~ frontsegP(sk3,X0)
| ~ ssList(X0)
| nil = X0 ),
inference(subsumption_resolution,[],[f303,f8]) ).
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause8) ).
fof(f303,plain,
! [X0] :
( ~ frontsegP(sk4,X0)
| ~ frontsegP(sk3,X0)
| ~ ssList(X0)
| nil = X0
| ~ ssList(nil) ),
inference(duplicate_literal_removal,[],[f301]) ).
fof(f301,plain,
! [X0] :
( ~ frontsegP(sk4,X0)
| ~ frontsegP(sk3,X0)
| ~ ssList(X0)
| nil = X0
| ~ ssList(X0)
| ~ ssList(nil) ),
inference(resolution,[],[f202,f100]) ).
fof(f100,axiom,
! [X0,X1] :
( neq(X1,X0)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause100) ).
fof(f218,plain,
( spl0_1
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f198,f215,f211]) ).
fof(f198,axiom,
( nil != sk3
| nil = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWC024-1 : TPTP v8.2.0. Released v2.4.0.
% 0.14/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.14/0.36 % Computer : n010.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 03:33:53 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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.58/0.74 % (28581)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 % (28574)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 % (28576)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 % (28575)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 % (28577)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 % (28579)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 % (28578)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 % (28580)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 % (28579)First to succeed.
% 0.58/0.75 % (28577)Also succeeded, but the first one will report.
% 0.58/0.75 % (28579)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-28573"
% 0.58/0.75 % (28579)Refutation found. Thanks to Tanya!
% 0.58/0.75 % SZS status Unsatisfiable for theBenchmark
% 0.58/0.75 % SZS output start Proof for theBenchmark
% See solution above
% 0.58/0.75 % (28579)------------------------------
% 0.58/0.75 % (28579)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.75 % (28579)Termination reason: Refutation
% 0.58/0.75
% 0.58/0.75 % (28579)Memory used [KB]: 1221
% 0.58/0.75 % (28579)Time elapsed: 0.007 s
% 0.58/0.75 % (28579)Instructions burned: 8 (million)
% 0.58/0.75 % (28573)Success in time 0.379 s
% 0.58/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------