TSTP Solution File: SWC048-1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC048-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 : n032.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:49 EDT 2024
% Result : Unsatisfiable 0.47s 0.64s
% Output : Refutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 18
% Syntax : Number of formulae : 50 ( 6 unt; 0 def)
% Number of atoms : 127 ( 16 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 152 ( 75 ~; 71 |; 0 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 7 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 10 ( 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f269,plain,
$false,
inference(avatar_sat_refutation,[],[f225,f230,f236,f241,f243,f252,f258,f268]) ).
fof(f268,plain,
( ~ spl0_1
| spl0_4
| ~ spl0_6 ),
inference(avatar_contradiction_clause,[],[f267]) ).
fof(f267,plain,
( $false
| ~ spl0_1
| spl0_4
| ~ spl0_6 ),
inference(subsumption_resolution,[],[f266,f254]) ).
fof(f254,plain,
( rearsegP(nil,sk3)
| ~ spl0_1
| ~ spl0_6 ),
inference(backward_demodulation,[],[f240,f216]) ).
fof(f216,plain,
( nil = sk4
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f214]) ).
fof(f214,plain,
( spl0_1
<=> nil = sk4 ),
introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).
fof(f240,plain,
( rearsegP(sk4,sk3)
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f238]) ).
fof(f238,plain,
( spl0_6
<=> rearsegP(sk4,sk3) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_6])]) ).
fof(f266,plain,
( ~ rearsegP(nil,sk3)
| spl0_4 ),
inference(subsumption_resolution,[],[f264,f229]) ).
fof(f229,plain,
( nil != sk3
| spl0_4 ),
inference(avatar_component_clause,[],[f227]) ).
fof(f227,plain,
( spl0_4
<=> nil = sk3 ),
introduced(avatar_definition,[new_symbols(naming,[spl0_4])]) ).
fof(f264,plain,
( nil = sk3
| ~ rearsegP(nil,sk3) ),
inference(resolution,[],[f82,f200]) ).
fof(f200,plain,
ssList(sk3),
inference(definition_unfolding,[],[f186,f191]) ).
fof(f191,axiom,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
fof(f186,axiom,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
fof(f82,axiom,
! [X0] :
( ~ ssList(X0)
| nil = X0
| ~ rearsegP(nil,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause82) ).
fof(f258,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(avatar_contradiction_clause,[],[f257]) ).
fof(f257,plain,
( $false
| ~ spl0_1
| ~ spl0_2 ),
inference(subsumption_resolution,[],[f256,f8]) ).
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause8) ).
fof(f256,plain,
( ~ ssList(nil)
| ~ spl0_1
| ~ spl0_2 ),
inference(resolution,[],[f212,f253]) ).
fof(f253,plain,
( neq(nil,nil)
| ~ spl0_1
| ~ spl0_2 ),
inference(backward_demodulation,[],[f220,f216]) ).
fof(f220,plain,
( neq(sk4,nil)
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f218]) ).
fof(f218,plain,
( spl0_2
<=> neq(sk4,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).
fof(f212,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f206]) ).
fof(f206,plain,
! [X1] :
( ~ ssList(X1)
| ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(equality_resolution,[],[f115]) ).
fof(f115,axiom,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| ~ neq(X0,X1)
| X0 != X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause115) ).
fof(f252,plain,
( ~ spl0_3
| ~ spl0_5
| ~ spl0_6 ),
inference(avatar_contradiction_clause,[],[f251]) ).
fof(f251,plain,
( $false
| ~ spl0_3
| ~ spl0_5
| ~ spl0_6 ),
inference(subsumption_resolution,[],[f250,f240]) ).
fof(f250,plain,
( ~ rearsegP(sk4,sk3)
| ~ spl0_3
| ~ spl0_5 ),
inference(subsumption_resolution,[],[f249,f235]) ).
fof(f235,plain,
( neq(sk3,nil)
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f233]) ).
fof(f233,plain,
( spl0_5
<=> neq(sk3,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_5])]) ).
fof(f249,plain,
( ~ neq(sk3,nil)
| ~ rearsegP(sk4,sk3)
| ~ spl0_3 ),
inference(subsumption_resolution,[],[f248,f200]) ).
fof(f248,plain,
( ~ ssList(sk3)
| ~ neq(sk3,nil)
| ~ rearsegP(sk4,sk3)
| ~ spl0_3 ),
inference(duplicate_literal_removal,[],[f247]) ).
fof(f247,plain,
( ~ ssList(sk3)
| ~ ssList(sk3)
| ~ neq(sk3,nil)
| ~ rearsegP(sk4,sk3)
| ~ spl0_3 ),
inference(resolution,[],[f59,f224]) ).
fof(f224,plain,
( ! [X6] :
( ~ rearsegP(sk3,X6)
| ~ ssList(X6)
| ~ neq(X6,nil)
| ~ rearsegP(sk4,X6) )
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f223]) ).
fof(f223,plain,
( spl0_3
<=> ! [X6] :
( ~ rearsegP(sk3,X6)
| ~ ssList(X6)
| ~ neq(X6,nil)
| ~ rearsegP(sk4,X6) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_3])]) ).
fof(f59,axiom,
! [X0] :
( rearsegP(X0,X0)
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause59) ).
fof(f243,plain,
( spl0_4
| spl0_6 ),
inference(avatar_split_clause,[],[f199,f238,f227]) ).
fof(f199,axiom,
( rearsegP(sk4,sk3)
| nil = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
fof(f241,plain,
( spl0_1
| spl0_6 ),
inference(avatar_split_clause,[],[f197,f238,f214]) ).
fof(f197,axiom,
( rearsegP(sk4,sk3)
| nil = sk4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
fof(f236,plain,
( spl0_1
| spl0_5 ),
inference(avatar_split_clause,[],[f196,f233,f214]) ).
fof(f196,axiom,
( neq(sk3,nil)
| nil = sk4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
fof(f230,plain,
( ~ spl0_4
| spl0_2 ),
inference(avatar_split_clause,[],[f204,f218,f227]) ).
fof(f204,plain,
( neq(sk4,nil)
| nil != sk3 ),
inference(definition_unfolding,[],[f194,f190,f191]) ).
fof(f190,axiom,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
fof(f194,axiom,
( neq(sk2,nil)
| nil != sk1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
fof(f225,plain,
( spl0_1
| spl0_3 ),
inference(avatar_split_clause,[],[f203,f223,f214]) ).
fof(f203,plain,
! [X6] :
( ~ rearsegP(sk3,X6)
| ~ rearsegP(sk4,X6)
| ~ neq(X6,nil)
| ~ ssList(X6)
| nil = sk4 ),
inference(definition_unfolding,[],[f193,f191,f190,f190]) ).
fof(f193,axiom,
! [X6] :
( ~ rearsegP(sk1,X6)
| ~ rearsegP(sk2,X6)
| ~ neq(X6,nil)
| ~ ssList(X6)
| nil = sk2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : SWC048-1 : TPTP v8.2.0. Released v2.4.0.
% 0.08/0.10 % 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.09/0.28 % Computer : n032.cluster.edu
% 0.09/0.28 % Model : x86_64 x86_64
% 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28 % Memory : 8042.1875MB
% 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28 % CPULimit : 300
% 0.09/0.28 % WCLimit : 300
% 0.09/0.28 % DateTime : Sun May 19 02:57:07 EDT 2024
% 0.09/0.29 % CPUTime :
% 0.09/0.29 This is a CNF_UNS_RFO_SEQ_NHN problem
% 0.09/0.29 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.64 % (31818)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.64 % (31824)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.47/0.64 % (31819)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.64 % (31817)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.47/0.64 % (31820)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.64 % (31816)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.64 % (31821)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.64 % (31823)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.47/0.64 % (31819)Also succeeded, but the first one will report.
% 0.47/0.64 % (31818)First to succeed.
% 0.47/0.64 % (31818)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-31626"
% 0.47/0.64 % (31818)Refutation found. Thanks to Tanya!
% 0.47/0.64 % SZS status Unsatisfiable for theBenchmark
% 0.47/0.64 % SZS output start Proof for theBenchmark
% See solution above
% 0.47/0.64 % (31818)------------------------------
% 0.47/0.64 % (31818)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.47/0.64 % (31818)Termination reason: Refutation
% 0.47/0.64
% 0.47/0.64 % (31818)Memory used [KB]: 1213
% 0.47/0.64 % (31818)Time elapsed: 0.004 s
% 0.47/0.64 % (31818)Instructions burned: 6 (million)
% 0.47/0.64 % (31626)Success in time 0.344 s
% 0.47/0.64 % Vampire---4.8 exiting
%------------------------------------------------------------------------------