TSTP Solution File: SWC206+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC206+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 : n020.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:25 EDT 2024
% Result : Theorem 0.61s 0.76s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 17
% Syntax : Number of formulae : 68 ( 13 unt; 0 def)
% Number of atoms : 338 ( 75 equ)
% Maximal formula atoms : 30 ( 4 avg)
% Number of connectives : 394 ( 124 ~; 108 |; 132 &)
% ( 9 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 8 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 64 ( 29 !; 35 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f307,plain,
$false,
inference(avatar_sat_refutation,[],[f224,f234,f239,f249,f263,f277,f296,f305]) ).
fof(f305,plain,
( ~ spl11_4
| ~ spl11_6
| ~ spl11_10 ),
inference(avatar_contradiction_clause,[],[f304]) ).
fof(f304,plain,
( $false
| ~ spl11_4
| ~ spl11_6
| ~ spl11_10 ),
inference(subsumption_resolution,[],[f300,f291]) ).
fof(f291,plain,
( ~ neq(nil,nil)
| ~ spl11_6 ),
inference(superposition,[],[f203,f243]) ).
fof(f243,plain,
( nil = sK2
| ~ spl11_6 ),
inference(avatar_component_clause,[],[f241]) ).
fof(f241,plain,
( spl11_6
<=> nil = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl11_6])]) ).
fof(f203,plain,
~ neq(sK2,nil),
inference(definition_unfolding,[],[f159,f157]) ).
fof(f157,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f135]) ).
fof(f135,plain,
( ( ~ neq(sK3,nil)
| ( segmentP(sK2,sK4)
& segmentP(sK3,sK4)
& neq(sK4,nil)
& ssList(sK4) ) )
& ( nil != sK3
| nil = sK2 )
& ~ 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,f134,f133,f132,f131,f130]) ).
fof(f130,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( segmentP(X2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ( nil != X3
| nil = X2 )
& ~ neq(X0,nil)
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( segmentP(X2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ( nil != X3
| nil = X2 )
& ~ neq(sK0,nil)
& neq(X1,nil)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f131,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( segmentP(X2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ( nil != X3
| nil = X2 )
& ~ neq(sK0,nil)
& neq(X1,nil)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( segmentP(X2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ( nil != X3
| nil = X2 )
& ~ neq(sK0,nil)
& neq(sK1,nil)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f132,plain,
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( segmentP(X2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ( nil != X3
| nil = X2 )
& ~ neq(sK0,nil)
& neq(sK1,nil)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( segmentP(sK2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ( nil != X3
| nil = sK2 )
& ~ neq(sK0,nil)
& neq(sK1,nil)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f133,plain,
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( segmentP(sK2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ( nil != X3
| nil = sK2 )
& ~ neq(sK0,nil)
& neq(sK1,nil)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( ~ neq(sK3,nil)
| ? [X4] :
( segmentP(sK2,X4)
& segmentP(sK3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ( nil != sK3
| nil = sK2 )
& ~ neq(sK0,nil)
& neq(sK1,nil)
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f134,plain,
( ? [X4] :
( segmentP(sK2,X4)
& segmentP(sK3,X4)
& neq(X4,nil)
& ssList(X4) )
=> ( segmentP(sK2,sK4)
& segmentP(sK3,sK4)
& neq(sK4,nil)
& ssList(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( segmentP(X2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ( nil != X3
| nil = X2 )
& ~ 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] :
( ( ~ neq(X3,nil)
| ? [X4] :
( segmentP(X2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ( nil != X3
| nil = X2 )
& ~ 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)
=> ( ( neq(X3,nil)
& ! [X4] :
( ssList(X4)
=> ( ~ segmentP(X2,X4)
| ~ segmentP(X3,X4)
| ~ neq(X4,nil) ) ) )
| ( nil = X3
& 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)
=> ( ( neq(X3,nil)
& ! [X4] :
( ssList(X4)
=> ( ~ segmentP(X2,X4)
| ~ segmentP(X3,X4)
| ~ neq(X4,nil) ) ) )
| ( nil = X3
& nil != X2 )
| neq(X0,nil)
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.CfMLZTkd77/Vampire---4.8_19221',co1) ).
fof(f159,plain,
~ neq(sK0,nil),
inference(cnf_transformation,[],[f135]) ).
fof(f300,plain,
( neq(nil,nil)
| ~ spl11_4
| ~ spl11_10 ),
inference(superposition,[],[f233,f272]) ).
fof(f272,plain,
( nil = sK4
| ~ spl11_10 ),
inference(avatar_component_clause,[],[f270]) ).
fof(f270,plain,
( spl11_10
<=> nil = sK4 ),
introduced(avatar_definition,[new_symbols(naming,[spl11_10])]) ).
fof(f233,plain,
( neq(sK4,nil)
| ~ spl11_4 ),
inference(avatar_component_clause,[],[f231]) ).
fof(f231,plain,
( spl11_4
<=> neq(sK4,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_4])]) ).
fof(f296,plain,
( ~ spl11_5
| spl11_11 ),
inference(avatar_contradiction_clause,[],[f295]) ).
fof(f295,plain,
( $false
| ~ spl11_5
| spl11_11 ),
inference(subsumption_resolution,[],[f293,f238]) ).
fof(f238,plain,
( ssList(sK4)
| ~ spl11_5 ),
inference(avatar_component_clause,[],[f236]) ).
fof(f236,plain,
( spl11_5
<=> ssList(sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_5])]) ).
fof(f293,plain,
( ~ ssList(sK4)
| spl11_11 ),
inference(resolution,[],[f276,f172]) ).
fof(f172,plain,
! [X0] :
( segmentP(X0,nil)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f103]) ).
fof(f103,plain,
! [X0] :
( segmentP(X0,nil)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f57]) ).
fof(f57,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.CfMLZTkd77/Vampire---4.8_19221',ax57) ).
fof(f276,plain,
( ~ segmentP(sK4,nil)
| spl11_11 ),
inference(avatar_component_clause,[],[f274]) ).
fof(f274,plain,
( spl11_11
<=> segmentP(sK4,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_11])]) ).
fof(f277,plain,
( spl11_10
| ~ spl11_11
| ~ spl11_1
| ~ spl11_5
| ~ spl11_6 ),
inference(avatar_split_clause,[],[f268,f241,f236,f217,f274,f270]) ).
fof(f217,plain,
( spl11_1
<=> segmentP(sK2,sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_1])]) ).
fof(f268,plain,
( ~ segmentP(sK4,nil)
| nil = sK4
| ~ spl11_1
| ~ spl11_5
| ~ spl11_6 ),
inference(forward_demodulation,[],[f267,f243]) ).
fof(f267,plain,
( nil = sK4
| ~ segmentP(sK4,sK2)
| ~ spl11_1
| ~ spl11_5
| ~ spl11_6 ),
inference(forward_demodulation,[],[f266,f243]) ).
fof(f266,plain,
( sK2 = sK4
| ~ segmentP(sK4,sK2)
| ~ spl11_1
| ~ spl11_5 ),
inference(subsumption_resolution,[],[f265,f238]) ).
fof(f265,plain,
( sK2 = sK4
| ~ segmentP(sK4,sK2)
| ~ ssList(sK4)
| ~ spl11_1 ),
inference(subsumption_resolution,[],[f264,f154]) ).
fof(f154,plain,
ssList(sK2),
inference(cnf_transformation,[],[f135]) ).
fof(f264,plain,
( sK2 = sK4
| ~ segmentP(sK4,sK2)
| ~ ssList(sK2)
| ~ ssList(sK4)
| ~ spl11_1 ),
inference(resolution,[],[f219,f175]) ).
fof(f175,plain,
! [X0,X1] :
( ~ segmentP(X1,X0)
| X0 = X1
| ~ segmentP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f108]) ).
fof(f108,plain,
! [X0] :
( ! [X1] :
( X0 = X1
| ~ segmentP(X1,X0)
| ~ segmentP(X0,X1)
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f107]) ).
fof(f107,plain,
! [X0] :
( ! [X1] :
( X0 = X1
| ~ segmentP(X1,X0)
| ~ segmentP(X0,X1)
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f54]) ).
fof(f54,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( ( segmentP(X1,X0)
& segmentP(X0,X1) )
=> X0 = X1 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.CfMLZTkd77/Vampire---4.8_19221',ax54) ).
fof(f219,plain,
( segmentP(sK2,sK4)
| ~ spl11_1 ),
inference(avatar_component_clause,[],[f217]) ).
fof(f263,plain,
spl11_6,
inference(avatar_split_clause,[],[f262,f241]) ).
fof(f262,plain,
nil = sK2,
inference(subsumption_resolution,[],[f261,f154]) ).
fof(f261,plain,
( nil = sK2
| ~ ssList(sK2) ),
inference(subsumption_resolution,[],[f251,f169]) ).
fof(f169,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.CfMLZTkd77/Vampire---4.8_19221',ax17) ).
fof(f251,plain,
( nil = sK2
| ~ ssList(nil)
| ~ ssList(sK2) ),
inference(resolution,[],[f203,f166]) ).
fof(f166,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f136]) ).
fof(f136,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f100]) ).
fof(f100,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.CfMLZTkd77/Vampire---4.8_19221',ax15) ).
fof(f249,plain,
spl11_2,
inference(avatar_split_clause,[],[f204,f221]) ).
fof(f221,plain,
( spl11_2
<=> neq(sK3,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_2])]) ).
fof(f204,plain,
neq(sK3,nil),
inference(definition_unfolding,[],[f158,f156]) ).
fof(f156,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f135]) ).
fof(f158,plain,
neq(sK1,nil),
inference(cnf_transformation,[],[f135]) ).
fof(f239,plain,
( spl11_5
| ~ spl11_2 ),
inference(avatar_split_clause,[],[f161,f221,f236]) ).
fof(f161,plain,
( ~ neq(sK3,nil)
| ssList(sK4) ),
inference(cnf_transformation,[],[f135]) ).
fof(f234,plain,
( spl11_4
| ~ spl11_2 ),
inference(avatar_split_clause,[],[f162,f221,f231]) ).
fof(f162,plain,
( ~ neq(sK3,nil)
| neq(sK4,nil) ),
inference(cnf_transformation,[],[f135]) ).
fof(f224,plain,
( spl11_1
| ~ spl11_2 ),
inference(avatar_split_clause,[],[f164,f221,f217]) ).
fof(f164,plain,
( ~ neq(sK3,nil)
| segmentP(sK2,sK4) ),
inference(cnf_transformation,[],[f135]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC206+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.15 % 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.16/0.36 % Computer : n020.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Fri May 3 20:26:23 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.16/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.16/0.36 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.CfMLZTkd77/Vampire---4.8_19221
% 0.55/0.75 % (19426)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.55/0.75 % (19428)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 (2996ds/56Mi)
% 0.55/0.75 % (19421)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.55/0.75 % (19423)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.55/0.75 % (19424)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.55/0.75 % (19422)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.55/0.75 % (19425)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.55/0.76 % (19427)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.61/0.76 % (19426)First to succeed.
% 0.61/0.76 % (19426)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-19388"
% 0.61/0.76 % (19426)Refutation found. Thanks to Tanya!
% 0.61/0.76 % SZS status Theorem for Vampire---4
% 0.61/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.76 % (19426)------------------------------
% 0.61/0.76 % (19426)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.76 % (19426)Termination reason: Refutation
% 0.61/0.76
% 0.61/0.76 % (19426)Memory used [KB]: 1174
% 0.61/0.76 % (19426)Time elapsed: 0.004 s
% 0.61/0.76 % (19426)Instructions burned: 8 (million)
% 0.61/0.76 % (19388)Success in time 0.385 s
% 0.61/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------