TSTP Solution File: SWC049+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC049+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 : n021.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 : Theorem 0.61s 0.77s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 13
% Syntax : Number of formulae : 50 ( 8 unt; 0 def)
% Number of atoms : 303 ( 94 equ)
% Maximal formula atoms : 34 ( 6 avg)
% Number of connectives : 402 ( 149 ~; 120 |; 111 &)
% ( 7 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 6 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 58 ( 32 !; 26 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f230,plain,
$false,
inference(avatar_sat_refutation,[],[f163,f168,f177,f178,f206,f229]) ).
fof(f229,plain,
( ~ spl5_2
| ~ spl5_3 ),
inference(avatar_contradiction_clause,[],[f228]) ).
fof(f228,plain,
( $false
| ~ spl5_2
| ~ spl5_3 ),
inference(subsumption_resolution,[],[f227,f125]) ).
fof(f125,plain,
ssList(sK2),
inference(cnf_transformation,[],[f116]) ).
fof(f116,plain,
( ( ( rearsegP(sK3,sK2)
& neq(sK2,nil) )
| ~ neq(sK3,nil) )
& ( nil != sK0
| nil != sK1 )
& ( nil != sK3
| nil = sK2 )
& ! [X4] :
( ~ rearsegP(sK0,X4)
| ~ rearsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f100,f115,f114,f113,f112]) ).
fof(f112,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( nil != X0
| nil != X1 )
& ( nil != X3
| nil = X2 )
& ! [X4] :
( ~ rearsegP(X0,X4)
| ~ rearsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( nil != sK0
| nil != X1 )
& ( nil != X3
| nil = X2 )
& ! [X4] :
( ~ rearsegP(sK0,X4)
| ~ rearsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f113,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( nil != sK0
| nil != X1 )
& ( nil != X3
| nil = X2 )
& ! [X4] :
( ~ rearsegP(sK0,X4)
| ~ rearsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( nil != sK0
| nil != sK1 )
& ( nil != X3
| nil = X2 )
& ! [X4] :
( ~ rearsegP(sK0,X4)
| ~ rearsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f114,plain,
( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( nil != sK0
| nil != sK1 )
& ( nil != X3
| nil = X2 )
& ! [X4] :
( ~ rearsegP(sK0,X4)
| ~ rearsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( rearsegP(X3,sK2)
& neq(sK2,nil) )
| ~ neq(X3,nil) )
& ( nil != sK0
| nil != sK1 )
& ( nil != X3
| nil = sK2 )
& ! [X4] :
( ~ rearsegP(sK0,X4)
| ~ rearsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f115,plain,
( ? [X3] :
( ( ( rearsegP(X3,sK2)
& neq(sK2,nil) )
| ~ neq(X3,nil) )
& ( nil != sK0
| nil != sK1 )
& ( nil != X3
| nil = sK2 )
& ! [X4] :
( ~ rearsegP(sK0,X4)
| ~ rearsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( ( rearsegP(sK3,sK2)
& neq(sK2,nil) )
| ~ neq(sK3,nil) )
& ( nil != sK0
| nil != sK1 )
& ( nil != sK3
| nil = sK2 )
& ! [X4] :
( ~ rearsegP(sK0,X4)
| ~ rearsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f100,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( nil != X0
| nil != X1 )
& ( nil != X3
| nil = X2 )
& ! [X4] :
( ~ rearsegP(X0,X4)
| ~ rearsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f99]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( nil != X0
| nil != X1 )
& ( nil != X3
| nil = X2 )
& ! [X4] :
( ~ rearsegP(X0,X4)
| ~ rearsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& 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)
=> ( ( ( ~ rearsegP(X3,X2)
| ~ neq(X2,nil) )
& neq(X3,nil) )
| ( nil = X0
& nil = X1 )
| ( nil = X3
& nil != X2 )
| ? [X4] :
( rearsegP(X0,X4)
& rearsegP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ~ rearsegP(X3,X2)
| ~ neq(X2,nil) )
& neq(X3,nil) )
| ( nil = X0
& nil = X1 )
| ( nil = X3
& nil != X2 )
| ? [X4] :
( rearsegP(X0,X4)
& rearsegP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f227,plain,
( ~ ssList(sK2)
| ~ spl5_2
| ~ spl5_3 ),
inference(subsumption_resolution,[],[f226,f183]) ).
fof(f183,plain,
rearsegP(sK2,sK2),
inference(unit_resulting_resolution,[],[f125,f141]) ).
fof(f141,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(f226,plain,
( ~ rearsegP(sK2,sK2)
| ~ ssList(sK2)
| ~ spl5_2
| ~ spl5_3 ),
inference(subsumption_resolution,[],[f214,f162]) ).
fof(f162,plain,
( rearsegP(sK3,sK2)
| ~ spl5_2 ),
inference(avatar_component_clause,[],[f160]) ).
fof(f160,plain,
( spl5_2
<=> rearsegP(sK3,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_2])]) ).
fof(f214,plain,
( ~ rearsegP(sK3,sK2)
| ~ rearsegP(sK2,sK2)
| ~ ssList(sK2)
| ~ spl5_3 ),
inference(resolution,[],[f148,f167]) ).
fof(f167,plain,
( neq(sK2,nil)
| ~ spl5_3 ),
inference(avatar_component_clause,[],[f165]) ).
fof(f165,plain,
( spl5_3
<=> neq(sK2,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_3])]) ).
fof(f148,plain,
! [X4] :
( ~ neq(X4,nil)
| ~ rearsegP(sK3,X4)
| ~ rearsegP(sK2,X4)
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f129,f128,f127]) ).
fof(f127,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f116]) ).
fof(f128,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f116]) ).
fof(f129,plain,
! [X4] :
( ~ rearsegP(sK0,X4)
| ~ rearsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f116]) ).
fof(f206,plain,
( spl5_1
| spl5_4 ),
inference(avatar_split_clause,[],[f193,f170,f156]) ).
fof(f156,plain,
( spl5_1
<=> neq(sK3,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_1])]) ).
fof(f170,plain,
( spl5_4
<=> nil = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl5_4])]) ).
fof(f193,plain,
( neq(sK3,nil)
| spl5_4 ),
inference(unit_resulting_resolution,[],[f126,f136,f172,f135]) ).
fof(f135,plain,
! [X0,X1] :
( X0 = X1
| neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f117]) ).
fof(f117,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f101]) ).
fof(f101,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax15) ).
fof(f172,plain,
( nil != sK3
| spl5_4 ),
inference(avatar_component_clause,[],[f170]) ).
fof(f136,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f126,plain,
ssList(sK3),
inference(cnf_transformation,[],[f116]) ).
fof(f178,plain,
( spl5_5
| ~ spl5_4 ),
inference(avatar_split_clause,[],[f130,f170,f174]) ).
fof(f174,plain,
( spl5_5
<=> nil = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl5_5])]) ).
fof(f130,plain,
( nil != sK3
| nil = sK2 ),
inference(cnf_transformation,[],[f116]) ).
fof(f177,plain,
( ~ spl5_4
| ~ spl5_5 ),
inference(avatar_split_clause,[],[f147,f174,f170]) ).
fof(f147,plain,
( nil != sK2
| nil != sK3 ),
inference(definition_unfolding,[],[f131,f128,f127]) ).
fof(f131,plain,
( nil != sK0
| nil != sK1 ),
inference(cnf_transformation,[],[f116]) ).
fof(f168,plain,
( ~ spl5_1
| spl5_3 ),
inference(avatar_split_clause,[],[f132,f165,f156]) ).
fof(f132,plain,
( neq(sK2,nil)
| ~ neq(sK3,nil) ),
inference(cnf_transformation,[],[f116]) ).
fof(f163,plain,
( ~ spl5_1
| spl5_2 ),
inference(avatar_split_clause,[],[f133,f160,f156]) ).
fof(f133,plain,
( rearsegP(sK3,sK2)
| ~ neq(sK3,nil) ),
inference(cnf_transformation,[],[f116]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : SWC049+1 : TPTP v8.2.0. Released v2.4.0.
% 0.05/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.10/0.30 % Computer : n021.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Sun May 19 03:45:07 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.10/0.31 This is a FOF_THM_RFO_SEQ problem
% 0.10/0.31 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.61/0.77 % (8372)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2995ds/33Mi)
% 0.61/0.77 % (8369)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.61/0.77 % (8374)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.61/0.77 % (8370)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.61/0.77 % (8371)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.61/0.77 % (8373)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.61/0.77 % (8375)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.61/0.77 % (8376)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.61/0.77 % (8372)First to succeed.
% 0.61/0.77 % (8374)Also succeeded, but the first one will report.
% 0.61/0.77 % (8371)Also succeeded, but the first one will report.
% 0.61/0.77 % (8372)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-8368"
% 0.61/0.77 % (8372)Refutation found. Thanks to Tanya!
% 0.61/0.77 % SZS status Theorem for theBenchmark
% 0.61/0.77 % SZS output start Proof for theBenchmark
% See solution above
% 0.61/0.77 % (8372)------------------------------
% 0.61/0.77 % (8372)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.77 % (8372)Termination reason: Refutation
% 0.61/0.77
% 0.61/0.77 % (8372)Memory used [KB]: 1172
% 0.61/0.77 % (8372)Time elapsed: 0.005 s
% 0.61/0.77 % (8372)Instructions burned: 6 (million)
% 0.61/0.77 % (8368)Success in time 0.456 s
% 0.61/0.77 % Vampire---4.8 exiting
%------------------------------------------------------------------------------