TSTP Solution File: SWC358-1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC358-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 : n009.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:38:26 EDT 2024
% Result : Unsatisfiable 0.62s 0.81s
% Output : Refutation 0.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of formulae : 20 ( 11 unt; 0 def)
% Number of atoms : 32 ( 7 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 29 ( 17 ~; 11 |; 0 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 2 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 4 ( 4 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f243,plain,
$false,
inference(avatar_sat_refutation,[],[f219,f242]) ).
fof(f242,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f241]) ).
fof(f241,plain,
( $false
| ~ spl0_1 ),
inference(subsumption_resolution,[],[f240,f8]) ).
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause8) ).
fof(f240,plain,
( ~ ssList(nil)
| ~ spl0_1 ),
inference(resolution,[],[f234,f207]) ).
fof(f207,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f202]) ).
fof(f202,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(f234,plain,
( neq(nil,nil)
| ~ spl0_1 ),
inference(superposition,[],[f200,f212]) ).
fof(f212,plain,
( nil = sk4
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f210]) ).
fof(f210,plain,
( spl0_1
<=> nil = sk4 ),
introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).
fof(f200,plain,
neq(sk4,nil),
inference(definition_unfolding,[],[f192,f190]) ).
fof(f190,axiom,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
fof(f192,axiom,
neq(sk2,nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
fof(f219,plain,
spl0_1,
inference(avatar_split_clause,[],[f218,f210]) ).
fof(f218,plain,
nil = sk4,
inference(subsumption_resolution,[],[f195,f201]) ).
fof(f201,plain,
~ segmentP(sk4,sk3),
inference(definition_unfolding,[],[f193,f190,f191]) ).
fof(f191,axiom,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
fof(f193,axiom,
~ segmentP(sk2,sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
fof(f195,axiom,
( segmentP(sk4,sk3)
| nil = sk4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC358-1 : TPTP v8.2.0. Released v2.4.0.
% 0.11/0.13 % 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.13/0.34 % Computer : n009.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 02:52:22 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.34 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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.62/0.81 % (6229)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2995ds/45Mi)
% 0.62/0.81 % (6224)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 (2995ds/34Mi)
% 0.62/0.81 % (6225)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 (2995ds/51Mi)
% 0.62/0.81 % (6228)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 (2995ds/34Mi)
% 0.62/0.81 % (6231)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 (2995ds/56Mi)
% 0.62/0.81 % (6230)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 (2995ds/83Mi)
% 0.62/0.81 % (6229)First to succeed.
% 0.62/0.81 % (6229)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-6223"
% 0.62/0.81 % (6229)Refutation found. Thanks to Tanya!
% 0.62/0.81 % SZS status Unsatisfiable for theBenchmark
% 0.62/0.81 % SZS output start Proof for theBenchmark
% See solution above
% 0.62/0.81 % (6229)------------------------------
% 0.62/0.81 % (6229)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.62/0.81 % (6229)Termination reason: Refutation
% 0.62/0.81
% 0.62/0.81 % (6229)Memory used [KB]: 1191
% 0.62/0.81 % (6229)Time elapsed: 0.003 s
% 0.62/0.81 % (6229)Instructions burned: 4 (million)
% 0.62/0.81 % (6223)Success in time 0.451 s
% 0.62/0.81 % Vampire---4.8 exiting
%------------------------------------------------------------------------------