TSTP Solution File: SWC023+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC023+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 : n019.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:38 EDT 2024
% Result : Theorem 0.57s 0.79s
% Output : Refutation 0.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 13
% Syntax : Number of formulae : 53 ( 9 unt; 0 def)
% Number of atoms : 335 ( 69 equ)
% Maximal formula atoms : 34 ( 6 avg)
% Number of connectives : 406 ( 124 ~; 114 |; 139 &)
% ( 7 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 6 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 76 ( 38 !; 38 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f272,plain,
$false,
inference(avatar_sat_refutation,[],[f191,f192,f193,f194,f214,f271]) ).
fof(f271,plain,
( ~ spl6_1
| ~ spl6_3
| ~ spl6_4
| ~ spl6_5 ),
inference(avatar_contradiction_clause,[],[f270]) ).
fof(f270,plain,
( $false
| ~ spl6_1
| ~ spl6_3
| ~ spl6_4
| ~ spl6_5 ),
inference(subsumption_resolution,[],[f269,f185]) ).
fof(f185,plain,
( ssList(sK4)
| ~ spl6_5 ),
inference(avatar_component_clause,[],[f183]) ).
fof(f183,plain,
( spl6_5
<=> ssList(sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_5])]) ).
fof(f269,plain,
( ~ ssList(sK4)
| ~ spl6_1
| ~ spl6_3
| ~ spl6_4 ),
inference(subsumption_resolution,[],[f268,f166]) ).
fof(f166,plain,
( frontsegP(sK2,sK4)
| ~ spl6_1 ),
inference(avatar_component_clause,[],[f164]) ).
fof(f164,plain,
( spl6_1
<=> frontsegP(sK2,sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_1])]) ).
fof(f268,plain,
( ~ frontsegP(sK2,sK4)
| ~ ssList(sK4)
| ~ spl6_3
| ~ spl6_4 ),
inference(subsumption_resolution,[],[f258,f175]) ).
fof(f175,plain,
( frontsegP(sK3,sK4)
| ~ spl6_3 ),
inference(avatar_component_clause,[],[f173]) ).
fof(f173,plain,
( spl6_3
<=> frontsegP(sK3,sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_3])]) ).
fof(f258,plain,
( ~ frontsegP(sK3,sK4)
| ~ frontsegP(sK2,sK4)
| ~ ssList(sK4)
| ~ spl6_4 ),
inference(resolution,[],[f155,f180]) ).
fof(f180,plain,
( neq(sK4,nil)
| ~ spl6_4 ),
inference(avatar_component_clause,[],[f178]) ).
fof(f178,plain,
( spl6_4
<=> neq(sK4,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_4])]) ).
fof(f155,plain,
! [X5] :
( ~ neq(X5,nil)
| ~ frontsegP(sK3,X5)
| ~ frontsegP(sK2,X5)
| ~ ssList(X5) ),
inference(definition_unfolding,[],[f133,f131,f130]) ).
fof(f130,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f119]) ).
fof(f119,plain,
( ( ( nil = sK2
& nil = sK3 )
| ( frontsegP(sK2,sK4)
& frontsegP(sK3,sK4)
& neq(sK4,nil)
& ssList(sK4) ) )
& ! [X5] :
( ~ frontsegP(sK0,X5)
| ~ frontsegP(sK1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& 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])],[f102,f118,f117,f116,f115,f114]) ).
fof(f114,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( frontsegP(X2,X4)
& frontsegP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ! [X5] :
( ~ frontsegP(X0,X5)
| ~ frontsegP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( frontsegP(X2,X4)
& frontsegP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ! [X5] :
( ~ frontsegP(sK0,X5)
| ~ frontsegP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(X1,nil)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f115,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( frontsegP(X2,X4)
& frontsegP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ! [X5] :
( ~ frontsegP(sK0,X5)
| ~ frontsegP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(X1,nil)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( frontsegP(X2,X4)
& frontsegP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ! [X5] :
( ~ frontsegP(sK0,X5)
| ~ frontsegP(sK1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(sK1,nil)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f116,plain,
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( frontsegP(X2,X4)
& frontsegP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ! [X5] :
( ~ frontsegP(sK0,X5)
| ~ frontsegP(sK1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(sK1,nil)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( nil = sK2
& nil = X3 )
| ? [X4] :
( frontsegP(sK2,X4)
& frontsegP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ! [X5] :
( ~ frontsegP(sK0,X5)
| ~ frontsegP(sK1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(sK1,nil)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f117,plain,
( ? [X3] :
( ( ( nil = sK2
& nil = X3 )
| ? [X4] :
( frontsegP(sK2,X4)
& frontsegP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ! [X5] :
( ~ frontsegP(sK0,X5)
| ~ frontsegP(sK1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(sK1,nil)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( ( nil = sK2
& nil = sK3 )
| ? [X4] :
( frontsegP(sK2,X4)
& frontsegP(sK3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ! [X5] :
( ~ frontsegP(sK0,X5)
| ~ frontsegP(sK1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(sK1,nil)
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f118,plain,
( ? [X4] :
( frontsegP(sK2,X4)
& frontsegP(sK3,X4)
& neq(X4,nil)
& ssList(X4) )
=> ( frontsegP(sK2,sK4)
& frontsegP(sK3,sK4)
& neq(sK4,nil)
& ssList(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f102,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( frontsegP(X2,X4)
& frontsegP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ! [X5] :
( ~ frontsegP(X0,X5)
| ~ frontsegP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f101]) ).
fof(f101,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( frontsegP(X2,X4)
& frontsegP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ! [X5] :
( ~ frontsegP(X0,X5)
| ~ frontsegP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(X1,nil)
& 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] :
( ssList(X4)
=> ( ~ frontsegP(X2,X4)
| ~ frontsegP(X3,X4)
| ~ neq(X4,nil) ) ) )
| ? [X5] :
( frontsegP(X0,X5)
& frontsegP(X1,X5)
& neq(X5,nil)
& ssList(X5) )
| ~ neq(X1,nil)
| 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 )
& ! [X5] :
( ssList(X5)
=> ( ~ frontsegP(X2,X5)
| ~ frontsegP(X3,X5)
| ~ neq(X5,nil) ) ) )
| ? [X4] :
( frontsegP(X0,X4)
& frontsegP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ 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 )
& ! [X5] :
( ssList(X5)
=> ( ~ frontsegP(X2,X5)
| ~ frontsegP(X3,X5)
| ~ neq(X5,nil) ) ) )
| ? [X4] :
( frontsegP(X0,X4)
& frontsegP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f131,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f119]) ).
fof(f133,plain,
! [X5] :
( ~ frontsegP(sK0,X5)
| ~ frontsegP(sK1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) ),
inference(cnf_transformation,[],[f119]) ).
fof(f214,plain,
~ spl6_6,
inference(avatar_contradiction_clause,[],[f213]) ).
fof(f213,plain,
( $false
| ~ spl6_6 ),
inference(subsumption_resolution,[],[f207,f197]) ).
fof(f197,plain,
( neq(nil,nil)
| ~ spl6_6 ),
inference(backward_demodulation,[],[f156,f190]) ).
fof(f190,plain,
( nil = sK3
| ~ spl6_6 ),
inference(avatar_component_clause,[],[f188]) ).
fof(f188,plain,
( spl6_6
<=> nil = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl6_6])]) ).
fof(f156,plain,
neq(sK3,nil),
inference(definition_unfolding,[],[f132,f130]) ).
fof(f132,plain,
neq(sK1,nil),
inference(cnf_transformation,[],[f119]) ).
fof(f207,plain,
~ neq(nil,nil),
inference(resolution,[],[f162,f144]) ).
fof(f144,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f162,plain,
! [X1] :
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(duplicate_literal_removal,[],[f159]) ).
fof(f159,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f142]) ).
fof(f142,plain,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f120]) ).
fof(f120,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f103]) ).
fof(f103,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(f194,plain,
( spl6_5
| spl6_6 ),
inference(avatar_split_clause,[],[f134,f188,f183]) ).
fof(f134,plain,
( nil = sK3
| ssList(sK4) ),
inference(cnf_transformation,[],[f119]) ).
fof(f193,plain,
( spl6_4
| spl6_6 ),
inference(avatar_split_clause,[],[f135,f188,f178]) ).
fof(f135,plain,
( nil = sK3
| neq(sK4,nil) ),
inference(cnf_transformation,[],[f119]) ).
fof(f192,plain,
( spl6_3
| spl6_6 ),
inference(avatar_split_clause,[],[f136,f188,f173]) ).
fof(f136,plain,
( nil = sK3
| frontsegP(sK3,sK4) ),
inference(cnf_transformation,[],[f119]) ).
fof(f191,plain,
( spl6_1
| spl6_6 ),
inference(avatar_split_clause,[],[f137,f188,f164]) ).
fof(f137,plain,
( nil = sK3
| frontsegP(sK2,sK4) ),
inference(cnf_transformation,[],[f119]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWC023+1 : TPTP v8.2.0. Released v2.4.0.
% 0.10/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.13/0.35 % Computer : n019.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 03:08:53 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.13/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.57/0.79 % (15436)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.57/0.79 % (15438)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.57/0.79 % (15439)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.57/0.79 % (15440)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.57/0.79 % (15441)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.57/0.79 % (15442)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.57/0.79 % (15443)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.57/0.79 % (15437)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.57/0.79 % (15439)First to succeed.
% 0.57/0.79 % (15438)Also succeeded, but the first one will report.
% 0.57/0.79 % (15441)Also succeeded, but the first one will report.
% 0.57/0.79 % (15439)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-15435"
% 0.57/0.79 % (15439)Refutation found. Thanks to Tanya!
% 0.57/0.79 % SZS status Theorem for theBenchmark
% 0.57/0.79 % SZS output start Proof for theBenchmark
% See solution above
% 0.63/0.79 % (15439)------------------------------
% 0.63/0.79 % (15439)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.63/0.79 % (15439)Termination reason: Refutation
% 0.63/0.79
% 0.63/0.79 % (15439)Memory used [KB]: 1179
% 0.63/0.79 % (15439)Time elapsed: 0.005 s
% 0.63/0.79 % (15439)Instructions burned: 7 (million)
% 0.63/0.79 % (15435)Success in time 0.429 s
% 0.63/0.79 % Vampire---4.8 exiting
%------------------------------------------------------------------------------