TSTP Solution File: SWC286+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC286+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 : n005.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:01:09 EDT 2024
% Result : Theorem 0.55s 0.76s
% Output : Refutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 12
% Syntax : Number of formulae : 41 ( 9 unt; 0 def)
% Number of atoms : 284 ( 97 equ)
% Maximal formula atoms : 32 ( 6 avg)
% Number of connectives : 351 ( 108 ~; 101 |; 124 &)
% ( 5 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 4 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 65 ( 33 !; 32 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f330,plain,
$false,
inference(avatar_sat_refutation,[],[f295,f300,f312,f329]) ).
fof(f329,plain,
( ~ spl17_4
| ~ spl17_5 ),
inference(avatar_contradiction_clause,[],[f328]) ).
fof(f328,plain,
( $false
| ~ spl17_4
| ~ spl17_5 ),
inference(subsumption_resolution,[],[f327,f299]) ).
fof(f299,plain,
( ssItem(sK4)
| ~ spl17_5 ),
inference(avatar_component_clause,[],[f297]) ).
fof(f297,plain,
( spl17_5
<=> ssItem(sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl17_5])]) ).
fof(f327,plain,
( ~ ssItem(sK4)
| ~ spl17_4 ),
inference(subsumption_resolution,[],[f323,f210]) ).
fof(f210,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.xj4w3MHoVV/Vampire---4.8_12657',ax17) ).
fof(f323,plain,
( ~ ssList(nil)
| ~ ssItem(sK4)
| ~ spl17_4 ),
inference(resolution,[],[f320,f269]) ).
fof(f269,plain,
! [X0] :
( strictorderedP(cons(X0,nil))
| ~ ssList(nil)
| ~ ssItem(X0) ),
inference(equality_resolution,[],[f228]) ).
fof(f228,plain,
! [X0,X1] :
( strictorderedP(cons(X0,X1))
| nil != X1
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f169]) ).
fof(f169,plain,
! [X0] :
( ! [X1] :
( ( ( strictorderedP(cons(X0,X1))
| ( ( ~ lt(X0,hd(X1))
| ~ strictorderedP(X1)
| nil = X1 )
& nil != X1 ) )
& ( ( lt(X0,hd(X1))
& strictorderedP(X1)
& nil != X1 )
| nil = X1
| ~ strictorderedP(cons(X0,X1)) ) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(flattening,[],[f168]) ).
fof(f168,plain,
! [X0] :
( ! [X1] :
( ( ( strictorderedP(cons(X0,X1))
| ( ( ~ lt(X0,hd(X1))
| ~ strictorderedP(X1)
| nil = X1 )
& nil != X1 ) )
& ( ( lt(X0,hd(X1))
& strictorderedP(X1)
& nil != X1 )
| nil = X1
| ~ strictorderedP(cons(X0,X1)) ) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(nnf_transformation,[],[f115]) ).
fof(f115,plain,
! [X0] :
( ! [X1] :
( ( strictorderedP(cons(X0,X1))
<=> ( ( lt(X0,hd(X1))
& strictorderedP(X1)
& nil != X1 )
| nil = X1 ) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f70]) ).
fof(f70,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssList(X1)
=> ( strictorderedP(cons(X0,X1))
<=> ( ( lt(X0,hd(X1))
& strictorderedP(X1)
& nil != X1 )
| nil = X1 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.xj4w3MHoVV/Vampire---4.8_12657',ax70) ).
fof(f320,plain,
( ~ strictorderedP(cons(sK4,nil))
| ~ spl17_4 ),
inference(superposition,[],[f264,f294]) ).
fof(f294,plain,
( sK2 = cons(sK4,nil)
| ~ spl17_4 ),
inference(avatar_component_clause,[],[f292]) ).
fof(f292,plain,
( spl17_4
<=> sK2 = cons(sK4,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl17_4])]) ).
fof(f264,plain,
~ strictorderedP(sK2),
inference(definition_unfolding,[],[f190,f189]) ).
fof(f189,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f152]) ).
fof(f152,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) ) )
& ~ strictorderedP(sK0)
& sK0 = sK2
& sK1 = sK3
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f98,f151,f150,f149,f148,f147]) ).
fof(f147,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) ) )
& ~ strictorderedP(X0)
& 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) ) )
& ~ strictorderedP(sK0)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f148,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) ) )
& ~ strictorderedP(sK0)
& 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) ) )
& ~ strictorderedP(sK0)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f149,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) ) )
& ~ strictorderedP(sK0)
& 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) ) )
& ~ strictorderedP(sK0)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f150,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) ) )
& ~ strictorderedP(sK0)
& 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) ) )
& ~ strictorderedP(sK0)
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f151,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(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) ) )
& ~ strictorderedP(X0)
& 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] :
( ( ( 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) ) )
| strictorderedP(X0)
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(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) ) )
| strictorderedP(X0)
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.xj4w3MHoVV/Vampire---4.8_12657',co1) ).
fof(f190,plain,
~ strictorderedP(sK0),
inference(cnf_transformation,[],[f152]) ).
fof(f312,plain,
~ spl17_2,
inference(avatar_contradiction_clause,[],[f311]) ).
fof(f311,plain,
( $false
| ~ spl17_2 ),
inference(subsumption_resolution,[],[f309,f230]) ).
fof(f230,plain,
strictorderedP(nil),
inference(cnf_transformation,[],[f69]) ).
fof(f69,axiom,
strictorderedP(nil),
file('/export/starexec/sandbox/tmp/tmp.xj4w3MHoVV/Vampire---4.8_12657',ax69) ).
fof(f309,plain,
( ~ strictorderedP(nil)
| ~ spl17_2 ),
inference(superposition,[],[f264,f284]) ).
fof(f284,plain,
( nil = sK2
| ~ spl17_2 ),
inference(avatar_component_clause,[],[f282]) ).
fof(f282,plain,
( spl17_2
<=> nil = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl17_2])]) ).
fof(f300,plain,
( spl17_5
| spl17_2 ),
inference(avatar_split_clause,[],[f195,f282,f297]) ).
fof(f195,plain,
( nil = sK2
| ssItem(sK4) ),
inference(cnf_transformation,[],[f152]) ).
fof(f295,plain,
( spl17_4
| spl17_2 ),
inference(avatar_split_clause,[],[f196,f282,f292]) ).
fof(f196,plain,
( nil = sK2
| sK2 = cons(sK4,nil) ),
inference(cnf_transformation,[],[f152]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWC286+1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.12 % 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.11/0.32 % Computer : n005.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Apr 30 18:14:41 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.11/0.32 This is a FOF_THM_RFO_SEQ problem
% 0.11/0.33 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.xj4w3MHoVV/Vampire---4.8_12657
% 0.55/0.76 % (12786)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.55/0.76 % (12784)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.55/0.76 % (12787)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.55/0.76 % (12785)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.55/0.76 % (12782)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.55/0.76 % (12783)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.55/0.76 % (12788)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.55/0.76 % (12789)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.55/0.76 % (12789)Refutation not found, incomplete strategy% (12789)------------------------------
% 0.55/0.76 % (12789)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.55/0.76 % (12789)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.76
% 0.55/0.76 % (12789)Memory used [KB]: 1170
% 0.55/0.76 % (12789)Time elapsed: 0.004 s
% 0.55/0.76 % (12789)Instructions burned: 7 (million)
% 0.55/0.76 % (12789)------------------------------
% 0.55/0.76 % (12789)------------------------------
% 0.55/0.76 % (12787)First to succeed.
% 0.55/0.76 % (12785)Also succeeded, but the first one will report.
% 0.55/0.76 % (12787)Refutation found. Thanks to Tanya!
% 0.55/0.76 % SZS status Theorem for Vampire---4
% 0.55/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.55/0.77 % (12787)------------------------------
% 0.55/0.77 % (12787)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.55/0.77 % (12787)Termination reason: Refutation
% 0.55/0.77
% 0.55/0.77 % (12787)Memory used [KB]: 1184
% 0.55/0.77 % (12787)Time elapsed: 0.006 s
% 0.55/0.77 % (12787)Instructions burned: 9 (million)
% 0.55/0.77 % (12787)------------------------------
% 0.55/0.77 % (12787)------------------------------
% 0.55/0.77 % (12774)Success in time 0.437 s
% 0.55/0.77 % Vampire---4.8 exiting
%------------------------------------------------------------------------------