TSTP Solution File: SWC179+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC179+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 : n023.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 : Sun May 5 09:49:11 EDT 2024
% Result : Theorem 0.57s 0.76s
% Output : Refutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 13
% Syntax : Number of formulae : 44 ( 8 unt; 0 def)
% Number of atoms : 341 ( 96 equ)
% Maximal formula atoms : 22 ( 7 avg)
% Number of connectives : 426 ( 129 ~; 101 |; 165 &)
% ( 2 <=>; 29 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 8 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 3 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 124 ( 66 !; 58 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f313,plain,
$false,
inference(avatar_sat_refutation,[],[f274,f284,f312]) ).
fof(f312,plain,
~ spl19_1,
inference(avatar_contradiction_clause,[],[f311]) ).
fof(f311,plain,
( $false
| ~ spl19_1 ),
inference(subsumption_resolution,[],[f310,f269]) ).
fof(f269,plain,
( sP0(sK7,sK6)
| ~ spl19_1 ),
inference(avatar_component_clause,[],[f267]) ).
fof(f267,plain,
( spl19_1
<=> sP0(sK7,sK6) ),
introduced(avatar_definition,[new_symbols(naming,[spl19_1])]) ).
fof(f310,plain,
( ~ sP0(sK7,sK6)
| ~ spl19_1 ),
inference(resolution,[],[f309,f181]) ).
fof(f181,plain,
! [X0,X1] :
( ssItem(sK1(X0,X1))
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f148]) ).
fof(f148,plain,
! [X0,X1] :
( ( ! [X5] :
( ~ lt(X5,sK1(X0,X1))
| ~ memberP(sK3(X0,X1),X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(sK1(X0,X1),X6)
| ~ memberP(sK2(X0,X1),X6)
| ~ ssItem(X6) )
& app(app(sK2(X0,X1),X1),sK3(X0,X1)) = X0
& cons(sK1(X0,X1),nil) = X1
& ssList(sK3(X0,X1))
& ssList(sK2(X0,X1))
& ssItem(sK1(X0,X1)) )
| ~ sP0(X0,X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f144,f147,f146,f145]) ).
fof(f145,plain,
! [X0,X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ! [X5] :
( ~ lt(X5,X2)
| ~ memberP(X4,X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(X2,X6)
| ~ memberP(X3,X6)
| ~ ssItem(X6) )
& app(app(X3,X1),X4) = X0
& cons(X2,nil) = X1
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
=> ( ? [X3] :
( ? [X4] :
( ! [X5] :
( ~ lt(X5,sK1(X0,X1))
| ~ memberP(X4,X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(sK1(X0,X1),X6)
| ~ memberP(X3,X6)
| ~ ssItem(X6) )
& app(app(X3,X1),X4) = X0
& cons(sK1(X0,X1),nil) = X1
& ssList(X4) )
& ssList(X3) )
& ssItem(sK1(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f146,plain,
! [X0,X1] :
( ? [X3] :
( ? [X4] :
( ! [X5] :
( ~ lt(X5,sK1(X0,X1))
| ~ memberP(X4,X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(sK1(X0,X1),X6)
| ~ memberP(X3,X6)
| ~ ssItem(X6) )
& app(app(X3,X1),X4) = X0
& cons(sK1(X0,X1),nil) = X1
& ssList(X4) )
& ssList(X3) )
=> ( ? [X4] :
( ! [X5] :
( ~ lt(X5,sK1(X0,X1))
| ~ memberP(X4,X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(sK1(X0,X1),X6)
| ~ memberP(sK2(X0,X1),X6)
| ~ ssItem(X6) )
& app(app(sK2(X0,X1),X1),X4) = X0
& cons(sK1(X0,X1),nil) = X1
& ssList(X4) )
& ssList(sK2(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f147,plain,
! [X0,X1] :
( ? [X4] :
( ! [X5] :
( ~ lt(X5,sK1(X0,X1))
| ~ memberP(X4,X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(sK1(X0,X1),X6)
| ~ memberP(sK2(X0,X1),X6)
| ~ ssItem(X6) )
& app(app(sK2(X0,X1),X1),X4) = X0
& cons(sK1(X0,X1),nil) = X1
& ssList(X4) )
=> ( ! [X5] :
( ~ lt(X5,sK1(X0,X1))
| ~ memberP(sK3(X0,X1),X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(sK1(X0,X1),X6)
| ~ memberP(sK2(X0,X1),X6)
| ~ ssItem(X6) )
& app(app(sK2(X0,X1),X1),sK3(X0,X1)) = X0
& cons(sK1(X0,X1),nil) = X1
& ssList(sK3(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f144,plain,
! [X0,X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ! [X5] :
( ~ lt(X5,X2)
| ~ memberP(X4,X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(X2,X6)
| ~ memberP(X3,X6)
| ~ ssItem(X6) )
& app(app(X3,X1),X4) = X0
& cons(X2,nil) = X1
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
| ~ sP0(X0,X1) ),
inference(rectify,[],[f143]) ).
fof(f143,plain,
! [X3,X2] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ lt(X7,X4)
| ~ memberP(X6,X7)
| ~ ssItem(X7) )
& ! [X8] :
( ~ lt(X4,X8)
| ~ memberP(X5,X8)
| ~ ssItem(X8) )
& app(app(X5,X2),X6) = X3
& cons(X4,nil) = X2
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| ~ sP0(X3,X2) ),
inference(nnf_transformation,[],[f141]) ).
fof(f141,plain,
! [X3,X2] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ lt(X7,X4)
| ~ memberP(X6,X7)
| ~ ssItem(X7) )
& ! [X8] :
( ~ lt(X4,X8)
| ~ memberP(X5,X8)
| ~ ssItem(X8) )
& app(app(X5,X2),X6) = X3
& cons(X4,nil) = X2
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| ~ sP0(X3,X2) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f309,plain,
( ~ ssItem(sK1(sK7,sK6))
| ~ spl19_1 ),
inference(subsumption_resolution,[],[f304,f252]) ).
fof(f252,plain,
~ duplicatefreeP(sK6),
inference(definition_unfolding,[],[f194,f193]) ).
fof(f193,plain,
sK4 = sK6,
inference(cnf_transformation,[],[f153]) ).
fof(f153,plain,
( ( ( nil = sK6
& nil = sK7 )
| sP0(sK7,sK6) )
& ~ duplicatefreeP(sK4)
& sK4 = sK6
& sK5 = sK7
& ssList(sK7)
& ssList(sK6)
& ssList(sK5)
& ssList(sK4) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6,sK7])],[f142,f152,f151,f150,f149]) ).
fof(f149,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| sP0(X3,X2) )
& ~ duplicatefreeP(X0)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| sP0(X3,X2) )
& ~ duplicatefreeP(sK4)
& sK4 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f150,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| sP0(X3,X2) )
& ~ duplicatefreeP(sK4)
& sK4 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| sP0(X3,X2) )
& ~ duplicatefreeP(sK4)
& sK4 = X2
& sK5 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f151,plain,
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| sP0(X3,X2) )
& ~ duplicatefreeP(sK4)
& sK4 = X2
& sK5 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( nil = sK6
& nil = X3 )
| sP0(X3,sK6) )
& ~ duplicatefreeP(sK4)
& sK4 = sK6
& sK5 = X3
& ssList(X3) )
& ssList(sK6) ) ),
introduced(choice_axiom,[]) ).
fof(f152,plain,
( ? [X3] :
( ( ( nil = sK6
& nil = X3 )
| sP0(X3,sK6) )
& ~ duplicatefreeP(sK4)
& sK4 = sK6
& sK5 = X3
& ssList(X3) )
=> ( ( ( nil = sK6
& nil = sK7 )
| sP0(sK7,sK6) )
& ~ duplicatefreeP(sK4)
& sK4 = sK6
& sK5 = sK7
& ssList(sK7) ) ),
introduced(choice_axiom,[]) ).
fof(f142,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| sP0(X3,X2) )
& ~ duplicatefreeP(X0)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(definition_folding,[],[f100,f141]) ).
fof(f100,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ lt(X7,X4)
| ~ memberP(X6,X7)
| ~ ssItem(X7) )
& ! [X8] :
( ~ lt(X4,X8)
| ~ memberP(X5,X8)
| ~ ssItem(X8) )
& app(app(X5,X2),X6) = X3
& cons(X4,nil) = X2
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) ) )
& ~ duplicatefreeP(X0)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f99]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ lt(X7,X4)
| ~ memberP(X6,X7)
| ~ ssItem(X7) )
& ! [X8] :
( ~ lt(X4,X8)
| ~ memberP(X5,X8)
| ~ ssItem(X8) )
& app(app(X5,X2),X6) = X3
& cons(X4,nil) = X2
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) ) )
& ~ duplicatefreeP(X0)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( ? [X7] :
( lt(X7,X4)
& memberP(X6,X7)
& ssItem(X7) )
| ? [X8] :
( lt(X4,X8)
& memberP(X5,X8)
& ssItem(X8) )
| app(app(X5,X2),X6) != X3
| cons(X4,nil) != X2 ) ) ) ) )
| duplicatefreeP(X0)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[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] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( ? [X8] :
( lt(X8,X4)
& memberP(X6,X8)
& ssItem(X8) )
| ? [X7] :
( lt(X4,X7)
& memberP(X5,X7)
& ssItem(X7) )
| app(app(X5,X2),X6) != X3
| cons(X4,nil) != X2 ) ) ) ) )
| duplicatefreeP(X0)
| 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] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( ? [X8] :
( lt(X8,X4)
& memberP(X6,X8)
& ssItem(X8) )
| ? [X7] :
( lt(X4,X7)
& memberP(X5,X7)
& ssItem(X7) )
| app(app(X5,X2),X6) != X3
| cons(X4,nil) != X2 ) ) ) ) )
| duplicatefreeP(X0)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.QuComYUaEi/Vampire---4.8_28335',co1) ).
fof(f194,plain,
~ duplicatefreeP(sK4),
inference(cnf_transformation,[],[f153]) ).
fof(f304,plain,
( duplicatefreeP(sK6)
| ~ ssItem(sK1(sK7,sK6))
| ~ spl19_1 ),
inference(superposition,[],[f240,f303]) ).
fof(f303,plain,
( sK6 = cons(sK1(sK7,sK6),nil)
| ~ spl19_1 ),
inference(resolution,[],[f269,f184]) ).
fof(f184,plain,
! [X0,X1] :
( ~ sP0(X0,X1)
| cons(sK1(X0,X1),nil) = X1 ),
inference(cnf_transformation,[],[f148]) ).
fof(f240,plain,
! [X0] :
( duplicatefreeP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f133]) ).
fof(f133,plain,
! [X0] :
( duplicatefreeP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f71]) ).
fof(f71,axiom,
! [X0] :
( ssItem(X0)
=> duplicatefreeP(cons(X0,nil)) ),
file('/export/starexec/sandbox/tmp/tmp.QuComYUaEi/Vampire---4.8_28335',ax71) ).
fof(f284,plain,
~ spl19_2,
inference(avatar_contradiction_clause,[],[f283]) ).
fof(f283,plain,
( $false
| ~ spl19_2 ),
inference(subsumption_resolution,[],[f282,f239]) ).
fof(f239,plain,
duplicatefreeP(nil),
inference(cnf_transformation,[],[f72]) ).
fof(f72,axiom,
duplicatefreeP(nil),
file('/export/starexec/sandbox/tmp/tmp.QuComYUaEi/Vampire---4.8_28335',ax72) ).
fof(f282,plain,
( ~ duplicatefreeP(nil)
| ~ spl19_2 ),
inference(backward_demodulation,[],[f252,f273]) ).
fof(f273,plain,
( nil = sK6
| ~ spl19_2 ),
inference(avatar_component_clause,[],[f271]) ).
fof(f271,plain,
( spl19_2
<=> nil = sK6 ),
introduced(avatar_definition,[new_symbols(naming,[spl19_2])]) ).
fof(f274,plain,
( spl19_1
| spl19_2 ),
inference(avatar_split_clause,[],[f196,f271,f267]) ).
fof(f196,plain,
( nil = sK6
| sP0(sK7,sK6) ),
inference(cnf_transformation,[],[f153]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SWC179+1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/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.16/0.37 % Computer : n023.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Fri May 3 20:30:23 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.16/0.37 This is a FOF_THM_RFO_SEQ problem
% 0.16/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.QuComYUaEi/Vampire---4.8_28335
% 0.57/0.75 % (28591)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.75 % (28585)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.75 % (28587)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.75 % (28588)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.75 % (28586)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.75 % (28589)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.75 % (28590)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.76 % (28590)Refutation not found, incomplete strategy% (28590)------------------------------
% 0.57/0.76 % (28590)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.76 % (28590)Termination reason: Refutation not found, incomplete strategy
% 0.57/0.76
% 0.57/0.76 % (28590)Memory used [KB]: 1149
% 0.57/0.76 % (28590)Time elapsed: 0.005 s
% 0.57/0.76 % (28590)Instructions burned: 6 (million)
% 0.57/0.76 % (28590)------------------------------
% 0.57/0.76 % (28590)------------------------------
% 0.57/0.76 % (28587)First to succeed.
% 0.57/0.76 % (28587)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-28581"
% 0.57/0.76 % (28587)Refutation found. Thanks to Tanya!
% 0.57/0.76 % SZS status Theorem for Vampire---4
% 0.57/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.57/0.76 % (28587)------------------------------
% 0.57/0.76 % (28587)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.76 % (28587)Termination reason: Refutation
% 0.57/0.76
% 0.57/0.76 % (28587)Memory used [KB]: 1179
% 0.57/0.76 % (28587)Time elapsed: 0.008 s
% 0.57/0.76 % (28587)Instructions burned: 11 (million)
% 0.57/0.76 % (28581)Success in time 0.38 s
% 0.57/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------