%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : PUZ016-1 : TPTP v8.1.0. Released v1.0.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 : n019.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:10:41 EDT 2022

% Result   : Unsatisfiable 0.20s 0.52s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   29
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   44 (  42 unt;   0 def)
%            Number of atoms       :   46 (  10 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :    6 (   4   ~;   2   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   15 (  15 usr;  11 con; 0-8 aty)
%            Number of variables   :   16 (  16   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f121,plain,
    $false,
    inference(subsumption_resolution,[],[f120,f24]) ).

fof(f24,plain,
    ~ achievable(row(n8),squares(covered,not_covered,not_covered,covered,covered,covered,covered,covered)),
    inference(resolution,[],[f21,f2]) ).

fof(f2,axiom,
    ! [X2,X3,X0,X6,X7,X4,X5] :
      ( achievable(row(X0),squares(X7,covered,covered,X2,X3,X4,X5,X6))
      | ~ achievable(row(X0),squares(X7,not_covered,not_covered,X2,X3,X4,X5,X6)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cover_columns_2_and_3) ).

fof(f21,axiom,
    ~ achievable(row(n8),squares(covered,covered,covered,covered,covered,covered,covered,covered)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_row_8_can_be_covered) ).

fof(f120,plain,
    achievable(row(n8),squares(covered,not_covered,not_covered,covered,covered,covered,covered,covered)),
    inference(forward_demodulation,[],[f119,f15]) ).

fof(f15,axiom,
    successor(n7) = n8,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_of_7_is_8) ).

fof(f119,plain,
    achievable(row(successor(n7)),squares(covered,not_covered,not_covered,covered,covered,covered,covered,covered)),
    inference(forward_demodulation,[],[f118,f17]) ).

fof(f17,axiom,
    not_covered = complement(covered),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',complement_of_covered_is_not_covered) ).

fof(f118,plain,
    achievable(row(successor(n7)),squares(covered,complement(covered),complement(covered),covered,covered,covered,covered,covered)),
    inference(forward_demodulation,[],[f117,f18]) ).

fof(f18,axiom,
    covered = complement(not_covered),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',complement_of_not_covered_is_covered) ).

fof(f117,plain,
    achievable(row(successor(n7)),squares(complement(not_covered),complement(covered),complement(covered),complement(not_covered),complement(not_covered),complement(not_covered),complement(not_covered),complement(not_covered))),
    inference(resolution,[],[f116,f8]) ).

fof(f8,axiom,
    ! [X2,X3,X0,X1,X8,X6,X7,X4,X5] :
      ( ~ achievable(row(X0),squares(X7,X8,X1,X2,X3,X4,X5,X6))
      | achievable(row(successor(X0)),squares(complement(X7),complement(X8),complement(X1),complement(X2),complement(X3),complement(X4),complement(X5),complement(X6))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',place_vertical_pieces) ).

fof(f116,plain,
    achievable(row(n7),squares(not_covered,covered,covered,not_covered,not_covered,not_covered,not_covered,not_covered)),
    inference(forward_demodulation,[],[f115,f14]) ).

fof(f14,axiom,
    successor(n6) = n7,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_of_6_is_7) ).

fof(f115,plain,
    achievable(row(successor(n6)),squares(not_covered,covered,covered,not_covered,not_covered,not_covered,not_covered,not_covered)),
    inference(forward_demodulation,[],[f114,f18]) ).

fof(f114,plain,
    achievable(row(successor(n6)),squares(not_covered,complement(not_covered),complement(not_covered),not_covered,not_covered,not_covered,not_covered,not_covered)),
    inference(forward_demodulation,[],[f113,f17]) ).

fof(f113,plain,
    achievable(row(successor(n6)),squares(complement(covered),complement(not_covered),complement(not_covered),complement(covered),complement(covered),complement(covered),complement(covered),complement(covered))),
    inference(resolution,[],[f112,f8]) ).

fof(f112,plain,
    achievable(row(n6),squares(covered,not_covered,not_covered,covered,covered,covered,covered,covered)),
    inference(forward_demodulation,[],[f111,f13]) ).

fof(f13,axiom,
    successor(n5) = n6,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_of_5_is_6) ).

fof(f111,plain,
    achievable(row(successor(n5)),squares(covered,not_covered,not_covered,covered,covered,covered,covered,covered)),
    inference(forward_demodulation,[],[f110,f17]) ).

fof(f110,plain,
    achievable(row(successor(n5)),squares(covered,complement(covered),complement(covered),covered,covered,covered,covered,covered)),
    inference(forward_demodulation,[],[f109,f18]) ).

fof(f109,plain,
    achievable(row(successor(n5)),squares(complement(not_covered),complement(covered),complement(covered),complement(not_covered),complement(not_covered),complement(not_covered),complement(not_covered),complement(not_covered))),
    inference(resolution,[],[f108,f8]) ).

fof(f108,plain,
    achievable(row(n5),squares(not_covered,covered,covered,not_covered,not_covered,not_covered,not_covered,not_covered)),
    inference(forward_demodulation,[],[f107,f12]) ).

fof(f12,axiom,
    successor(n4) = n5,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_of_4_is_5) ).

fof(f107,plain,
    achievable(row(successor(n4)),squares(not_covered,covered,covered,not_covered,not_covered,not_covered,not_covered,not_covered)),
    inference(forward_demodulation,[],[f106,f18]) ).

fof(f106,plain,
    achievable(row(successor(n4)),squares(not_covered,complement(not_covered),complement(not_covered),not_covered,not_covered,not_covered,not_covered,not_covered)),
    inference(forward_demodulation,[],[f105,f17]) ).

fof(f105,plain,
    achievable(row(successor(n4)),squares(complement(covered),complement(not_covered),complement(not_covered),complement(covered),complement(covered),complement(covered),complement(covered),complement(covered))),
    inference(resolution,[],[f100,f8]) ).

fof(f100,plain,
    achievable(row(n4),squares(covered,not_covered,not_covered,covered,covered,covered,covered,covered)),
    inference(forward_demodulation,[],[f99,f11]) ).

fof(f11,axiom,
    successor(n3) = n4,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_of_3_is_4) ).

fof(f99,plain,
    achievable(row(successor(n3)),squares(covered,not_covered,not_covered,covered,covered,covered,covered,covered)),
    inference(forward_demodulation,[],[f98,f17]) ).

fof(f98,plain,
    achievable(row(successor(n3)),squares(covered,complement(covered),complement(covered),covered,covered,covered,covered,covered)),
    inference(forward_demodulation,[],[f97,f18]) ).

fof(f97,plain,
    achievable(row(successor(n3)),squares(complement(not_covered),complement(covered),complement(covered),complement(not_covered),complement(not_covered),complement(not_covered),complement(not_covered),complement(not_covered))),
    inference(resolution,[],[f66,f8]) ).

fof(f66,plain,
    achievable(row(n3),squares(not_covered,covered,covered,not_covered,not_covered,not_covered,not_covered,not_covered)),
    inference(forward_demodulation,[],[f65,f10]) ).

fof(f10,axiom,
    successor(n2) = n3,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_of_2_is_3) ).

fof(f65,plain,
    achievable(row(successor(n2)),squares(not_covered,covered,covered,not_covered,not_covered,not_covered,not_covered,not_covered)),
    inference(forward_demodulation,[],[f64,f18]) ).

fof(f64,plain,
    achievable(row(successor(n2)),squares(not_covered,complement(not_covered),complement(not_covered),not_covered,not_covered,not_covered,not_covered,not_covered)),
    inference(forward_demodulation,[],[f63,f17]) ).

fof(f63,plain,
    achievable(row(successor(n2)),squares(complement(covered),complement(not_covered),complement(not_covered),complement(covered),complement(covered),complement(covered),complement(covered),complement(covered))),
    inference(resolution,[],[f32,f8]) ).

fof(f32,plain,
    achievable(row(n2),squares(covered,not_covered,not_covered,covered,covered,covered,covered,covered)),
    inference(forward_demodulation,[],[f31,f9]) ).

fof(f9,axiom,
    successor(n1) = n2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_of_1_is_2) ).

fof(f31,plain,
    achievable(row(successor(n1)),squares(covered,not_covered,not_covered,covered,covered,covered,covered,covered)),
    inference(forward_demodulation,[],[f30,f19]) ).

fof(f19,axiom,
    not_covered = complement(removed),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',complement_of_removed_is_not_covered) ).

fof(f30,plain,
    achievable(row(successor(n1)),squares(covered,complement(removed),complement(removed),covered,covered,covered,covered,covered)),
    inference(forward_demodulation,[],[f29,f18]) ).

fof(f29,plain,
    achievable(row(successor(n1)),squares(complement(not_covered),complement(removed),complement(removed),complement(not_covered),complement(not_covered),complement(not_covered),complement(not_covered),complement(not_covered))),
    inference(resolution,[],[f20,f8]) ).

fof(f20,axiom,
    achievable(row(n1),squares(not_covered,removed,removed,not_covered,not_covered,not_covered,not_covered,not_covered)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',first_row_initially) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : PUZ016-1 : TPTP v8.1.0. Released v1.0.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 : n019.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 10:39:35 EDT 2022
% 0.14/0.35  % CPUTime    : 
% 0.20/0.49  % (30872)lrs+1004_1:734_av=off:awrs=converge:awrsf=70:br=off:ep=RSTC:erd=off:gs=on:nwc=3.0:s2a=on:s2agt=16:sp=occurrence:updr=off:urr=on:i=6:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/6Mi)
% 0.20/0.50  % (30868)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.20/0.50  % (30870)lrs+1011_1:1_atotf=0.0306256:ep=RST:mep=off:nm=0:sos=all:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.50  % (30881)lrs+1011_1:1_afp=100000:afr=on:amm=sco:bd=preordered:cond=fast:newcnf=on:nm=4:sos=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.51  % (30863)lrs+10_1:16_awrs=converge:awrsf=40:br=off:ep=RSTC:flr=on:gsp=on:nwc=3.0:sos=on:urr=on:i=4:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/4Mi)
% 0.20/0.51  % (30863)Instruction limit reached!
% 0.20/0.51  % (30863)------------------------------
% 0.20/0.51  % (30863)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51  % (30863)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51  % (30863)Termination reason: Unknown
% 0.20/0.51  % (30863)Termination phase: Saturation
% 0.20/0.51  
% 0.20/0.51  % (30863)Memory used [KB]: 5884
% 0.20/0.51  % (30863)Time elapsed: 0.108 s
% 0.20/0.51  % (30863)Instructions burned: 5 (million)
% 0.20/0.51  % (30863)------------------------------
% 0.20/0.51  % (30863)------------------------------
% 0.20/0.51  % (30870)Instruction limit reached!
% 0.20/0.51  % (30870)------------------------------
% 0.20/0.51  % (30870)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51  % (30872)Instruction limit reached!
% 0.20/0.51  % (30872)------------------------------
% 0.20/0.51  % (30872)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51  % (30872)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51  % (30872)Termination reason: Unknown
% 0.20/0.51  % (30872)Termination phase: Saturation
% 0.20/0.51  
% 0.20/0.51  % (30872)Memory used [KB]: 6012
% 0.20/0.51  % (30872)Time elapsed: 0.108 s
% 0.20/0.51  % (30872)Instructions burned: 8 (million)
% 0.20/0.51  % (30872)------------------------------
% 0.20/0.51  % (30872)------------------------------
% 0.20/0.51  % (30861)lrs+10_1:1_kws=precedence:lwlo=on:tgt=ground:i=99966:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99966Mi)
% 0.20/0.51  % (30870)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51  % (30870)Termination reason: Unknown
% 0.20/0.51  % (30870)Termination phase: Saturation
% 0.20/0.51  
% 0.20/0.51  % (30870)Memory used [KB]: 5884
% 0.20/0.51  % (30870)Time elapsed: 0.090 s
% 0.20/0.51  % (30870)Instructions burned: 4 (million)
% 0.20/0.51  % (30870)------------------------------
% 0.20/0.51  % (30870)------------------------------
% 0.20/0.51  % (30889)lrs+10_1:1_av=off:sd=2:sos=on:sp=reverse_arity:ss=axioms:to=lpo:i=73:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/73Mi)
% 0.20/0.51  % (30889)Refutation not found, incomplete strategy% (30889)------------------------------
% 0.20/0.51  % (30889)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52  % (30876)dis+1011_3:29_av=off:awrs=decay:awrsf=32:bce=on:drc=off:fde=unused:gsp=on:irw=on:nwc=2.0:spb=goal_then_units:updr=off:urr=ec_only:i=29:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/29Mi)
% 0.20/0.52  % (30889)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52  % (30889)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.52  
% 0.20/0.52  % (30889)Memory used [KB]: 1407
% 0.20/0.52  % (30889)Time elapsed: 0.121 s
% 0.20/0.52  % (30889)Instructions burned: 2 (million)
% 0.20/0.52  % (30889)------------------------------
% 0.20/0.52  % (30889)------------------------------
% 0.20/0.52  % (30878)lrs+1_1:1_aac=none:add=large:anc=all_dependent:cond=fast:ep=RST:fsr=off:lma=on:nm=2:sos=on:sp=reverse_arity:stl=30:uhcvi=on:urr=on:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.52  % (30881)First to succeed.
% 0.20/0.52  % (30881)Refutation found. Thanks to Tanya!
% 0.20/0.52  % SZS status Unsatisfiable for theBenchmark
% 0.20/0.52  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.52  % (30881)------------------------------
% 0.20/0.52  % (30881)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52  % (30881)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52  % (30881)Termination reason: Refutation
% 0.20/0.52  
% 0.20/0.52  % (30881)Memory used [KB]: 6012
% 0.20/0.52  % (30881)Time elapsed: 0.125 s
% 0.20/0.52  % (30881)Instructions burned: 6 (million)
% 0.20/0.52  % (30881)------------------------------
% 0.20/0.52  % (30881)------------------------------
% 0.20/0.52  % (30860)Success in time 0.159 s
%------------------------------------------------------------------------------