TSTP Solution File: SWC017+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC017+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 : n024.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:14 EDT 2022
% Result : Theorem 0.19s 0.50s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 20
% Syntax : Number of formulae : 82 ( 8 unt; 0 def)
% Number of atoms : 375 ( 100 equ)
% Maximal formula atoms : 34 ( 4 avg)
% Number of connectives : 449 ( 156 ~; 154 |; 110 &)
% ( 15 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 16 ( 14 usr; 12 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 61 ( 39 !; 22 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f787,plain,
$false,
inference(avatar_sat_refutation,[],[f607,f619,f626,f638,f643,f693,f697,f701,f712,f714,f752,f772,f784]) ).
fof(f784,plain,
( ~ spl57_4
| spl57_7
| ~ spl57_8 ),
inference(avatar_contradiction_clause,[],[f778]) ).
fof(f778,plain,
( $false
| ~ spl57_4
| spl57_7
| ~ spl57_8 ),
inference(unit_resulting_resolution,[],[f386,f754,f761,f362]) ).
fof(f362,plain,
! [X0] :
( ~ frontsegP(nil,X0)
| ~ ssList(X0)
| nil = X0 ),
inference(cnf_transformation,[],[f240]) ).
fof(f240,plain,
! [X0] :
( ~ ssList(X0)
| ( ( frontsegP(nil,X0)
| nil != X0 )
& ( nil = X0
| ~ frontsegP(nil,X0) ) ) ),
inference(nnf_transformation,[],[f102]) ).
fof(f102,plain,
! [X0] :
( ~ ssList(X0)
| ( frontsegP(nil,X0)
<=> nil = X0 ) ),
inference(ennf_transformation,[],[f46]) ).
fof(f46,axiom,
! [X0] :
( ssList(X0)
=> ( frontsegP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax46) ).
fof(f761,plain,
( frontsegP(nil,sK10)
| ~ spl57_4
| ~ spl57_8 ),
inference(backward_demodulation,[],[f747,f622]) ).
fof(f622,plain,
( nil = sK9
| ~ spl57_8 ),
inference(avatar_component_clause,[],[f621]) ).
fof(f621,plain,
( spl57_8
<=> nil = sK9 ),
introduced(avatar_definition,[new_symbols(naming,[spl57_8])]) ).
fof(f747,plain,
( frontsegP(sK9,sK10)
| ~ spl57_4 ),
inference(forward_demodulation,[],[f606,f385]) ).
fof(f385,plain,
sK11 = sK9,
inference(cnf_transformation,[],[f248]) ).
fof(f248,plain,
( ssList(sK9)
& ssList(sK10)
& sK11 = sK9
& sK10 = sK8
& ( ( frontsegP(sK11,sK10)
& neq(sK10,nil) )
| ( nil = sK10
& nil = sK11 ) )
& ( ( ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ frontsegP(sK8,X4)
| ~ frontsegP(sK9,X4) )
& neq(sK9,nil) )
| ( nil = sK9
& nil != sK8 ) )
& ssList(sK11)
& ssList(sK8) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK8,sK9,sK10,sK11])],[f121,f247,f246,f245,f244]) ).
fof(f244,plain,
( ? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& X0 = X2
& ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( ( ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ frontsegP(X0,X4)
| ~ frontsegP(X1,X4) )
& neq(X1,nil) )
| ( nil = X1
& nil != X0 ) )
& ssList(X3) ) ) )
& ssList(X0) )
=> ( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& sK8 = X2
& ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( ( ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ frontsegP(sK8,X4)
| ~ frontsegP(X1,X4) )
& neq(X1,nil) )
| ( nil = X1
& nil != sK8 ) )
& ssList(X3) ) ) )
& ssList(sK8) ) ),
introduced(choice_axiom,[]) ).
fof(f245,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& sK8 = X2
& ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( ( ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ frontsegP(sK8,X4)
| ~ frontsegP(X1,X4) )
& neq(X1,nil) )
| ( nil = X1
& nil != sK8 ) )
& ssList(X3) ) ) )
=> ( ssList(sK9)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( sK9 = X3
& sK8 = X2
& ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( ( ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ frontsegP(sK8,X4)
| ~ frontsegP(sK9,X4) )
& neq(sK9,nil) )
| ( nil = sK9
& nil != sK8 ) )
& ssList(X3) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f246,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( sK9 = X3
& sK8 = X2
& ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( ( ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ frontsegP(sK8,X4)
| ~ frontsegP(sK9,X4) )
& neq(sK9,nil) )
| ( nil = sK9
& nil != sK8 ) )
& ssList(X3) ) )
=> ( ssList(sK10)
& ? [X3] :
( sK9 = X3
& sK10 = sK8
& ( ( frontsegP(X3,sK10)
& neq(sK10,nil) )
| ( nil = sK10
& nil = X3 ) )
& ( ( ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ frontsegP(sK8,X4)
| ~ frontsegP(sK9,X4) )
& neq(sK9,nil) )
| ( nil = sK9
& nil != sK8 ) )
& ssList(X3) ) ) ),
introduced(choice_axiom,[]) ).
fof(f247,plain,
( ? [X3] :
( sK9 = X3
& sK10 = sK8
& ( ( frontsegP(X3,sK10)
& neq(sK10,nil) )
| ( nil = sK10
& nil = X3 ) )
& ( ( ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ frontsegP(sK8,X4)
| ~ frontsegP(sK9,X4) )
& neq(sK9,nil) )
| ( nil = sK9
& nil != sK8 ) )
& ssList(X3) )
=> ( sK11 = sK9
& sK10 = sK8
& ( ( frontsegP(sK11,sK10)
& neq(sK10,nil) )
| ( nil = sK10
& nil = sK11 ) )
& ( ( ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ frontsegP(sK8,X4)
| ~ frontsegP(sK9,X4) )
& neq(sK9,nil) )
| ( nil = sK9
& nil != sK8 ) )
& ssList(sK11) ) ),
introduced(choice_axiom,[]) ).
fof(f121,plain,
? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& X0 = X2
& ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( ( ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ frontsegP(X0,X4)
| ~ frontsegP(X1,X4) )
& neq(X1,nil) )
| ( nil = X1
& nil != X0 ) )
& ssList(X3) ) ) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( X1 != X3
| ~ ssList(X3)
| ( ( ~ neq(X2,nil)
| ~ frontsegP(X3,X2) )
& ( nil != X3
| nil != X2 ) )
| ( ( nil != X1
| nil = X0 )
& ( ~ neq(X1,nil)
| ? [X4] :
( neq(X4,nil)
& frontsegP(X0,X4)
& ssList(X4)
& frontsegP(X1,X4) ) ) )
| X0 != X2 ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( X1 != X3
| ~ ssList(X3)
| ( ( ~ neq(X2,nil)
| ~ frontsegP(X3,X2) )
& ( nil != X3
| nil != X2 ) )
| ( ( nil != X1
| nil = X0 )
& ( ~ neq(X1,nil)
| ? [X4] :
( neq(X4,nil)
& frontsegP(X0,X4)
& ssList(X4)
& frontsegP(X1,X4) ) ) )
| X0 != X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f606,plain,
( frontsegP(sK11,sK10)
| ~ spl57_4 ),
inference(avatar_component_clause,[],[f605]) ).
fof(f605,plain,
( spl57_4
<=> frontsegP(sK11,sK10) ),
introduced(avatar_definition,[new_symbols(naming,[spl57_4])]) ).
fof(f754,plain,
( nil != sK10
| spl57_7 ),
inference(superposition,[],[f618,f384]) ).
fof(f384,plain,
sK10 = sK8,
inference(cnf_transformation,[],[f248]) ).
fof(f618,plain,
( nil != sK8
| spl57_7 ),
inference(avatar_component_clause,[],[f617]) ).
fof(f617,plain,
( spl57_7
<=> nil = sK8 ),
introduced(avatar_definition,[new_symbols(naming,[spl57_7])]) ).
fof(f386,plain,
ssList(sK10),
inference(cnf_transformation,[],[f248]) ).
fof(f772,plain,
( ~ spl57_6
| ~ spl57_8 ),
inference(avatar_contradiction_clause,[],[f770]) ).
fof(f770,plain,
( $false
| ~ spl57_6
| ~ spl57_8 ),
inference(unit_resulting_resolution,[],[f558,f757,f593]) ).
fof(f593,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f572]) ).
fof(f572,plain,
! [X1] :
( ~ ssList(X1)
| ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f431]) ).
fof(f431,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| X0 != X1
| ~ neq(X0,X1) ),
inference(cnf_transformation,[],[f272]) ).
fof(f272,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) ) ) ),
inference(nnf_transformation,[],[f107]) ).
fof(f107,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(f757,plain,
( neq(nil,nil)
| ~ spl57_6
| ~ spl57_8 ),
inference(backward_demodulation,[],[f615,f622]) ).
fof(f615,plain,
( neq(sK9,nil)
| ~ spl57_6 ),
inference(avatar_component_clause,[],[f614]) ).
fof(f614,plain,
( spl57_6
<=> neq(sK9,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl57_6])]) ).
fof(f558,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f752,plain,
spl57_20,
inference(avatar_contradiction_clause,[],[f750]) ).
fof(f750,plain,
( $false
| spl57_20 ),
inference(unit_resulting_resolution,[],[f386,f689,f354]) ).
fof(f354,plain,
! [X0] :
( frontsegP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f153]) ).
fof(f153,plain,
! [X0] :
( frontsegP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f42]) ).
fof(f42,axiom,
! [X0] :
( ssList(X0)
=> frontsegP(X0,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax42) ).
fof(f689,plain,
( ~ frontsegP(sK10,sK10)
| spl57_20 ),
inference(avatar_component_clause,[],[f688]) ).
fof(f688,plain,
( spl57_20
<=> frontsegP(sK10,sK10) ),
introduced(avatar_definition,[new_symbols(naming,[spl57_20])]) ).
fof(f714,plain,
( spl57_8
| ~ spl57_12 ),
inference(avatar_split_clause,[],[f713,f636,f621]) ).
fof(f636,plain,
( spl57_12
<=> nil = sK11 ),
introduced(avatar_definition,[new_symbols(naming,[spl57_12])]) ).
fof(f713,plain,
( nil = sK9
| ~ spl57_12 ),
inference(backward_demodulation,[],[f385,f637]) ).
fof(f637,plain,
( nil = sK11
| ~ spl57_12 ),
inference(avatar_component_clause,[],[f636]) ).
fof(f712,plain,
( ~ spl57_3
| spl57_7 ),
inference(avatar_contradiction_clause,[],[f708]) ).
fof(f708,plain,
( $false
| ~ spl57_3
| spl57_7 ),
inference(unit_resulting_resolution,[],[f658,f603]) ).
fof(f603,plain,
( nil = sK10
| ~ spl57_3 ),
inference(avatar_component_clause,[],[f602]) ).
fof(f602,plain,
( spl57_3
<=> nil = sK10 ),
introduced(avatar_definition,[new_symbols(naming,[spl57_3])]) ).
fof(f658,plain,
( nil != sK10
| spl57_7 ),
inference(superposition,[],[f618,f384]) ).
fof(f701,plain,
( ~ spl57_4
| spl57_19 ),
inference(avatar_contradiction_clause,[],[f698]) ).
fof(f698,plain,
( $false
| ~ spl57_4
| spl57_19 ),
inference(unit_resulting_resolution,[],[f657,f686]) ).
fof(f686,plain,
( ~ frontsegP(sK9,sK10)
| spl57_19 ),
inference(avatar_component_clause,[],[f685]) ).
fof(f685,plain,
( spl57_19
<=> frontsegP(sK9,sK10) ),
introduced(avatar_definition,[new_symbols(naming,[spl57_19])]) ).
fof(f657,plain,
( frontsegP(sK9,sK10)
| ~ spl57_4 ),
inference(forward_demodulation,[],[f606,f385]) ).
fof(f697,plain,
spl57_21,
inference(avatar_contradiction_clause,[],[f695]) ).
fof(f695,plain,
( $false
| spl57_21 ),
inference(resolution,[],[f692,f386]) ).
fof(f692,plain,
( ~ ssList(sK10)
| spl57_21 ),
inference(avatar_component_clause,[],[f691]) ).
fof(f691,plain,
( spl57_21
<=> ssList(sK10) ),
introduced(avatar_definition,[new_symbols(naming,[spl57_21])]) ).
fof(f693,plain,
( ~ spl57_19
| ~ spl57_20
| ~ spl57_21
| ~ spl57_9
| ~ spl57_11 ),
inference(avatar_split_clause,[],[f672,f632,f624,f691,f688,f685]) ).
fof(f624,plain,
( spl57_9
<=> ! [X4] :
( ~ neq(X4,nil)
| ~ ssList(X4)
| ~ frontsegP(sK8,X4)
| ~ frontsegP(sK9,X4) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl57_9])]) ).
fof(f632,plain,
( spl57_11
<=> neq(sK10,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl57_11])]) ).
fof(f672,plain,
( ~ ssList(sK10)
| ~ frontsegP(sK10,sK10)
| ~ frontsegP(sK9,sK10)
| ~ spl57_9
| ~ spl57_11 ),
inference(resolution,[],[f667,f633]) ).
fof(f633,plain,
( neq(sK10,nil)
| ~ spl57_11 ),
inference(avatar_component_clause,[],[f632]) ).
fof(f667,plain,
( ! [X4] :
( ~ neq(X4,nil)
| ~ frontsegP(sK10,X4)
| ~ ssList(X4)
| ~ frontsegP(sK9,X4) )
| ~ spl57_9 ),
inference(forward_demodulation,[],[f625,f384]) ).
fof(f625,plain,
( ! [X4] :
( ~ neq(X4,nil)
| ~ frontsegP(sK9,X4)
| ~ ssList(X4)
| ~ frontsegP(sK8,X4) )
| ~ spl57_9 ),
inference(avatar_component_clause,[],[f624]) ).
fof(f643,plain,
( spl57_12
| spl57_4 ),
inference(avatar_split_clause,[],[f382,f605,f636]) ).
fof(f382,plain,
( frontsegP(sK11,sK10)
| nil = sK11 ),
inference(cnf_transformation,[],[f248]) ).
fof(f638,plain,
( spl57_12
| spl57_11 ),
inference(avatar_split_clause,[],[f380,f632,f636]) ).
fof(f380,plain,
( neq(sK10,nil)
| nil = sK11 ),
inference(cnf_transformation,[],[f248]) ).
fof(f626,plain,
( spl57_8
| spl57_9 ),
inference(avatar_split_clause,[],[f379,f624,f621]) ).
fof(f379,plain,
! [X4] :
( ~ neq(X4,nil)
| ~ frontsegP(sK9,X4)
| ~ frontsegP(sK8,X4)
| nil = sK9
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f248]) ).
fof(f619,plain,
( spl57_6
| ~ spl57_7 ),
inference(avatar_split_clause,[],[f376,f617,f614]) ).
fof(f376,plain,
( nil != sK8
| neq(sK9,nil) ),
inference(cnf_transformation,[],[f248]) ).
fof(f607,plain,
( spl57_3
| spl57_4 ),
inference(avatar_split_clause,[],[f383,f605,f602]) ).
fof(f383,plain,
( frontsegP(sK11,sK10)
| nil = sK10 ),
inference(cnf_transformation,[],[f248]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC017+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/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.34 % Computer : n024.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % 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 17:57:34 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.46 % (26938)lrs+10_1:4_av=off:bs=unit_only:bsr=unit_only:ep=RS:s2a=on:sos=on:sp=frequency:to=lpo:i=16:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.19/0.47 % (26953)dis+21_1:1_aac=none:abs=on:er=known:fde=none:fsr=off:nwc=5.0:s2a=on:s2at=4.0:sp=const_frequency:to=lpo:urr=ec_only:i=25:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/25Mi)
% 0.19/0.48 % (26938)Instruction limit reached!
% 0.19/0.48 % (26938)------------------------------
% 0.19/0.48 % (26938)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.48 % (26945)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.19/0.48 % (26952)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)
% 0.19/0.49 % (26945)Instruction limit reached!
% 0.19/0.49 % (26945)------------------------------
% 0.19/0.49 % (26945)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.49 % (26953)First to succeed.
% 0.19/0.49 % (26938)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.49 % (26938)Termination reason: Unknown
% 0.19/0.49 % (26938)Termination phase: Saturation
% 0.19/0.49
% 0.19/0.49 % (26938)Memory used [KB]: 2046
% 0.19/0.49 % (26938)Time elapsed: 0.091 s
% 0.19/0.49 % (26938)Instructions burned: 16 (million)
% 0.19/0.49 % (26938)------------------------------
% 0.19/0.49 % (26938)------------------------------
% 0.19/0.50 % (26945)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50 % (26945)Termination reason: Unknown
% 0.19/0.50 % (26945)Termination phase: Saturation
% 0.19/0.50
% 0.19/0.50 % (26945)Memory used [KB]: 6268
% 0.19/0.50 % (26945)Time elapsed: 0.106 s
% 0.19/0.50 % (26945)Instructions burned: 12 (million)
% 0.19/0.50 % (26945)------------------------------
% 0.19/0.50 % (26945)------------------------------
% 0.19/0.50 % (26953)Refutation found. Thanks to Tanya!
% 0.19/0.50 % SZS status Theorem for theBenchmark
% 0.19/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.50 % (26953)------------------------------
% 0.19/0.50 % (26953)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50 % (26953)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50 % (26953)Termination reason: Refutation
% 0.19/0.50
% 0.19/0.50 % (26953)Memory used [KB]: 6524
% 0.19/0.50 % (26953)Time elapsed: 0.115 s
% 0.19/0.50 % (26953)Instructions burned: 15 (million)
% 0.19/0.50 % (26953)------------------------------
% 0.19/0.50 % (26953)------------------------------
% 0.19/0.50 % (26925)Success in time 0.157 s
%------------------------------------------------------------------------------