TSTP Solution File: SWC105+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC105+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% Computer : n016.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 Aug 31 18:38:50 EDT 2022
% Result : Theorem 0.20s 0.50s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 15
% Syntax : Number of formulae : 71 ( 5 unt; 0 def)
% Number of atoms : 331 ( 109 equ)
% Maximal formula atoms : 30 ( 4 avg)
% Number of connectives : 377 ( 117 ~; 116 |; 117 &)
% ( 12 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 9 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 46 ( 22 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f252,plain,
$false,
inference(avatar_sat_refutation,[],[f171,f180,f185,f195,f202,f206,f215,f231,f238,f243,f247]) ).
fof(f247,plain,
( spl5_3
| ~ spl5_9 ),
inference(avatar_split_clause,[],[f246,f199,f164]) ).
fof(f164,plain,
( spl5_3
<=> rearsegP(sK1,sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_3])]) ).
fof(f199,plain,
( spl5_9
<=> rearsegP(sK3,sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_9])]) ).
fof(f246,plain,
( rearsegP(sK1,sK0)
| ~ spl5_9 ),
inference(forward_demodulation,[],[f201,f140]) ).
fof(f140,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f117]) ).
fof(f117,plain,
( ssList(sK0)
& ssList(sK1)
& sK1 = sK3
& sK2 = sK0
& ( ( neq(sK2,nil)
& rearsegP(sK3,sK2) )
| ( nil = sK2
& nil = sK3 ) )
& ( ( nil = sK1
& nil != sK0 )
| ( ( ~ rearsegP(sK1,sK0)
| ~ neq(sK0,nil) )
& neq(sK1,nil) ) )
& ssList(sK3)
& ssList(sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f106,f116,f115,f114,f113]) ).
fof(f113,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( ( neq(X2,nil)
& rearsegP(X3,X2) )
| ( nil = X2
& nil = X3 ) )
& ( ( nil = X1
& nil != X0 )
| ( ( ~ rearsegP(X1,X0)
| ~ neq(X0,nil) )
& neq(X1,nil) ) )
& ssList(X3) )
& ssList(X2) ) ) )
=> ( ssList(sK0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( X1 = X3
& sK0 = X2
& ( ( neq(X2,nil)
& rearsegP(X3,X2) )
| ( nil = X2
& nil = X3 ) )
& ( ( nil = X1
& nil != sK0 )
| ( ( ~ rearsegP(X1,sK0)
| ~ neq(sK0,nil) )
& neq(X1,nil) ) )
& ssList(X3) )
& ssList(X2) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f114,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( X1 = X3
& sK0 = X2
& ( ( neq(X2,nil)
& rearsegP(X3,X2) )
| ( nil = X2
& nil = X3 ) )
& ( ( nil = X1
& nil != sK0 )
| ( ( ~ rearsegP(X1,sK0)
| ~ neq(sK0,nil) )
& neq(X1,nil) ) )
& ssList(X3) )
& ssList(X2) ) )
=> ( ssList(sK1)
& ? [X2] :
( ? [X3] :
( sK1 = X3
& sK0 = X2
& ( ( neq(X2,nil)
& rearsegP(X3,X2) )
| ( nil = X2
& nil = X3 ) )
& ( ( nil = sK1
& nil != sK0 )
| ( ( ~ rearsegP(sK1,sK0)
| ~ neq(sK0,nil) )
& neq(sK1,nil) ) )
& ssList(X3) )
& ssList(X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f115,plain,
( ? [X2] :
( ? [X3] :
( sK1 = X3
& sK0 = X2
& ( ( neq(X2,nil)
& rearsegP(X3,X2) )
| ( nil = X2
& nil = X3 ) )
& ( ( nil = sK1
& nil != sK0 )
| ( ( ~ rearsegP(sK1,sK0)
| ~ neq(sK0,nil) )
& neq(sK1,nil) ) )
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( sK1 = X3
& sK2 = sK0
& ( ( neq(sK2,nil)
& rearsegP(X3,sK2) )
| ( nil = sK2
& nil = X3 ) )
& ( ( nil = sK1
& nil != sK0 )
| ( ( ~ rearsegP(sK1,sK0)
| ~ neq(sK0,nil) )
& neq(sK1,nil) ) )
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f116,plain,
( ? [X3] :
( sK1 = X3
& sK2 = sK0
& ( ( neq(sK2,nil)
& rearsegP(X3,sK2) )
| ( nil = sK2
& nil = X3 ) )
& ( ( nil = sK1
& nil != sK0 )
| ( ( ~ rearsegP(sK1,sK0)
| ~ neq(sK0,nil) )
& neq(sK1,nil) ) )
& ssList(X3) )
=> ( sK1 = sK3
& sK2 = sK0
& ( ( neq(sK2,nil)
& rearsegP(sK3,sK2) )
| ( nil = sK2
& nil = sK3 ) )
& ( ( nil = sK1
& nil != sK0 )
| ( ( ~ rearsegP(sK1,sK0)
| ~ neq(sK0,nil) )
& neq(sK1,nil) ) )
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f106,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( ( neq(X2,nil)
& rearsegP(X3,X2) )
| ( nil = X2
& nil = X3 ) )
& ( ( nil = X1
& nil != X0 )
| ( ( ~ rearsegP(X1,X0)
| ~ neq(X0,nil) )
& neq(X1,nil) ) )
& ssList(X3) )
& ssList(X2) ) ) ),
inference(flattening,[],[f105]) ).
fof(f105,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X1
& nil != X0 )
| ( ( ~ rearsegP(X1,X0)
| ~ neq(X0,nil) )
& neq(X1,nil) ) )
& X0 = X2
& ( ( neq(X2,nil)
& rearsegP(X3,X2) )
| ( nil = X2
& nil = X3 ) )
& 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)
=> ( ( ( nil = X0
| nil != X1 )
& ( ( rearsegP(X1,X0)
& neq(X0,nil) )
| ~ neq(X1,nil) ) )
| X0 != X2
| ( ( nil != X3
| nil != X2 )
& ( ~ rearsegP(X3,X2)
| ~ neq(X2,nil) ) )
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( nil = X0
| nil != X1 )
& ( ( rearsegP(X1,X0)
& neq(X0,nil) )
| ~ neq(X1,nil) ) )
| X0 != X2
| ( ( nil != X3
| nil != X2 )
& ( ~ rearsegP(X3,X2)
| ~ neq(X2,nil) ) )
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f201,plain,
( rearsegP(sK3,sK0)
| ~ spl5_9 ),
inference(avatar_component_clause,[],[f199]) ).
fof(f243,plain,
( ~ spl5_5
| ~ spl5_7 ),
inference(avatar_contradiction_clause,[],[f242]) ).
fof(f242,plain,
( $false
| ~ spl5_5
| ~ spl5_7 ),
inference(subsumption_resolution,[],[f241,f222]) ).
fof(f222,plain,
( ~ neq(nil,nil)
| ~ spl5_7 ),
inference(backward_demodulation,[],[f210,f183]) ).
fof(f183,plain,
( nil = sK0
| ~ spl5_7 ),
inference(avatar_component_clause,[],[f182]) ).
fof(f182,plain,
( spl5_7
<=> nil = sK0 ),
introduced(avatar_definition,[new_symbols(naming,[spl5_7])]) ).
fof(f210,plain,
~ neq(sK0,sK0),
inference(unit_resulting_resolution,[],[f142,f153]) ).
fof(f153,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f150]) ).
fof(f150,plain,
! [X1] :
( ~ ssList(X1)
| ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(equality_resolution,[],[f127]) ).
fof(f127,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| X0 != X1
| ~ neq(X0,X1) ),
inference(cnf_transformation,[],[f112]) ).
fof(f112,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( X0 != X1
| ~ neq(X0,X1) )
& ( neq(X0,X1)
| X0 = X1 ) ) ) ),
inference(nnf_transformation,[],[f101]) ).
fof(f101,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( X0 != X1
<=> neq(X0,X1) ) ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( X0 != X1
<=> neq(X0,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax15) ).
fof(f142,plain,
ssList(sK0),
inference(cnf_transformation,[],[f117]) ).
fof(f241,plain,
( neq(nil,nil)
| ~ spl5_5
| ~ spl5_7 ),
inference(forward_demodulation,[],[f175,f216]) ).
fof(f216,plain,
( nil = sK2
| ~ spl5_7 ),
inference(backward_demodulation,[],[f139,f183]) ).
fof(f139,plain,
sK2 = sK0,
inference(cnf_transformation,[],[f117]) ).
fof(f175,plain,
( neq(sK2,nil)
| ~ spl5_5 ),
inference(avatar_component_clause,[],[f173]) ).
fof(f173,plain,
( spl5_5
<=> neq(sK2,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_5])]) ).
fof(f238,plain,
( ~ spl5_1
| ~ spl5_2
| ~ spl5_7 ),
inference(avatar_contradiction_clause,[],[f237]) ).
fof(f237,plain,
( $false
| ~ spl5_1
| ~ spl5_2
| ~ spl5_7 ),
inference(subsumption_resolution,[],[f235,f222]) ).
fof(f235,plain,
( neq(nil,nil)
| ~ spl5_1
| ~ spl5_2 ),
inference(backward_demodulation,[],[f157,f161]) ).
fof(f161,plain,
( nil = sK1
| ~ spl5_2 ),
inference(avatar_component_clause,[],[f159]) ).
fof(f159,plain,
( spl5_2
<=> nil = sK1 ),
introduced(avatar_definition,[new_symbols(naming,[spl5_2])]) ).
fof(f157,plain,
( neq(sK1,nil)
| ~ spl5_1 ),
inference(avatar_component_clause,[],[f155]) ).
fof(f155,plain,
( spl5_1
<=> neq(sK1,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_1])]) ).
fof(f231,plain,
( spl5_2
| ~ spl5_6 ),
inference(avatar_split_clause,[],[f230,f177,f159]) ).
fof(f177,plain,
( spl5_6
<=> nil = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl5_6])]) ).
fof(f230,plain,
( nil = sK1
| ~ spl5_6 ),
inference(forward_demodulation,[],[f140,f179]) ).
fof(f179,plain,
( nil = sK3
| ~ spl5_6 ),
inference(avatar_component_clause,[],[f177]) ).
fof(f215,plain,
( ~ spl5_6
| spl5_7
| ~ spl5_9 ),
inference(avatar_contradiction_clause,[],[f214]) ).
fof(f214,plain,
( $false
| ~ spl5_6
| spl5_7
| ~ spl5_9 ),
inference(subsumption_resolution,[],[f211,f207]) ).
fof(f207,plain,
( rearsegP(nil,sK0)
| ~ spl5_6
| ~ spl5_9 ),
inference(backward_demodulation,[],[f201,f179]) ).
fof(f211,plain,
( ~ rearsegP(nil,sK0)
| spl5_7 ),
inference(unit_resulting_resolution,[],[f142,f184,f143]) ).
fof(f143,plain,
! [X0] :
( ~ rearsegP(nil,X0)
| ~ ssList(X0)
| nil = X0 ),
inference(cnf_transformation,[],[f118]) ).
fof(f118,plain,
! [X0] :
( ( ( rearsegP(nil,X0)
| nil != X0 )
& ( nil = X0
| ~ rearsegP(nil,X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f111]) ).
fof(f111,plain,
! [X0] :
( ( rearsegP(nil,X0)
<=> nil = X0 )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f52]) ).
fof(f52,axiom,
! [X0] :
( ssList(X0)
=> ( rearsegP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax52) ).
fof(f184,plain,
( nil != sK0
| spl5_7 ),
inference(avatar_component_clause,[],[f182]) ).
fof(f206,plain,
( spl5_6
| ~ spl5_2 ),
inference(avatar_split_clause,[],[f205,f159,f177]) ).
fof(f205,plain,
( nil = sK3
| ~ spl5_2 ),
inference(backward_demodulation,[],[f140,f161]) ).
fof(f202,plain,
( spl5_9
| spl5_7 ),
inference(avatar_split_clause,[],[f197,f182,f199]) ).
fof(f197,plain,
( nil = sK0
| rearsegP(sK3,sK0) ),
inference(forward_demodulation,[],[f196,f139]) ).
fof(f196,plain,
( rearsegP(sK3,sK2)
| nil = sK0 ),
inference(forward_demodulation,[],[f136,f139]) ).
fof(f136,plain,
( nil = sK2
| rearsegP(sK3,sK2) ),
inference(cnf_transformation,[],[f117]) ).
fof(f195,plain,
( spl5_4
| spl5_7 ),
inference(avatar_split_clause,[],[f194,f182,f168]) ).
fof(f168,plain,
( spl5_4
<=> neq(sK0,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_4])]) ).
fof(f194,plain,
( nil = sK0
| neq(sK0,nil) ),
inference(forward_demodulation,[],[f193,f139]) ).
fof(f193,plain,
( nil = sK0
| neq(sK2,nil) ),
inference(forward_demodulation,[],[f138,f139]) ).
fof(f138,plain,
( nil = sK2
| neq(sK2,nil) ),
inference(cnf_transformation,[],[f117]) ).
fof(f185,plain,
( spl5_1
| ~ spl5_7 ),
inference(avatar_split_clause,[],[f131,f182,f155]) ).
fof(f131,plain,
( nil != sK0
| neq(sK1,nil) ),
inference(cnf_transformation,[],[f117]) ).
fof(f180,plain,
( spl5_5
| spl5_6 ),
inference(avatar_split_clause,[],[f137,f177,f173]) ).
fof(f137,plain,
( nil = sK3
| neq(sK2,nil) ),
inference(cnf_transformation,[],[f117]) ).
fof(f171,plain,
( ~ spl5_3
| spl5_2
| ~ spl5_4 ),
inference(avatar_split_clause,[],[f134,f168,f159,f164]) ).
fof(f134,plain,
( ~ neq(sK0,nil)
| nil = sK1
| ~ rearsegP(sK1,sK0) ),
inference(cnf_transformation,[],[f117]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWC105+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.34 % Computer : n016.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 : Tue Aug 30 18:41:31 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.49 % (8108)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.49 % (8108)First to succeed.
% 0.20/0.50 % (8108)Refutation found. Thanks to Tanya!
% 0.20/0.50 % SZS status Theorem for theBenchmark
% 0.20/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.50 % (8108)------------------------------
% 0.20/0.50 % (8108)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50 % (8108)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50 % (8108)Termination reason: Refutation
% 0.20/0.50
% 0.20/0.50 % (8108)Memory used [KB]: 6140
% 0.20/0.50 % (8108)Time elapsed: 0.068 s
% 0.20/0.50 % (8108)Instructions burned: 4 (million)
% 0.20/0.50 % (8108)------------------------------
% 0.20/0.50 % (8108)------------------------------
% 0.20/0.50 % (8104)Success in time 0.149 s
%------------------------------------------------------------------------------