TSTP Solution File: SWC050+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC050+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 : n011.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:26 EDT 2022
% Result : Theorem 1.43s 0.56s
% Output : Refutation 1.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of formulae : 41 ( 5 unt; 0 def)
% Number of atoms : 292 ( 28 equ)
% Maximal formula atoms : 34 ( 7 avg)
% Number of connectives : 364 ( 113 ~; 96 |; 134 &)
% ( 6 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 7 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 62 ( 25 !; 37 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f659,plain,
$false,
inference(avatar_sat_refutation,[],[f598,f604,f623,f632,f649,f655,f658]) ).
fof(f658,plain,
( ~ spl52_1
| ~ spl52_10
| ~ spl52_7
| ~ spl52_3
| ~ spl52_9 ),
inference(avatar_split_clause,[],[f657,f629,f601,f620,f634,f591]) ).
fof(f591,plain,
( spl52_1
<=> neq(sK19,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_1])]) ).
fof(f634,plain,
( spl52_10
<=> rearsegP(sK15,sK19) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_10])]) ).
fof(f620,plain,
( spl52_7
<=> ssList(sK19) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_7])]) ).
fof(f601,plain,
( spl52_3
<=> rearsegP(sK16,sK19) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_3])]) ).
fof(f629,plain,
( spl52_9
<=> ! [X4] :
( ~ rearsegP(sK15,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| ~ rearsegP(sK16,X4) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_9])]) ).
fof(f657,plain,
( ~ ssList(sK19)
| ~ rearsegP(sK15,sK19)
| ~ neq(sK19,nil)
| ~ spl52_3
| ~ spl52_9 ),
inference(resolution,[],[f630,f603]) ).
fof(f603,plain,
( rearsegP(sK16,sK19)
| ~ spl52_3 ),
inference(avatar_component_clause,[],[f601]) ).
fof(f630,plain,
( ! [X4] :
( ~ rearsegP(sK16,X4)
| ~ neq(X4,nil)
| ~ rearsegP(sK15,X4)
| ~ ssList(X4) )
| ~ spl52_9 ),
inference(avatar_component_clause,[],[f629]) ).
fof(f655,plain,
( spl52_10
| ~ spl52_2 ),
inference(avatar_split_clause,[],[f550,f595,f634]) ).
fof(f595,plain,
( spl52_2
<=> neq(sK16,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_2])]) ).
fof(f550,plain,
( ~ neq(sK16,nil)
| rearsegP(sK15,sK19) ),
inference(definition_unfolding,[],[f408,f401,f415]) ).
fof(f415,plain,
sK18 = sK16,
inference(cnf_transformation,[],[f263]) ).
fof(f263,plain,
( ssList(sK15)
& ssList(sK17)
& sK18 = sK16
& ssList(sK18)
& ( ( ! [X4] :
( ~ rearsegP(sK15,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ rearsegP(sK16,X4) )
& neq(sK16,nil)
& rearsegP(sK17,sK19)
& ssList(sK19)
& neq(sK19,nil)
& rearsegP(sK18,sK19) )
| ( neq(sK16,nil)
& ~ neq(sK18,nil) ) )
& sK17 = sK15
& ssList(sK16) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK15,sK16,sK17,sK18,sK19])],[f108,f262,f261,f260,f259,f258]) ).
fof(f258,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& ssList(X3)
& ( ( ! [X4] :
( ~ rearsegP(X0,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ rearsegP(X1,X4) )
& neq(X1,nil)
& ? [X5] :
( rearsegP(X2,X5)
& ssList(X5)
& neq(X5,nil)
& rearsegP(X3,X5) ) )
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& X0 = X2 ) )
& ssList(X1) ) )
=> ( ssList(sK15)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& ssList(X3)
& ( ( ! [X4] :
( ~ rearsegP(sK15,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ rearsegP(X1,X4) )
& neq(X1,nil)
& ? [X5] :
( rearsegP(X2,X5)
& ssList(X5)
& neq(X5,nil)
& rearsegP(X3,X5) ) )
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& sK15 = X2 ) )
& ssList(X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f259,plain,
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& ssList(X3)
& ( ( ! [X4] :
( ~ rearsegP(sK15,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ rearsegP(X1,X4) )
& neq(X1,nil)
& ? [X5] :
( rearsegP(X2,X5)
& ssList(X5)
& neq(X5,nil)
& rearsegP(X3,X5) ) )
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& sK15 = X2 ) )
& ssList(X1) )
=> ( ? [X2] :
( ssList(X2)
& ? [X3] :
( sK16 = X3
& ssList(X3)
& ( ( ! [X4] :
( ~ rearsegP(sK15,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ rearsegP(sK16,X4) )
& neq(sK16,nil)
& ? [X5] :
( rearsegP(X2,X5)
& ssList(X5)
& neq(X5,nil)
& rearsegP(X3,X5) ) )
| ( neq(sK16,nil)
& ~ neq(X3,nil) ) )
& sK15 = X2 ) )
& ssList(sK16) ) ),
introduced(choice_axiom,[]) ).
fof(f260,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( sK16 = X3
& ssList(X3)
& ( ( ! [X4] :
( ~ rearsegP(sK15,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ rearsegP(sK16,X4) )
& neq(sK16,nil)
& ? [X5] :
( rearsegP(X2,X5)
& ssList(X5)
& neq(X5,nil)
& rearsegP(X3,X5) ) )
| ( neq(sK16,nil)
& ~ neq(X3,nil) ) )
& sK15 = X2 ) )
=> ( ssList(sK17)
& ? [X3] :
( sK16 = X3
& ssList(X3)
& ( ( ! [X4] :
( ~ rearsegP(sK15,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ rearsegP(sK16,X4) )
& neq(sK16,nil)
& ? [X5] :
( rearsegP(sK17,X5)
& ssList(X5)
& neq(X5,nil)
& rearsegP(X3,X5) ) )
| ( neq(sK16,nil)
& ~ neq(X3,nil) ) )
& sK17 = sK15 ) ) ),
introduced(choice_axiom,[]) ).
fof(f261,plain,
( ? [X3] :
( sK16 = X3
& ssList(X3)
& ( ( ! [X4] :
( ~ rearsegP(sK15,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ rearsegP(sK16,X4) )
& neq(sK16,nil)
& ? [X5] :
( rearsegP(sK17,X5)
& ssList(X5)
& neq(X5,nil)
& rearsegP(X3,X5) ) )
| ( neq(sK16,nil)
& ~ neq(X3,nil) ) )
& sK17 = sK15 )
=> ( sK18 = sK16
& ssList(sK18)
& ( ( ! [X4] :
( ~ rearsegP(sK15,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ rearsegP(sK16,X4) )
& neq(sK16,nil)
& ? [X5] :
( rearsegP(sK17,X5)
& ssList(X5)
& neq(X5,nil)
& rearsegP(sK18,X5) ) )
| ( neq(sK16,nil)
& ~ neq(sK18,nil) ) )
& sK17 = sK15 ) ),
introduced(choice_axiom,[]) ).
fof(f262,plain,
( ? [X5] :
( rearsegP(sK17,X5)
& ssList(X5)
& neq(X5,nil)
& rearsegP(sK18,X5) )
=> ( rearsegP(sK17,sK19)
& ssList(sK19)
& neq(sK19,nil)
& rearsegP(sK18,sK19) ) ),
introduced(choice_axiom,[]) ).
fof(f108,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& ssList(X3)
& ( ( ! [X4] :
( ~ rearsegP(X0,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ rearsegP(X1,X4) )
& neq(X1,nil)
& ? [X5] :
( rearsegP(X2,X5)
& ssList(X5)
& neq(X5,nil)
& rearsegP(X3,X5) ) )
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& X0 = X2 ) )
& ssList(X1) ) ),
inference(flattening,[],[f107]) ).
fof(f107,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& ( ( neq(X1,nil)
& ~ neq(X3,nil) )
| ( ! [X4] :
( ~ rearsegP(X0,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ rearsegP(X1,X4) )
& ? [X5] :
( rearsegP(X3,X5)
& neq(X5,nil)
& rearsegP(X2,X5)
& ssList(X5) )
& neq(X1,nil) ) )
& X0 = X2
& 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)
=> ( X1 != X3
| ( ( ~ neq(X1,nil)
| neq(X3,nil) )
& ( ? [X4] :
( rearsegP(X1,X4)
& neq(X4,nil)
& rearsegP(X0,X4)
& ssList(X4) )
| ! [X5] :
( ssList(X5)
=> ( ~ rearsegP(X3,X5)
| ~ neq(X5,nil)
| ~ rearsegP(X2,X5) ) )
| ~ neq(X1,nil) ) )
| X0 != X2 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| ( ( ~ neq(X1,nil)
| neq(X3,nil) )
& ( ? [X4] :
( rearsegP(X1,X4)
& neq(X4,nil)
& rearsegP(X0,X4)
& ssList(X4) )
| ! [X5] :
( ssList(X5)
=> ( ~ rearsegP(X3,X5)
| ~ neq(X5,nil)
| ~ rearsegP(X2,X5) ) )
| ~ neq(X1,nil) ) )
| X0 != X2 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f401,plain,
sK17 = sK15,
inference(cnf_transformation,[],[f263]) ).
fof(f408,plain,
( rearsegP(sK17,sK19)
| ~ neq(sK18,nil) ),
inference(cnf_transformation,[],[f263]) ).
fof(f649,plain,
spl52_2,
inference(avatar_split_clause,[],[f583,f595]) ).
fof(f583,plain,
neq(sK16,nil),
inference(duplicate_literal_removal,[],[f411]) ).
fof(f411,plain,
( neq(sK16,nil)
| neq(sK16,nil) ),
inference(cnf_transformation,[],[f263]) ).
fof(f632,plain,
( ~ spl52_2
| spl52_9 ),
inference(avatar_split_clause,[],[f547,f629,f595]) ).
fof(f547,plain,
! [X4] :
( ~ rearsegP(sK16,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| ~ rearsegP(sK15,X4)
| ~ neq(sK16,nil) ),
inference(definition_unfolding,[],[f412,f415]) ).
fof(f412,plain,
! [X4] :
( ~ rearsegP(sK15,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ rearsegP(sK16,X4)
| ~ neq(sK18,nil) ),
inference(cnf_transformation,[],[f263]) ).
fof(f623,plain,
( spl52_7
| ~ spl52_2 ),
inference(avatar_split_clause,[],[f551,f595,f620]) ).
fof(f551,plain,
( ~ neq(sK16,nil)
| ssList(sK19) ),
inference(definition_unfolding,[],[f406,f415]) ).
fof(f406,plain,
( ssList(sK19)
| ~ neq(sK18,nil) ),
inference(cnf_transformation,[],[f263]) ).
fof(f604,plain,
( ~ spl52_2
| spl52_3 ),
inference(avatar_split_clause,[],[f554,f601,f595]) ).
fof(f554,plain,
( rearsegP(sK16,sK19)
| ~ neq(sK16,nil) ),
inference(definition_unfolding,[],[f402,f415,f415]) ).
fof(f402,plain,
( rearsegP(sK18,sK19)
| ~ neq(sK18,nil) ),
inference(cnf_transformation,[],[f263]) ).
fof(f598,plain,
( spl52_1
| ~ spl52_2 ),
inference(avatar_split_clause,[],[f552,f595,f591]) ).
fof(f552,plain,
( ~ neq(sK16,nil)
| neq(sK19,nil) ),
inference(definition_unfolding,[],[f404,f415]) ).
fof(f404,plain,
( neq(sK19,nil)
| ~ neq(sK18,nil) ),
inference(cnf_transformation,[],[f263]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : SWC050+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.14/0.35 % Computer : n011.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Aug 30 17:59:55 EDT 2022
% 0.14/0.35 % CPUTime :
% 1.22/0.52 % (15027)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 1.22/0.52 % (15026)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 1.22/0.54 % (15043)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 1.22/0.54 % (15042)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 1.22/0.54 % (15034)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 1.22/0.54 % (15035)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 1.22/0.54 % (15034)Instruction limit reached!
% 1.22/0.54 % (15034)------------------------------
% 1.22/0.54 % (15034)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.22/0.54 % (15035)Instruction limit reached!
% 1.22/0.54 % (15035)------------------------------
% 1.22/0.54 % (15035)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.43/0.55 % (15042)First to succeed.
% 1.43/0.55 % (15034)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.43/0.55 % (15034)Termination reason: Unknown
% 1.43/0.55 % (15034)Termination phase: Preprocessing 3
% 1.43/0.55
% 1.43/0.55 % (15034)Memory used [KB]: 1663
% 1.43/0.55 % (15034)Time elapsed: 0.004 s
% 1.43/0.55 % (15034)Instructions burned: 4 (million)
% 1.43/0.55 % (15034)------------------------------
% 1.43/0.55 % (15034)------------------------------
% 1.43/0.55 % (15044)dis+21_1:1_ep=RS:nwc=10.0:s2a=on:s2at=1.5:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 1.43/0.56 % (15042)Refutation found. Thanks to Tanya!
% 1.43/0.56 % SZS status Theorem for theBenchmark
% 1.43/0.56 % SZS output start Proof for theBenchmark
% See solution above
% 1.43/0.56 % (15042)------------------------------
% 1.43/0.56 % (15042)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.43/0.56 % (15042)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.43/0.56 % (15042)Termination reason: Refutation
% 1.43/0.56
% 1.43/0.56 % (15042)Memory used [KB]: 6396
% 1.43/0.56 % (15042)Time elapsed: 0.128 s
% 1.43/0.56 % (15042)Instructions burned: 12 (million)
% 1.43/0.56 % (15042)------------------------------
% 1.43/0.56 % (15042)------------------------------
% 1.43/0.56 % (15019)Success in time 0.196 s
%------------------------------------------------------------------------------