TSTP Solution File: SWC047+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC047+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 : n011.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:48 EDT 2024
% Result : Theorem 0.54s 0.74s
% Output : Refutation 0.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of formulae : 47 ( 6 unt; 0 def)
% Number of atoms : 271 ( 78 equ)
% Maximal formula atoms : 28 ( 5 avg)
% Number of connectives : 353 ( 129 ~; 112 |; 95 &)
% ( 4 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 4 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 60 ( 34 !; 26 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f271,plain,
$false,
inference(avatar_sat_refutation,[],[f228,f229,f234,f235,f269]) ).
fof(f269,plain,
( ~ spl8_2
| ~ spl8_3 ),
inference(avatar_contradiction_clause,[],[f268]) ).
fof(f268,plain,
( $false
| ~ spl8_2
| ~ spl8_3 ),
inference(subsumption_resolution,[],[f265,f143]) ).
fof(f143,plain,
ssList(sK3),
inference(cnf_transformation,[],[f127]) ).
fof(f127,plain,
( ( ( ! [X4] :
( ~ rearsegP(sK0,X4)
| ~ rearsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& sK2 = sK3
& sK0 = sK2
& sK1 = sK3
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f99,f126,f125,f124,f123]) ).
fof(f123,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ rearsegP(X0,X4)
| ~ rearsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& X2 = X3
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ rearsegP(sK0,X4)
| ~ rearsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( nil != sK0
& nil = X1 ) )
& X2 = X3
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f124,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ rearsegP(sK0,X4)
| ~ rearsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( nil != sK0
& nil = X1 ) )
& X2 = X3
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ rearsegP(sK0,X4)
| ~ rearsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& X2 = X3
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f125,plain,
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ rearsegP(sK0,X4)
| ~ rearsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& X2 = X3
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( ! [X4] :
( ~ rearsegP(sK0,X4)
| ~ rearsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& sK2 = X3
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f126,plain,
( ? [X3] :
( ( ( ! [X4] :
( ~ rearsegP(sK0,X4)
| ~ rearsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& sK2 = X3
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( ( ! [X4] :
( ~ rearsegP(sK0,X4)
| ~ rearsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& sK2 = sK3
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ rearsegP(X0,X4)
| ~ rearsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& X2 = X3
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ rearsegP(X0,X4)
| ~ rearsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& X2 = X3
& 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)
=> ( ( ( ? [X4] :
( rearsegP(X0,X4)
& rearsegP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| X2 != X3
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ? [X4] :
( rearsegP(X0,X4)
& rearsegP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| X2 != X3
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f265,plain,
( ~ ssList(sK3)
| ~ spl8_2
| ~ spl8_3 ),
inference(resolution,[],[f264,f160]) ).
fof(f160,plain,
! [X0] :
( rearsegP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f106]) ).
fof(f106,plain,
! [X0] :
( rearsegP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f49]) ).
fof(f49,axiom,
! [X0] :
( ssList(X0)
=> rearsegP(X0,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax49) ).
fof(f264,plain,
( ~ rearsegP(sK3,sK3)
| ~ spl8_2
| ~ spl8_3 ),
inference(subsumption_resolution,[],[f263,f143]) ).
fof(f263,plain,
( ~ ssList(sK3)
| ~ rearsegP(sK3,sK3)
| ~ spl8_2
| ~ spl8_3 ),
inference(resolution,[],[f227,f233]) ).
fof(f233,plain,
( neq(sK3,nil)
| ~ spl8_3 ),
inference(avatar_component_clause,[],[f231]) ).
fof(f231,plain,
( spl8_3
<=> neq(sK3,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_3])]) ).
fof(f227,plain,
( ! [X4] :
( ~ neq(X4,nil)
| ~ ssList(X4)
| ~ rearsegP(sK3,X4) )
| ~ spl8_2 ),
inference(avatar_component_clause,[],[f226]) ).
fof(f226,plain,
( spl8_2
<=> ! [X4] :
( ~ rearsegP(sK3,X4)
| ~ ssList(X4)
| ~ neq(X4,nil) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_2])]) ).
fof(f235,plain,
( spl8_1
| spl8_3 ),
inference(avatar_split_clause,[],[f198,f231,f222]) ).
fof(f222,plain,
( spl8_1
<=> sQ7_eqProxy(nil,sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_1])]) ).
fof(f198,plain,
( neq(sK3,nil)
| sQ7_eqProxy(nil,sK3) ),
inference(equality_proxy_replacement,[],[f184,f194]) ).
fof(f194,plain,
! [X0,X1] :
( sQ7_eqProxy(X0,X1)
<=> X0 = X1 ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ7_eqProxy])]) ).
fof(f184,plain,
( neq(sK3,nil)
| nil = sK3 ),
inference(definition_unfolding,[],[f147,f144,f144]) ).
fof(f144,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f127]) ).
fof(f147,plain,
( neq(sK1,nil)
| nil = sK1 ),
inference(cnf_transformation,[],[f127]) ).
fof(f234,plain,
( ~ spl8_1
| spl8_3 ),
inference(avatar_split_clause,[],[f197,f231,f222]) ).
fof(f197,plain,
( neq(sK3,nil)
| ~ sQ7_eqProxy(nil,sK3) ),
inference(equality_proxy_replacement,[],[f183,f194]) ).
fof(f183,plain,
( neq(sK3,nil)
| nil != sK3 ),
inference(definition_unfolding,[],[f148,f144,f180]) ).
fof(f180,plain,
sK0 = sK3,
inference(definition_unfolding,[],[f145,f146]) ).
fof(f146,plain,
sK2 = sK3,
inference(cnf_transformation,[],[f127]) ).
fof(f145,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f127]) ).
fof(f148,plain,
( neq(sK1,nil)
| nil != sK0 ),
inference(cnf_transformation,[],[f127]) ).
fof(f229,plain,
( spl8_1
| spl8_2 ),
inference(avatar_split_clause,[],[f219,f226,f222]) ).
fof(f219,plain,
! [X4] :
( ~ rearsegP(sK3,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| sQ7_eqProxy(nil,sK3) ),
inference(duplicate_literal_removal,[],[f196]) ).
fof(f196,plain,
! [X4] :
( ~ rearsegP(sK3,X4)
| ~ rearsegP(sK3,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| sQ7_eqProxy(nil,sK3) ),
inference(equality_proxy_replacement,[],[f182,f194]) ).
fof(f182,plain,
! [X4] :
( ~ rearsegP(sK3,X4)
| ~ rearsegP(sK3,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil = sK3 ),
inference(definition_unfolding,[],[f149,f180,f144,f144]) ).
fof(f149,plain,
! [X4] :
( ~ rearsegP(sK0,X4)
| ~ rearsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil = sK1 ),
inference(cnf_transformation,[],[f127]) ).
fof(f228,plain,
( ~ spl8_1
| spl8_2 ),
inference(avatar_split_clause,[],[f220,f226,f222]) ).
fof(f220,plain,
! [X4] :
( ~ rearsegP(sK3,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| ~ sQ7_eqProxy(nil,sK3) ),
inference(duplicate_literal_removal,[],[f195]) ).
fof(f195,plain,
! [X4] :
( ~ rearsegP(sK3,X4)
| ~ rearsegP(sK3,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| ~ sQ7_eqProxy(nil,sK3) ),
inference(equality_proxy_replacement,[],[f181,f194]) ).
fof(f181,plain,
! [X4] :
( ~ rearsegP(sK3,X4)
| ~ rearsegP(sK3,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil != sK3 ),
inference(definition_unfolding,[],[f150,f180,f144,f180]) ).
fof(f150,plain,
! [X4] :
( ~ rearsegP(sK0,X4)
| ~ rearsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil != sK0 ),
inference(cnf_transformation,[],[f127]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWC047+1 : TPTP v8.2.0. Released v2.4.0.
% 0.06/0.14 % 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.35 % Computer : n011.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sun May 19 03:51:53 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.15/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.54/0.74 % (750)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.54/0.74 % (742)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.54/0.74 % (744)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.54/0.74 % (747)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.54/0.74 % (743)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.54/0.74 % (746)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.54/0.74 % (748)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.54/0.74 % (749)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.54/0.74 % (750)First to succeed.
% 0.54/0.74 % (750)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-741"
% 0.54/0.74 % (750)Refutation found. Thanks to Tanya!
% 0.54/0.74 % SZS status Theorem for theBenchmark
% 0.54/0.74 % SZS output start Proof for theBenchmark
% See solution above
% 0.54/0.74 % (750)------------------------------
% 0.54/0.74 % (750)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.74 % (750)Termination reason: Refutation
% 0.54/0.74
% 0.54/0.74 % (750)Memory used [KB]: 1180
% 0.54/0.74 % (750)Time elapsed: 0.003 s
% 0.54/0.74 % (750)Instructions burned: 6 (million)
% 0.54/0.74 % (741)Success in time 0.38 s
% 0.54/0.74 % Vampire---4.8 exiting
%------------------------------------------------------------------------------