TSTP Solution File: SWC103+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC103+1 : TPTP v8.1.2. 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 : 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 : Wed May 1 03:59:47 EDT 2024
% Result : Theorem 0.57s 0.77s
% Output : Refutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 20 ( 9 unt; 0 def)
% Number of atoms : 79 ( 18 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 88 ( 29 ~; 23 |; 26 &)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 16 ( 8 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f219,plain,
$false,
inference(avatar_sat_refutation,[],[f214,f216,f218]) ).
fof(f218,plain,
spl9_4,
inference(avatar_split_clause,[],[f217,f211]) ).
fof(f211,plain,
( spl9_4
<=> neq(sK2,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_4])]) ).
fof(f217,plain,
neq(sK2,nil),
inference(subsumption_resolution,[],[f131,f184]) ).
fof(f184,plain,
neq(sK3,nil),
inference(definition_unfolding,[],[f138,f136]) ).
fof(f136,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f99]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( ~ frontsegP(X1,X0)
| ~ neq(X0,nil) )
& ( nil != X3
| nil = X2 )
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( ~ frontsegP(X1,X0)
| ~ neq(X0,nil) )
& ( nil != X3
| nil = X2 )
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ~ frontsegP(X3,X2)
| ~ neq(X2,nil) )
& neq(X3,nil) )
| ( frontsegP(X1,X0)
& neq(X0,nil) )
| ( nil = X3
& nil != X2 )
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ~ frontsegP(X3,X2)
| ~ neq(X2,nil) )
& neq(X3,nil) )
| ( frontsegP(X1,X0)
& neq(X0,nil) )
| ( nil = X3
& nil != X2 )
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.RZDg6KFxIO/Vampire---4.8_13925',co1) ).
fof(f138,plain,
neq(sK1,nil),
inference(cnf_transformation,[],[f99]) ).
fof(f131,plain,
( ~ neq(sK3,nil)
| neq(sK2,nil) ),
inference(cnf_transformation,[],[f99]) ).
fof(f216,plain,
spl9_3,
inference(avatar_split_clause,[],[f215,f207]) ).
fof(f207,plain,
( spl9_3
<=> frontsegP(sK3,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_3])]) ).
fof(f215,plain,
frontsegP(sK3,sK2),
inference(subsumption_resolution,[],[f132,f184]) ).
fof(f132,plain,
( ~ neq(sK3,nil)
| frontsegP(sK3,sK2) ),
inference(cnf_transformation,[],[f99]) ).
fof(f214,plain,
( ~ spl9_3
| ~ spl9_4 ),
inference(avatar_split_clause,[],[f185,f211,f207]) ).
fof(f185,plain,
( ~ neq(sK2,nil)
| ~ frontsegP(sK3,sK2) ),
inference(definition_unfolding,[],[f133,f137,f136,f137]) ).
fof(f137,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f99]) ).
fof(f133,plain,
( ~ neq(sK0,nil)
| ~ frontsegP(sK1,sK0) ),
inference(cnf_transformation,[],[f99]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC103+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.15 % 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.15/0.36 % Computer : n020.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Tue Apr 30 18:16:17 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.15/0.37 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.37 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/tmp/tmp.RZDg6KFxIO/Vampire---4.8_13925
% 0.57/0.77 % (14187)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 Vampire---4 for (2996ds/83Mi)
% 0.57/0.77 % (14188)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2996ds/56Mi)
% 0.57/0.77 % (14181)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 Vampire---4 for (2996ds/34Mi)
% 0.57/0.77 % (14183)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.57/0.77 % (14182)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 Vampire---4 for (2996ds/51Mi)
% 0.57/0.77 % (14184)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.57/0.77 % (14185)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 Vampire---4 for (2996ds/34Mi)
% 0.57/0.77 % (14186)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.57/0.77 % (14187)First to succeed.
% 0.57/0.77 % (14184)Also succeeded, but the first one will report.
% 0.57/0.77 % (14187)Refutation found. Thanks to Tanya!
% 0.57/0.77 % SZS status Theorem for Vampire---4
% 0.57/0.77 % SZS output start Proof for Vampire---4
% See solution above
% 0.57/0.77 % (14187)------------------------------
% 0.57/0.77 % (14187)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.57/0.77 % (14187)Termination reason: Refutation
% 0.57/0.77
% 0.57/0.77 % (14187)Memory used [KB]: 1134
% 0.57/0.77 % (14187)Time elapsed: 0.003 s
% 0.57/0.77 % (14187)Instructions burned: 6 (million)
% 0.57/0.77 % (14187)------------------------------
% 0.57/0.77 % (14187)------------------------------
% 0.57/0.77 % (14177)Success in time 0.395 s
% 0.57/0.77 % Vampire---4.8 exiting
%------------------------------------------------------------------------------