TSTP Solution File: SWC037+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC037+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/sandbox2/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:45 EDT 2024
% Result : Theorem 0.42s 0.59s
% Output : Refutation 0.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 12
% Syntax : Number of formulae : 51 ( 10 unt; 0 def)
% Number of atoms : 274 ( 103 equ)
% Maximal formula atoms : 28 ( 5 avg)
% Number of connectives : 294 ( 71 ~; 67 |; 130 &)
% ( 8 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 5 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 60 ( 25 !; 35 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f222,plain,
$false,
inference(avatar_sat_refutation,[],[f188,f193,f198,f199,f221]) ).
fof(f221,plain,
( ~ spl7_3
| ~ spl7_4
| ~ spl7_5 ),
inference(avatar_contradiction_clause,[],[f220]) ).
fof(f220,plain,
( $false
| ~ spl7_3
| ~ spl7_4
| ~ spl7_5 ),
inference(subsumption_resolution,[],[f215,f208]) ).
fof(f208,plain,
~ neq(sK3,sK3),
inference(unit_resulting_resolution,[],[f128,f174]) ).
fof(f174,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f171]) ).
fof(f171,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f141]) ).
fof(f141,plain,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f118]) ).
fof(f118,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f101]) ).
fof(f101,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/benchmark/theBenchmark.p',ax15) ).
fof(f128,plain,
ssList(sK3),
inference(cnf_transformation,[],[f117]) ).
fof(f117,plain,
( ( ( nil = sK2
& nil = sK3 )
| ( segmentP(sK2,sK4)
& segmentP(sK3,sK4)
& neq(sK4,nil)
& ssList(sK4) ) )
& nil != sK0
& sK0 = sK2
& sK1 = sK3
& nil = sK1
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f100,f116,f115,f114,f113,f112]) ).
fof(f112,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( segmentP(X2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& nil != X0
& X0 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( segmentP(X2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& nil != sK0
& sK0 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f113,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( segmentP(X2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& nil != sK0
& sK0 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( segmentP(X2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& nil != sK0
& sK0 = X2
& sK1 = X3
& nil = sK1
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f114,plain,
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( segmentP(X2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& nil != sK0
& sK0 = X2
& sK1 = X3
& nil = sK1
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( nil = sK2
& nil = X3 )
| ? [X4] :
( segmentP(sK2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& nil != sK0
& sK0 = sK2
& sK1 = X3
& nil = sK1
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f115,plain,
( ? [X3] :
( ( ( nil = sK2
& nil = X3 )
| ? [X4] :
( segmentP(sK2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& nil != sK0
& sK0 = sK2
& sK1 = X3
& nil = sK1
& ssList(X3) )
=> ( ( ( nil = sK2
& nil = sK3 )
| ? [X4] :
( segmentP(sK2,X4)
& segmentP(sK3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& nil != sK0
& sK0 = sK2
& sK1 = sK3
& nil = sK1
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f116,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(f100,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( segmentP(X2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& nil != X0
& X0 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f99]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( segmentP(X2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& nil != X0
& X0 = X2
& X1 = X3
& nil = X1
& 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] :
( ssList(X4)
=> ( ~ segmentP(X2,X4)
| ~ segmentP(X3,X4)
| ~ neq(X4,nil) ) ) )
| nil = X0
| X0 != X2
| X1 != X3
| nil != X1 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssList(X4)
=> ( ~ segmentP(X2,X4)
| ~ segmentP(X3,X4)
| ~ neq(X4,nil) ) ) )
| nil = X0
| X0 != X2
| X1 != X3
| nil != X1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f215,plain,
( neq(sK3,sK3)
| ~ spl7_3
| ~ spl7_4
| ~ spl7_5 ),
inference(backward_demodulation,[],[f192,f210]) ).
fof(f210,plain,
( sK3 = sK4
| ~ spl7_3
| ~ spl7_5 ),
inference(unit_resulting_resolution,[],[f197,f187,f169]) ).
fof(f169,plain,
! [X0] :
( sK3 = X0
| ~ segmentP(sK3,X0)
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f144,f155,f155]) ).
fof(f155,plain,
nil = sK3,
inference(definition_unfolding,[],[f129,f130]) ).
fof(f130,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f117]) ).
fof(f129,plain,
nil = sK1,
inference(cnf_transformation,[],[f117]) ).
fof(f144,plain,
! [X0] :
( nil = X0
| ~ segmentP(nil,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f119]) ).
fof(f119,plain,
! [X0] :
( ( ( segmentP(nil,X0)
| nil != X0 )
& ( nil = X0
| ~ segmentP(nil,X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f102]) ).
fof(f102,plain,
! [X0] :
( ( segmentP(nil,X0)
<=> nil = X0 )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f58]) ).
fof(f58,axiom,
! [X0] :
( ssList(X0)
=> ( segmentP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax58) ).
fof(f187,plain,
( segmentP(sK3,sK4)
| ~ spl7_3 ),
inference(avatar_component_clause,[],[f185]) ).
fof(f185,plain,
( spl7_3
<=> segmentP(sK3,sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_3])]) ).
fof(f197,plain,
( ssList(sK4)
| ~ spl7_5 ),
inference(avatar_component_clause,[],[f195]) ).
fof(f195,plain,
( spl7_5
<=> ssList(sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_5])]) ).
fof(f192,plain,
( neq(sK4,sK3)
| ~ spl7_4 ),
inference(avatar_component_clause,[],[f190]) ).
fof(f190,plain,
( spl7_4
<=> neq(sK4,sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_4])]) ).
fof(f199,plain,
~ spl7_2,
inference(avatar_split_clause,[],[f164,f180]) ).
fof(f180,plain,
( spl7_2
<=> sK2 = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl7_2])]) ).
fof(f164,plain,
sK2 != sK3,
inference(definition_unfolding,[],[f132,f155,f131]) ).
fof(f131,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f117]) ).
fof(f132,plain,
nil != sK0,
inference(cnf_transformation,[],[f117]) ).
fof(f198,plain,
( spl7_5
| spl7_2 ),
inference(avatar_split_clause,[],[f159,f180,f195]) ).
fof(f159,plain,
( sK2 = sK3
| ssList(sK4) ),
inference(definition_unfolding,[],[f137,f155]) ).
fof(f137,plain,
( nil = sK2
| ssList(sK4) ),
inference(cnf_transformation,[],[f117]) ).
fof(f193,plain,
( spl7_4
| spl7_2 ),
inference(avatar_split_clause,[],[f158,f180,f190]) ).
fof(f158,plain,
( sK2 = sK3
| neq(sK4,sK3) ),
inference(definition_unfolding,[],[f138,f155,f155]) ).
fof(f138,plain,
( nil = sK2
| neq(sK4,nil) ),
inference(cnf_transformation,[],[f117]) ).
fof(f188,plain,
( spl7_3
| spl7_2 ),
inference(avatar_split_clause,[],[f157,f180,f185]) ).
fof(f157,plain,
( sK2 = sK3
| segmentP(sK3,sK4) ),
inference(definition_unfolding,[],[f139,f155]) ).
fof(f139,plain,
( nil = sK2
| segmentP(sK3,sK4) ),
inference(cnf_transformation,[],[f117]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWC037+1 : TPTP v8.2.0. Released v2.4.0.
% 0.03/0.13 % 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.13/0.34 % Computer : n019.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 02:40:23 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.34 This is a FOF_THM_RFO_SEQ problem
% 0.13/0.34 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/benchmark/theBenchmark.p
% 0.42/0.59 % (16592)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 (2997ds/56Mi)
% 0.42/0.59 % (16585)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 (2997ds/34Mi)
% 0.42/0.59 % (16587)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2997ds/78Mi)
% 0.42/0.59 % (16586)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 (2997ds/51Mi)
% 0.42/0.59 % (16588)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2997ds/33Mi)
% 0.42/0.59 % (16589)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 (2997ds/34Mi)
% 0.42/0.59 % (16590)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2997ds/45Mi)
% 0.42/0.59 % (16591)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 (2997ds/83Mi)
% 0.42/0.59 % (16588)First to succeed.
% 0.42/0.59 % (16590)Also succeeded, but the first one will report.
% 0.42/0.59 % (16588)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-16584"
% 0.42/0.59 % (16588)Refutation found. Thanks to Tanya!
% 0.42/0.59 % SZS status Theorem for theBenchmark
% 0.42/0.59 % SZS output start Proof for theBenchmark
% See solution above
% 0.42/0.60 % (16588)------------------------------
% 0.42/0.60 % (16588)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.42/0.60 % (16588)Termination reason: Refutation
% 0.42/0.60
% 0.42/0.60 % (16588)Memory used [KB]: 1169
% 0.42/0.60 % (16588)Time elapsed: 0.005 s
% 0.42/0.60 % (16588)Instructions burned: 6 (million)
% 0.42/0.60 % (16584)Success in time 0.246 s
% 0.42/0.60 % Vampire---4.8 exiting
%------------------------------------------------------------------------------