TSTP Solution File: SWC101-1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC101-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 : n002.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:36:13 EDT 2024
% Result : Unsatisfiable 0.46s 0.68s
% Output : Refutation 0.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 16
% Syntax : Number of formulae : 37 ( 12 unt; 0 def)
% Number of atoms : 78 ( 15 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 77 ( 36 ~; 37 |; 0 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 5 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 7 ( 7 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f275,plain,
$false,
inference(avatar_sat_refutation,[],[f218,f219,f228,f269,f274]) ).
fof(f274,plain,
( spl0_2
| spl0_3 ),
inference(avatar_contradiction_clause,[],[f273]) ).
fof(f273,plain,
( $false
| spl0_2
| spl0_3 ),
inference(subsumption_resolution,[],[f272,f8]) ).
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause8) ).
fof(f272,plain,
( ~ ssList(nil)
| spl0_2
| spl0_3 ),
inference(subsumption_resolution,[],[f271,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(f271,plain,
( ~ ssList(sk3)
| ~ ssList(nil)
| spl0_2
| spl0_3 ),
inference(subsumption_resolution,[],[f270,f217]) ).
fof(f217,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(f270,plain,
( nil = sk3
| ~ ssList(sk3)
| ~ ssList(nil)
| spl0_3 ),
inference(resolution,[],[f223,f100]) ).
fof(f100,axiom,
! [X0,X1] :
( neq(X1,X0)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause100) ).
fof(f223,plain,
( ~ neq(sk3,nil)
| spl0_3 ),
inference(avatar_component_clause,[],[f221]) ).
fof(f221,plain,
( spl0_3
<=> neq(sk3,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_3])]) ).
fof(f269,plain,
spl0_4,
inference(avatar_split_clause,[],[f268,f225]) ).
fof(f225,plain,
( spl0_4
<=> frontsegP(sk4,sk3) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_4])]) ).
fof(f268,plain,
frontsegP(sk4,sk3),
inference(subsumption_resolution,[],[f267,f192]) ).
fof(f192,axiom,
ssList(sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
fof(f267,plain,
( frontsegP(sk4,sk3)
| ~ ssList(sk5) ),
inference(subsumption_resolution,[],[f266,f199]) ).
fof(f266,plain,
( frontsegP(sk4,sk3)
| ~ ssList(sk3)
| ~ ssList(sk5) ),
inference(subsumption_resolution,[],[f241,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(f241,plain,
( frontsegP(sk4,sk3)
| ~ ssList(sk4)
| ~ ssList(sk3)
| ~ ssList(sk5) ),
inference(superposition,[],[f205,f193]) ).
fof(f193,axiom,
sk4 = app(sk3,sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
fof(f205,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(f228,plain,
( ~ spl0_3
| ~ spl0_4 ),
inference(avatar_split_clause,[],[f202,f225,f221]) ).
fof(f202,plain,
( ~ frontsegP(sk4,sk3)
| ~ neq(sk3,nil) ),
inference(definition_unfolding,[],[f198,f190,f191,f191]) ).
fof(f198,axiom,
( ~ frontsegP(sk2,sk1)
| ~ neq(sk1,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
fof(f219,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f201,f215,f211]) ).
fof(f211,plain,
( spl0_1
<=> nil = sk4 ),
introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).
fof(f201,plain,
( nil != sk3
| nil != sk4 ),
inference(definition_unfolding,[],[f197,f191,f190]) ).
fof(f197,axiom,
( nil != sk1
| nil != sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
fof(f218,plain,
( spl0_1
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f196,f215,f211]) ).
fof(f196,axiom,
( nil != sk3
| nil = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.10 % Problem : SWC101-1 : TPTP v8.2.0. Released v2.4.0.
% 0.10/0.12 % 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.11/0.32 % Computer : n002.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Sun May 19 03:17:23 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.11/0.32 This is a CNF_UNS_RFO_SEQ_NHN problem
% 0.11/0.32 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.46/0.67 % (30900)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.46/0.67 % (30903)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.46/0.67 % (30902)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.46/0.67 % (30904)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.46/0.67 % (30905)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.46/0.67 % (30906)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.46/0.67 % (30907)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.46/0.67 % (30905)First to succeed.
% 0.46/0.67 % (30905)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-30899"
% 0.46/0.67 % (30903)Also succeeded, but the first one will report.
% 0.46/0.67 % (30902)Also succeeded, but the first one will report.
% 0.46/0.68 % (30905)Refutation found. Thanks to Tanya!
% 0.46/0.68 % SZS status Unsatisfiable for theBenchmark
% 0.46/0.68 % SZS output start Proof for theBenchmark
% See solution above
% 0.46/0.68 % (30905)------------------------------
% 0.46/0.68 % (30905)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.46/0.68 % (30905)Termination reason: Refutation
% 0.46/0.68
% 0.46/0.68 % (30905)Memory used [KB]: 1206
% 0.46/0.68 % (30905)Time elapsed: 0.004 s
% 0.46/0.68 % (30905)Instructions burned: 5 (million)
% 0.46/0.68 % (30899)Success in time 0.351 s
% 0.46/0.68 % Vampire---4.8 exiting
%------------------------------------------------------------------------------