TSTP Solution File: SWC207+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC207+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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n031.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 04:00:36 EDT 2024
% Result : Theorem 0.62s 0.80s
% Output : Refutation 0.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of formulae : 53 ( 12 unt; 0 def)
% Number of atoms : 323 ( 106 equ)
% Maximal formula atoms : 34 ( 6 avg)
% Number of connectives : 391 ( 121 ~; 110 |; 135 &)
% ( 6 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 5 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 74 ( 37 !; 37 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f316,plain,
$false,
inference(avatar_sat_refutation,[],[f254,f255,f263,f266,f311]) ).
fof(f311,plain,
( ~ spl11_2
| ~ spl11_4
| ~ spl11_5 ),
inference(avatar_contradiction_clause,[],[f310]) ).
fof(f310,plain,
( $false
| ~ spl11_2
| ~ spl11_4
| ~ spl11_5 ),
inference(subsumption_resolution,[],[f309,f185]) ).
fof(f185,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.OpNqN1QWvi/Vampire---4.8_19087',ax17) ).
fof(f309,plain,
( ~ ssList(nil)
| ~ spl11_2
| ~ spl11_4
| ~ spl11_5 ),
inference(subsumption_resolution,[],[f303,f246]) ).
fof(f246,plain,
( ssItem(sK4)
| ~ spl11_5 ),
inference(avatar_component_clause,[],[f244]) ).
fof(f244,plain,
( spl11_5
<=> ssItem(sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_5])]) ).
fof(f303,plain,
( ~ ssItem(sK4)
| ~ ssList(nil)
| ~ spl11_2
| ~ spl11_4 ),
inference(trivial_inequality_removal,[],[f296]) ).
fof(f296,plain,
( nil != nil
| ~ ssItem(sK4)
| ~ ssList(nil)
| ~ spl11_2
| ~ spl11_4 ),
inference(superposition,[],[f179,f284]) ).
fof(f284,plain,
( nil = cons(sK4,nil)
| ~ spl11_2
| ~ spl11_4 ),
inference(superposition,[],[f241,f231]) ).
fof(f231,plain,
( nil = sK2
| ~ spl11_2 ),
inference(avatar_component_clause,[],[f229]) ).
fof(f229,plain,
( spl11_2
<=> nil = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl11_2])]) ).
fof(f241,plain,
( sK2 = cons(sK4,nil)
| ~ spl11_4 ),
inference(avatar_component_clause,[],[f239]) ).
fof(f239,plain,
( spl11_4
<=> sK2 = cons(sK4,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_4])]) ).
fof(f179,plain,
! [X0,X1] :
( cons(X1,X0) != X0
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f105]) ).
fof(f105,plain,
! [X0] :
( ! [X1] :
( cons(X1,X0) != X0
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f18]) ).
fof(f18,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) != X0 ) ),
file('/export/starexec/sandbox2/tmp/tmp.OpNqN1QWvi/Vampire---4.8_19087',ax18) ).
fof(f266,plain,
spl11_2,
inference(avatar_split_clause,[],[f265,f229]) ).
fof(f265,plain,
nil = sK2,
inference(subsumption_resolution,[],[f264,f156]) ).
fof(f156,plain,
ssList(sK2),
inference(cnf_transformation,[],[f134]) ).
fof(f134,plain,
( ( ( nil = sK2
& nil = sK3 )
| ( ! [X5] :
( ~ leq(sK4,X5)
| ~ memberP(sK3,X5)
| sK4 = X5
| ~ ssItem(X5) )
& memberP(sK3,sK4)
& sK2 = cons(sK4,nil)
& ssItem(sK4) ) )
& ~ neq(sK0,nil)
& neq(sK1,nil)
& sK0 = sK2
& sK1 = sK3
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f99,f133,f132,f131,f130,f129]) ).
fof(f129,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ~ neq(X0,nil)
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ~ neq(sK0,nil)
& neq(X1,nil)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f130,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ~ neq(sK0,nil)
& neq(X1,nil)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ~ neq(sK0,nil)
& neq(sK1,nil)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f131,plain,
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ~ neq(sK0,nil)
& neq(sK1,nil)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( nil = sK2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = sK2
& ssItem(X4) ) )
& ~ neq(sK0,nil)
& neq(sK1,nil)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f132,plain,
( ? [X3] :
( ( ( nil = sK2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = sK2
& ssItem(X4) ) )
& ~ neq(sK0,nil)
& neq(sK1,nil)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( ( nil = sK2
& nil = sK3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(sK3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(sK3,X4)
& cons(X4,nil) = sK2
& ssItem(X4) ) )
& ~ neq(sK0,nil)
& neq(sK1,nil)
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f133,plain,
( ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(sK3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(sK3,X4)
& cons(X4,nil) = sK2
& ssItem(X4) )
=> ( ! [X5] :
( ~ leq(sK4,X5)
| ~ memberP(sK3,X5)
| sK4 = X5
| ~ ssItem(X5) )
& memberP(sK3,sK4)
& sK2 = cons(sK4,nil)
& ssItem(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ~ neq(X0,nil)
& 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] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ~ neq(X0,nil)
& 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)
=> ( ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssItem(X4)
=> ( ? [X5] :
( leq(X4,X5)
& memberP(X3,X5)
& X4 != X5
& ssItem(X5) )
| ~ memberP(X3,X4)
| cons(X4,nil) != X2 ) ) )
| neq(X0,nil)
| ~ 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)
=> ( ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssItem(X4)
=> ( ? [X5] :
( leq(X4,X5)
& memberP(X3,X5)
& X4 != X5
& ssItem(X5) )
| ~ memberP(X3,X4)
| cons(X4,nil) != X2 ) ) )
| neq(X0,nil)
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.OpNqN1QWvi/Vampire---4.8_19087',co1) ).
fof(f264,plain,
( nil = sK2
| ~ ssList(sK2) ),
inference(subsumption_resolution,[],[f257,f185]) ).
fof(f257,plain,
( nil = sK2
| ~ ssList(nil)
| ~ ssList(sK2) ),
inference(resolution,[],[f211,f182]) ).
fof(f182,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f141]) ).
fof(f141,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f107]) ).
fof(f107,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/sandbox2/tmp/tmp.OpNqN1QWvi/Vampire---4.8_19087',ax15) ).
fof(f211,plain,
~ neq(sK2,nil),
inference(definition_unfolding,[],[f161,f159]) ).
fof(f159,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f134]) ).
fof(f161,plain,
~ neq(sK0,nil),
inference(cnf_transformation,[],[f134]) ).
fof(f263,plain,
( ~ spl11_2
| ~ spl11_6 ),
inference(avatar_contradiction_clause,[],[f262]) ).
fof(f262,plain,
( $false
| ~ spl11_2
| ~ spl11_6 ),
inference(subsumption_resolution,[],[f260,f258]) ).
fof(f258,plain,
( ~ neq(nil,nil)
| ~ spl11_2 ),
inference(superposition,[],[f211,f231]) ).
fof(f260,plain,
( neq(nil,nil)
| ~ spl11_6 ),
inference(superposition,[],[f212,f251]) ).
fof(f251,plain,
( nil = sK3
| ~ spl11_6 ),
inference(avatar_component_clause,[],[f249]) ).
fof(f249,plain,
( spl11_6
<=> nil = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl11_6])]) ).
fof(f212,plain,
neq(sK3,nil),
inference(definition_unfolding,[],[f160,f158]) ).
fof(f158,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f134]) ).
fof(f160,plain,
neq(sK1,nil),
inference(cnf_transformation,[],[f134]) ).
fof(f255,plain,
( spl11_5
| spl11_6 ),
inference(avatar_split_clause,[],[f162,f249,f244]) ).
fof(f162,plain,
( nil = sK3
| ssItem(sK4) ),
inference(cnf_transformation,[],[f134]) ).
fof(f254,plain,
( spl11_4
| spl11_6 ),
inference(avatar_split_clause,[],[f163,f249,f239]) ).
fof(f163,plain,
( nil = sK3
| sK2 = cons(sK4,nil) ),
inference(cnf_transformation,[],[f134]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC207+1 : TPTP v8.1.2. Released v2.4.0.
% 0.13/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.35 % Computer : n031.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 : Tue Apr 30 18:51:29 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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.OpNqN1QWvi/Vampire---4.8_19087
% 0.62/0.79 % (19286)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.62/0.79 % (19283)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.62/0.79 % (19280)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 (2995ds/34Mi)
% 0.62/0.79 % (19282)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 (2995ds/51Mi)
% 0.62/0.79 % (19288)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 (2995ds/56Mi)
% 0.62/0.79 % (19284)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.62/0.79 % (19285)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 (2995ds/34Mi)
% 0.62/0.79 % (19287)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 (2995ds/83Mi)
% 0.62/0.80 % (19288)Refutation not found, incomplete strategy% (19288)------------------------------
% 0.62/0.80 % (19288)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.62/0.80 % (19288)Termination reason: Refutation not found, incomplete strategy
% 0.62/0.80
% 0.62/0.80 % (19288)Memory used [KB]: 1157
% 0.62/0.80 % (19288)Time elapsed: 0.004 s
% 0.62/0.80 % (19288)Instructions burned: 5 (million)
% 0.62/0.80 % (19288)------------------------------
% 0.62/0.80 % (19288)------------------------------
% 0.62/0.80 % (19286)First to succeed.
% 0.62/0.80 % (19286)Refutation found. Thanks to Tanya!
% 0.62/0.80 % SZS status Theorem for Vampire---4
% 0.62/0.80 % SZS output start Proof for Vampire---4
% See solution above
% 0.62/0.80 % (19286)------------------------------
% 0.62/0.80 % (19286)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.62/0.80 % (19286)Termination reason: Refutation
% 0.62/0.80
% 0.62/0.80 % (19286)Memory used [KB]: 1184
% 0.62/0.80 % (19286)Time elapsed: 0.007 s
% 0.62/0.80 % (19286)Instructions burned: 8 (million)
% 0.62/0.80 % (19286)------------------------------
% 0.62/0.80 % (19286)------------------------------
% 0.62/0.80 % (19251)Success in time 0.437 s
% 0.62/0.80 % Vampire---4.8 exiting
%------------------------------------------------------------------------------