TSTP Solution File: SWC415+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC415+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 : n008.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:41:04 EDT 2022
% Result : Theorem 1.63s 0.56s
% Output : Refutation 1.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 8
% Syntax : Number of formulae : 46 ( 10 unt; 0 def)
% Number of atoms : 324 ( 113 equ)
% Maximal formula atoms : 34 ( 7 avg)
% Number of connectives : 445 ( 167 ~; 149 |; 111 &)
% ( 2 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 83 ( 51 !; 32 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f336,plain,
$false,
inference(subsumption_resolution,[],[f335,f163]) ).
fof(f163,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f335,plain,
~ ssList(nil),
inference(resolution,[],[f325,f224]) ).
fof(f224,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f216]) ).
fof(f216,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f164]) ).
fof(f164,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| X0 != X1
| ~ neq(X0,X1) ),
inference(cnf_transformation,[],[f138]) ).
fof(f138,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) ) ) ),
inference(nnf_transformation,[],[f104]) ).
fof(f104,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( neq(X0,X1)
<=> X0 != X1 ) ) ),
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(f325,plain,
neq(nil,nil),
inference(backward_demodulation,[],[f227,f323]) ).
fof(f323,plain,
nil = sK5,
inference(subsumption_resolution,[],[f322,f177]) ).
fof(f177,plain,
ssList(sK5),
inference(cnf_transformation,[],[f148]) ).
fof(f148,plain,
( ssList(sK2)
& ssList(sK3)
& ( ( ~ neq(sK5,nil)
& neq(sK3,nil) )
| ( ! [X4] :
( tl(sK3) != X4
| ~ neq(nil,sK3)
| ~ ssList(X4)
| sK2 != X4 )
& neq(sK3,nil)
& ! [X5] :
( ~ ssList(X5)
| sK4 = X5
| ~ neq(nil,sK5)
| tl(sK5) != X5 ) ) )
& sK3 = sK5
& ssList(sK5)
& sK2 = sK4
& ssList(sK4) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5])],[f143,f147,f146,f145,f144]) ).
fof(f144,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ! [X4] :
( tl(X1) != X4
| ~ neq(nil,X1)
| ~ ssList(X4)
| X0 != X4 )
& neq(X1,nil)
& ! [X5] :
( ~ ssList(X5)
| X2 = X5
| ~ neq(nil,X3)
| tl(X3) != X5 ) ) )
& X1 = X3
& ssList(X3)
& X0 = X2 )
& ssList(X2) ) ) )
=> ( ssList(sK2)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ! [X4] :
( tl(X1) != X4
| ~ neq(nil,X1)
| ~ ssList(X4)
| sK2 != X4 )
& neq(X1,nil)
& ! [X5] :
( ~ ssList(X5)
| X2 = X5
| ~ neq(nil,X3)
| tl(X3) != X5 ) ) )
& X1 = X3
& ssList(X3)
& sK2 = X2 )
& ssList(X2) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f145,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ! [X4] :
( tl(X1) != X4
| ~ neq(nil,X1)
| ~ ssList(X4)
| sK2 != X4 )
& neq(X1,nil)
& ! [X5] :
( ~ ssList(X5)
| X2 = X5
| ~ neq(nil,X3)
| tl(X3) != X5 ) ) )
& X1 = X3
& ssList(X3)
& sK2 = X2 )
& ssList(X2) ) )
=> ( ssList(sK3)
& ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK3,nil) )
| ( ! [X4] :
( tl(sK3) != X4
| ~ neq(nil,sK3)
| ~ ssList(X4)
| sK2 != X4 )
& neq(sK3,nil)
& ! [X5] :
( ~ ssList(X5)
| X2 = X5
| ~ neq(nil,X3)
| tl(X3) != X5 ) ) )
& sK3 = X3
& ssList(X3)
& sK2 = X2 )
& ssList(X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f146,plain,
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK3,nil) )
| ( ! [X4] :
( tl(sK3) != X4
| ~ neq(nil,sK3)
| ~ ssList(X4)
| sK2 != X4 )
& neq(sK3,nil)
& ! [X5] :
( ~ ssList(X5)
| X2 = X5
| ~ neq(nil,X3)
| tl(X3) != X5 ) ) )
& sK3 = X3
& ssList(X3)
& sK2 = X2 )
& ssList(X2) )
=> ( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK3,nil) )
| ( ! [X4] :
( tl(sK3) != X4
| ~ neq(nil,sK3)
| ~ ssList(X4)
| sK2 != X4 )
& neq(sK3,nil)
& ! [X5] :
( ~ ssList(X5)
| sK4 = X5
| ~ neq(nil,X3)
| tl(X3) != X5 ) ) )
& sK3 = X3
& ssList(X3)
& sK2 = sK4 )
& ssList(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f147,plain,
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK3,nil) )
| ( ! [X4] :
( tl(sK3) != X4
| ~ neq(nil,sK3)
| ~ ssList(X4)
| sK2 != X4 )
& neq(sK3,nil)
& ! [X5] :
( ~ ssList(X5)
| sK4 = X5
| ~ neq(nil,X3)
| tl(X3) != X5 ) ) )
& sK3 = X3
& ssList(X3)
& sK2 = sK4 )
=> ( ( ( ~ neq(sK5,nil)
& neq(sK3,nil) )
| ( ! [X4] :
( tl(sK3) != X4
| ~ neq(nil,sK3)
| ~ ssList(X4)
| sK2 != X4 )
& neq(sK3,nil)
& ! [X5] :
( ~ ssList(X5)
| sK4 = X5
| ~ neq(nil,sK5)
| tl(sK5) != X5 ) ) )
& sK3 = sK5
& ssList(sK5)
& sK2 = sK4 ) ),
introduced(choice_axiom,[]) ).
fof(f143,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ! [X4] :
( tl(X1) != X4
| ~ neq(nil,X1)
| ~ ssList(X4)
| X0 != X4 )
& neq(X1,nil)
& ! [X5] :
( ~ ssList(X5)
| X2 = X5
| ~ neq(nil,X3)
| tl(X3) != X5 ) ) )
& X1 = X3
& ssList(X3)
& X0 = X2 )
& ssList(X2) ) ) ),
inference(rectify,[],[f121]) ).
fof(f121,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ! [X5] :
( tl(X1) != X5
| ~ neq(nil,X1)
| ~ ssList(X5)
| X0 != X5 )
& neq(X1,nil)
& ! [X4] :
( ~ ssList(X4)
| X2 = X4
| ~ neq(nil,X3)
| tl(X3) != X4 ) ) )
& X1 = X3
& ssList(X3)
& X0 = X2 )
& ssList(X2) ) ) ),
inference(flattening,[],[f120]) ).
fof(f120,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ! [X5] :
( tl(X1) != X5
| ~ neq(nil,X1)
| ~ ssList(X5)
| X0 != X5 )
& neq(X1,nil)
& ! [X4] :
( ~ ssList(X4)
| X2 = X4
| ~ neq(nil,X3)
| tl(X3) != X4 ) ) )
& 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)
=> ( ( ( ? [X4] :
( X2 != X4
& ssList(X4)
& neq(nil,X3)
& tl(X3) = X4 )
| ? [X5] :
( X0 = X5
& tl(X1) = X5
& ssList(X5)
& neq(nil,X1) )
| ~ neq(X1,nil) )
& ( neq(X3,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)
=> ( ( ( ? [X4] :
( X2 != X4
& ssList(X4)
& neq(nil,X3)
& tl(X3) = X4 )
| ? [X5] :
( X0 = X5
& tl(X1) = X5
& ssList(X5)
& neq(nil,X1) )
| ~ neq(X1,nil) )
& ( neq(X3,nil)
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f322,plain,
( nil = sK5
| ~ ssList(sK5) ),
inference(duplicate_literal_removal,[],[f321]) ).
fof(f321,plain,
( nil = sK5
| ~ ssList(sK5)
| nil = sK5 ),
inference(resolution,[],[f320,f208]) ).
fof(f208,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f117]) ).
fof(f117,plain,
! [X0] :
( nil = X0
| ~ ssList(X0)
| ssList(tl(X0)) ),
inference(flattening,[],[f116]) ).
fof(f116,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f24]) ).
fof(f24,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ssList(tl(X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax24) ).
fof(f320,plain,
( ~ ssList(tl(sK5))
| nil = sK5 ),
inference(subsumption_resolution,[],[f319,f177]) ).
fof(f319,plain,
( ~ ssList(tl(sK5))
| nil = sK5
| ~ ssList(sK5) ),
inference(subsumption_resolution,[],[f318,f163]) ).
fof(f318,plain,
( ~ ssList(tl(sK5))
| ~ ssList(nil)
| ~ ssList(sK5)
| nil = sK5 ),
inference(resolution,[],[f316,f165]) ).
fof(f165,plain,
! [X0,X1] :
( neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0)
| X0 = X1 ),
inference(cnf_transformation,[],[f138]) ).
fof(f316,plain,
( ~ neq(nil,sK5)
| ~ ssList(tl(sK5)) ),
inference(subsumption_resolution,[],[f315,f261]) ).
fof(f261,plain,
( ~ neq(nil,sK5)
| tl(sK5) != sK4
| ~ ssList(tl(sK5)) ),
inference(subsumption_resolution,[],[f217,f227]) ).
fof(f217,plain,
( tl(sK5) != sK4
| ~ ssList(tl(sK5))
| ~ neq(sK5,nil)
| ~ neq(nil,sK5) ),
inference(equality_resolution,[],[f211]) ).
fof(f211,plain,
! [X4] :
( ~ neq(sK5,nil)
| tl(sK5) != X4
| ~ neq(nil,sK5)
| ~ ssList(X4)
| sK4 != X4 ),
inference(definition_unfolding,[],[f184,f178,f178,f176]) ).
fof(f176,plain,
sK2 = sK4,
inference(cnf_transformation,[],[f148]) ).
fof(f178,plain,
sK3 = sK5,
inference(cnf_transformation,[],[f148]) ).
fof(f184,plain,
! [X4] :
( ~ neq(sK5,nil)
| tl(sK3) != X4
| ~ neq(nil,sK3)
| ~ ssList(X4)
| sK2 != X4 ),
inference(cnf_transformation,[],[f148]) ).
fof(f315,plain,
( ~ ssList(tl(sK5))
| ~ neq(nil,sK5)
| tl(sK5) = sK4 ),
inference(subsumption_resolution,[],[f218,f227]) ).
fof(f218,plain,
( ~ ssList(tl(sK5))
| ~ neq(sK5,nil)
| ~ neq(nil,sK5)
| tl(sK5) = sK4 ),
inference(equality_resolution,[],[f182]) ).
fof(f182,plain,
! [X5] :
( ~ neq(sK5,nil)
| ~ ssList(X5)
| sK4 = X5
| ~ neq(nil,sK5)
| tl(sK5) != X5 ),
inference(cnf_transformation,[],[f148]) ).
fof(f227,plain,
neq(sK5,nil),
inference(duplicate_literal_removal,[],[f214]) ).
fof(f214,plain,
( neq(sK5,nil)
| neq(sK5,nil) ),
inference(definition_unfolding,[],[f180,f178,f178]) ).
fof(f180,plain,
( neq(sK3,nil)
| neq(sK3,nil) ),
inference(cnf_transformation,[],[f148]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWC415+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.33 % Computer : n008.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Tue Aug 30 18:58:25 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.49/0.54 % (19563)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 1.49/0.54 % (19568)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 1.49/0.54 % (19568)Refutation not found, incomplete strategy% (19568)------------------------------
% 1.49/0.54 % (19568)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.49/0.55 % (19563)First to succeed.
% 1.49/0.55 % (19568)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.49/0.55 % (19568)Termination reason: Refutation not found, incomplete strategy
% 1.49/0.55
% 1.49/0.55 % (19568)Memory used [KB]: 6140
% 1.49/0.55 % (19568)Time elapsed: 0.135 s
% 1.49/0.55 % (19568)Instructions burned: 5 (million)
% 1.49/0.55 % (19568)------------------------------
% 1.49/0.55 % (19568)------------------------------
% 1.63/0.56 % (19584)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 1.63/0.56 % (19563)Refutation found. Thanks to Tanya!
% 1.63/0.56 % SZS status Theorem for theBenchmark
% 1.63/0.56 % SZS output start Proof for theBenchmark
% See solution above
% 1.63/0.56 % (19563)------------------------------
% 1.63/0.56 % (19563)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.63/0.56 % (19563)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.63/0.56 % (19563)Termination reason: Refutation
% 1.63/0.56
% 1.63/0.56 % (19563)Memory used [KB]: 1663
% 1.63/0.56 % (19563)Time elapsed: 0.141 s
% 1.63/0.56 % (19563)Instructions burned: 7 (million)
% 1.63/0.56 % (19563)------------------------------
% 1.63/0.56 % (19563)------------------------------
% 1.63/0.56 % (19557)Success in time 0.215 s
%------------------------------------------------------------------------------