TSTP Solution File: SWC320+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC320+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 : n005.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:40:24 EDT 2022
% Result : Theorem 0.18s 0.53s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 17
% Syntax : Number of formulae : 66 ( 5 unt; 0 def)
% Number of atoms : 413 ( 175 equ)
% Maximal formula atoms : 40 ( 6 avg)
% Number of connectives : 539 ( 192 ~; 170 |; 147 &)
% ( 10 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 9 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 104 ( 56 !; 48 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f397,plain,
$false,
inference(avatar_sat_refutation,[],[f200,f208,f213,f218,f223,f225,f226,f232,f319,f396]) ).
fof(f396,plain,
( ~ spl10_1
| ~ spl10_4
| ~ spl10_6
| ~ spl10_7
| ~ spl10_8 ),
inference(avatar_contradiction_clause,[],[f395]) ).
fof(f395,plain,
( $false
| ~ spl10_1
| ~ spl10_4
| ~ spl10_6
| ~ spl10_7
| ~ spl10_8 ),
inference(subsumption_resolution,[],[f394,f231]) ).
fof(f231,plain,
( app(sK5,cons(sK4,nil)) = sK3
| ~ spl10_8 ),
inference(avatar_component_clause,[],[f229]) ).
fof(f229,plain,
( spl10_8
<=> app(sK5,cons(sK4,nil)) = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl10_8])]) ).
fof(f394,plain,
( app(sK5,cons(sK4,nil)) != sK3
| ~ spl10_1
| ~ spl10_4
| ~ spl10_6
| ~ spl10_7 ),
inference(subsumption_resolution,[],[f393,f222]) ).
fof(f222,plain,
( ssList(sK5)
| ~ spl10_7 ),
inference(avatar_component_clause,[],[f220]) ).
fof(f220,plain,
( spl10_7
<=> ssList(sK5) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_7])]) ).
fof(f393,plain,
( ~ ssList(sK5)
| app(sK5,cons(sK4,nil)) != sK3
| ~ spl10_1
| ~ spl10_4
| ~ spl10_6 ),
inference(subsumption_resolution,[],[f392,f195]) ).
fof(f195,plain,
( ssItem(sK4)
| ~ spl10_1 ),
inference(avatar_component_clause,[],[f193]) ).
fof(f193,plain,
( spl10_1
<=> ssItem(sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_1])]) ).
fof(f392,plain,
( ~ ssItem(sK4)
| ~ ssList(sK5)
| app(sK5,cons(sK4,nil)) != sK3
| ~ spl10_4
| ~ spl10_6 ),
inference(trivial_inequality_removal,[],[f391]) ).
fof(f391,plain,
( ~ ssList(sK5)
| app(sK5,cons(sK4,nil)) != sK3
| sK2 != sK2
| ~ ssItem(sK4)
| ~ spl10_4
| ~ spl10_6 ),
inference(superposition,[],[f207,f217]) ).
fof(f217,plain,
( app(cons(sK4,nil),sK5) = sK2
| ~ spl10_6 ),
inference(avatar_component_clause,[],[f215]) ).
fof(f215,plain,
( spl10_6
<=> app(cons(sK4,nil),sK5) = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl10_6])]) ).
fof(f207,plain,
( ! [X4,X5] :
( app(cons(X4,nil),X5) != sK2
| ~ ssItem(X4)
| app(X5,cons(X4,nil)) != sK3
| ~ ssList(X5) )
| ~ spl10_4 ),
inference(avatar_component_clause,[],[f206]) ).
fof(f206,plain,
( spl10_4
<=> ! [X4,X5] :
( ~ ssItem(X4)
| app(X5,cons(X4,nil)) != sK3
| ~ ssList(X5)
| app(cons(X4,nil),X5) != sK2 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_4])]) ).
fof(f319,plain,
( ~ spl10_2
| ~ spl10_3 ),
inference(avatar_contradiction_clause,[],[f318]) ).
fof(f318,plain,
( $false
| ~ spl10_2
| ~ spl10_3 ),
inference(subsumption_resolution,[],[f316,f160]) ).
fof(f160,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f316,plain,
( ~ ssList(nil)
| ~ spl10_2
| ~ spl10_3 ),
inference(resolution,[],[f300,f191]) ).
fof(f191,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f187]) ).
fof(f187,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f172]) ).
fof(f172,plain,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f132]) ).
fof(f132,plain,
! [X0] :
( ! [X1] :
( ( ( X0 != X1
| ~ neq(X0,X1) )
& ( neq(X0,X1)
| X0 = X1 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f112]) ).
fof(f112,plain,
! [X0] :
( ! [X1] :
( ( X0 != X1
<=> neq(X0,X1) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
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(f300,plain,
( neq(nil,nil)
| ~ spl10_2
| ~ spl10_3 ),
inference(backward_demodulation,[],[f198,f204]) ).
fof(f204,plain,
( nil = sK3
| ~ spl10_3 ),
inference(avatar_component_clause,[],[f202]) ).
fof(f202,plain,
( spl10_3
<=> nil = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl10_3])]) ).
fof(f198,plain,
( neq(sK3,nil)
| ~ spl10_2 ),
inference(avatar_component_clause,[],[f197]) ).
fof(f197,plain,
( spl10_2
<=> neq(sK3,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_2])]) ).
fof(f232,plain,
( ~ spl10_2
| spl10_8 ),
inference(avatar_split_clause,[],[f144,f229,f197]) ).
fof(f144,plain,
( app(sK5,cons(sK4,nil)) = sK3
| ~ neq(sK3,nil) ),
inference(cnf_transformation,[],[f126]) ).
fof(f126,plain,
( ssList(sK1)
& ssList(sK2)
& ssList(sK3)
& ( ( nil != sK0
& nil = sK1 )
| ( ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( app(cons(X4,nil),X5) != sK0
| ~ ssList(X5)
| app(X5,cons(X4,nil)) != sK1 ) )
& neq(sK1,nil) ) )
& sK0 = sK2
& sK1 = sK3
& ( nil = sK2
| nil != sK3 )
& ( ~ neq(sK3,nil)
| ( ssItem(sK4)
& app(sK5,cons(sK4,nil)) = sK3
& app(cons(sK4,nil),sK5) = sK2
& ssList(sK5) ) )
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f99,f125,f124,f123,f122,f121,f120]) ).
fof(f120,plain,
( ? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ( nil != X0
& nil = X1 )
| ( ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( app(cons(X4,nil),X5) != X0
| ~ ssList(X5)
| app(X5,cons(X4,nil)) != X1 ) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3
& ( nil = X2
| nil != X3 )
& ( ~ neq(X3,nil)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( app(X7,cons(X6,nil)) = X3
& app(cons(X6,nil),X7) = X2
& ssList(X7) ) ) ) ) ) )
& ssList(X0) )
=> ( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ( nil != sK0
& nil = X1 )
| ( ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( app(cons(X4,nil),X5) != sK0
| ~ ssList(X5)
| app(X5,cons(X4,nil)) != X1 ) )
& neq(X1,nil) ) )
& sK0 = X2
& X1 = X3
& ( nil = X2
| nil != X3 )
& ( ~ neq(X3,nil)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( app(X7,cons(X6,nil)) = X3
& app(cons(X6,nil),X7) = X2
& ssList(X7) ) ) ) ) ) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f121,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ( nil != sK0
& nil = X1 )
| ( ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( app(cons(X4,nil),X5) != sK0
| ~ ssList(X5)
| app(X5,cons(X4,nil)) != X1 ) )
& neq(X1,nil) ) )
& sK0 = X2
& X1 = X3
& ( nil = X2
| nil != X3 )
& ( ~ neq(X3,nil)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( app(X7,cons(X6,nil)) = X3
& app(cons(X6,nil),X7) = X2
& ssList(X7) ) ) ) ) ) )
=> ( ssList(sK1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ( nil != sK0
& nil = sK1 )
| ( ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( app(cons(X4,nil),X5) != sK0
| ~ ssList(X5)
| app(X5,cons(X4,nil)) != sK1 ) )
& neq(sK1,nil) ) )
& sK0 = X2
& sK1 = X3
& ( nil = X2
| nil != X3 )
& ( ~ neq(X3,nil)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( app(X7,cons(X6,nil)) = X3
& app(cons(X6,nil),X7) = X2
& ssList(X7) ) ) ) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f122,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ( nil != sK0
& nil = sK1 )
| ( ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( app(cons(X4,nil),X5) != sK0
| ~ ssList(X5)
| app(X5,cons(X4,nil)) != sK1 ) )
& neq(sK1,nil) ) )
& sK0 = X2
& sK1 = X3
& ( nil = X2
| nil != X3 )
& ( ~ neq(X3,nil)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( app(X7,cons(X6,nil)) = X3
& app(cons(X6,nil),X7) = X2
& ssList(X7) ) ) ) ) )
=> ( ssList(sK2)
& ? [X3] :
( ssList(X3)
& ( ( nil != sK0
& nil = sK1 )
| ( ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( app(cons(X4,nil),X5) != sK0
| ~ ssList(X5)
| app(X5,cons(X4,nil)) != sK1 ) )
& neq(sK1,nil) ) )
& sK0 = sK2
& sK1 = X3
& ( nil = sK2
| nil != X3 )
& ( ~ neq(X3,nil)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( app(X7,cons(X6,nil)) = X3
& app(cons(X6,nil),X7) = sK2
& ssList(X7) ) ) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f123,plain,
( ? [X3] :
( ssList(X3)
& ( ( nil != sK0
& nil = sK1 )
| ( ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( app(cons(X4,nil),X5) != sK0
| ~ ssList(X5)
| app(X5,cons(X4,nil)) != sK1 ) )
& neq(sK1,nil) ) )
& sK0 = sK2
& sK1 = X3
& ( nil = sK2
| nil != X3 )
& ( ~ neq(X3,nil)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( app(X7,cons(X6,nil)) = X3
& app(cons(X6,nil),X7) = sK2
& ssList(X7) ) ) ) )
=> ( ssList(sK3)
& ( ( nil != sK0
& nil = sK1 )
| ( ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( app(cons(X4,nil),X5) != sK0
| ~ ssList(X5)
| app(X5,cons(X4,nil)) != sK1 ) )
& neq(sK1,nil) ) )
& sK0 = sK2
& sK1 = sK3
& ( nil = sK2
| nil != sK3 )
& ( ~ neq(sK3,nil)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( app(X7,cons(X6,nil)) = sK3
& app(cons(X6,nil),X7) = sK2
& ssList(X7) ) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f124,plain,
( ? [X6] :
( ssItem(X6)
& ? [X7] :
( app(X7,cons(X6,nil)) = sK3
& app(cons(X6,nil),X7) = sK2
& ssList(X7) ) )
=> ( ssItem(sK4)
& ? [X7] :
( sK3 = app(X7,cons(sK4,nil))
& app(cons(sK4,nil),X7) = sK2
& ssList(X7) ) ) ),
introduced(choice_axiom,[]) ).
fof(f125,plain,
( ? [X7] :
( sK3 = app(X7,cons(sK4,nil))
& app(cons(sK4,nil),X7) = sK2
& ssList(X7) )
=> ( app(sK5,cons(sK4,nil)) = sK3
& app(cons(sK4,nil),sK5) = sK2
& ssList(sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ( nil != X0
& nil = X1 )
| ( ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( app(cons(X4,nil),X5) != X0
| ~ ssList(X5)
| app(X5,cons(X4,nil)) != X1 ) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3
& ( nil = X2
| nil != X3 )
& ( ~ neq(X3,nil)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( app(X7,cons(X6,nil)) = X3
& app(cons(X6,nil),X7) = X2
& ssList(X7) ) ) ) ) ) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( nil = X0
| nil != X1 )
& ( ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X1
& ssList(X5)
& app(cons(X4,nil),X5) = X0 )
& ssItem(X4) )
| ~ neq(X1,nil) ) )
| ~ ssList(X3)
| ( nil != X2
& nil = X3 )
| X0 != X2
| ( neq(X3,nil)
& ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ~ ssList(X7)
| app(X7,cons(X6,nil)) != X3
| app(cons(X6,nil),X7) != X2 ) ) )
| X1 != X3 ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( nil = X0
| nil != X1 )
& ( ? [X6] :
( ? [X7] :
( app(cons(X6,nil),X7) = X0
& ssList(X7)
& app(X7,cons(X6,nil)) = X1 )
& ssItem(X6) )
| ~ neq(X1,nil) ) )
| X0 != X2
| ( ! [X4] :
( ssItem(X4)
=> ! [X5] :
( app(cons(X4,nil),X5) != X2
| ~ ssList(X5)
| app(X5,cons(X4,nil)) != X3 ) )
& neq(X3,nil) )
| ( nil != X2
& nil = X3 )
| ~ ssList(X3)
| X1 != X3 ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( nil = X0
| nil != X1 )
& ( ? [X6] :
( ? [X7] :
( app(cons(X6,nil),X7) = X0
& ssList(X7)
& app(X7,cons(X6,nil)) = X1 )
& ssItem(X6) )
| ~ neq(X1,nil) ) )
| X0 != X2
| ( ! [X4] :
( ssItem(X4)
=> ! [X5] :
( app(cons(X4,nil),X5) != X2
| ~ ssList(X5)
| app(X5,cons(X4,nil)) != X3 ) )
& neq(X3,nil) )
| ( nil != X2
& nil = X3 )
| ~ ssList(X3)
| X1 != X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f226,plain,
( ~ spl10_3
| spl10_5 ),
inference(avatar_split_clause,[],[f146,f210,f202]) ).
fof(f210,plain,
( spl10_5
<=> nil = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl10_5])]) ).
fof(f146,plain,
( nil = sK2
| nil != sK3 ),
inference(cnf_transformation,[],[f126]) ).
fof(f225,plain,
( spl10_3
| spl10_2 ),
inference(avatar_split_clause,[],[f183,f197,f202]) ).
fof(f183,plain,
( neq(sK3,nil)
| nil = sK3 ),
inference(definition_unfolding,[],[f149,f147,f147]) ).
fof(f147,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f126]) ).
fof(f149,plain,
( nil = sK1
| neq(sK1,nil) ),
inference(cnf_transformation,[],[f126]) ).
fof(f223,plain,
( ~ spl10_2
| spl10_7 ),
inference(avatar_split_clause,[],[f142,f220,f197]) ).
fof(f142,plain,
( ssList(sK5)
| ~ neq(sK3,nil) ),
inference(cnf_transformation,[],[f126]) ).
fof(f218,plain,
( spl10_6
| ~ spl10_2 ),
inference(avatar_split_clause,[],[f143,f197,f215]) ).
fof(f143,plain,
( ~ neq(sK3,nil)
| app(cons(sK4,nil),sK5) = sK2 ),
inference(cnf_transformation,[],[f126]) ).
fof(f213,plain,
( ~ spl10_5
| spl10_2 ),
inference(avatar_split_clause,[],[f181,f197,f210]) ).
fof(f181,plain,
( neq(sK3,nil)
| nil != sK2 ),
inference(definition_unfolding,[],[f151,f148,f147]) ).
fof(f148,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f126]) ).
fof(f151,plain,
( nil != sK0
| neq(sK1,nil) ),
inference(cnf_transformation,[],[f126]) ).
fof(f208,plain,
( spl10_3
| spl10_4 ),
inference(avatar_split_clause,[],[f182,f206,f202]) ).
fof(f182,plain,
! [X4,X5] :
( ~ ssItem(X4)
| app(cons(X4,nil),X5) != sK2
| ~ ssList(X5)
| app(X5,cons(X4,nil)) != sK3
| nil = sK3 ),
inference(definition_unfolding,[],[f150,f147,f148,f147]) ).
fof(f150,plain,
! [X4,X5] :
( nil = sK1
| ~ ssItem(X4)
| app(cons(X4,nil),X5) != sK0
| ~ ssList(X5)
| app(X5,cons(X4,nil)) != sK1 ),
inference(cnf_transformation,[],[f126]) ).
fof(f200,plain,
( spl10_1
| ~ spl10_2 ),
inference(avatar_split_clause,[],[f145,f197,f193]) ).
fof(f145,plain,
( ~ neq(sK3,nil)
| ssItem(sK4) ),
inference(cnf_transformation,[],[f126]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC320+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/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.12/0.33 % Computer : n005.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Aug 30 18:46:33 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.18/0.48 % (15796)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 0.18/0.49 % (15812)lrs+11_1:1_plsq=on:plsqc=1:plsqr=32,1:ss=included:i=95:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/95Mi)
% 0.18/0.50 % (15804)fmb+10_1:1_nm=2:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.18/0.50 % (15804)Instruction limit reached!
% 0.18/0.50 % (15804)------------------------------
% 0.18/0.50 % (15804)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.50 % (15804)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.50 % (15804)Termination reason: Unknown
% 0.18/0.50 % (15804)Termination phase: Preprocessing 3
% 0.18/0.50
% 0.18/0.50 % (15804)Memory used [KB]: 1663
% 0.18/0.50 % (15804)Time elapsed: 0.003 s
% 0.18/0.50 % (15804)Instructions burned: 4 (million)
% 0.18/0.50 % (15804)------------------------------
% 0.18/0.50 % (15804)------------------------------
% 0.18/0.51 % (15788)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.18/0.51 % (15812)First to succeed.
% 0.18/0.51 % (15794)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)
% 0.18/0.52 % (15809)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)
% 0.18/0.52 % (15806)dis-10_3:2_amm=sco:ep=RS:fsr=off:nm=10:sd=2:sos=on:ss=axioms:st=3.0:i=11:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/11Mi)
% 0.18/0.52 % (15790)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.18/0.52 % (15803)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.18/0.53 % (15812)Refutation found. Thanks to Tanya!
% 0.18/0.53 % SZS status Theorem for theBenchmark
% 0.18/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.53 % (15812)------------------------------
% 0.18/0.53 % (15812)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.53 % (15812)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.53 % (15812)Termination reason: Refutation
% 0.18/0.53
% 0.18/0.53 % (15812)Memory used [KB]: 6268
% 0.18/0.53 % (15812)Time elapsed: 0.110 s
% 0.18/0.53 % (15812)Instructions burned: 15 (million)
% 0.18/0.53 % (15812)------------------------------
% 0.18/0.53 % (15812)------------------------------
% 0.18/0.53 % (15786)Success in time 0.181 s
%------------------------------------------------------------------------------