TSTP Solution File: ANA002-2 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : ANA002-2 : TPTP v8.1.2. Bugfixed v1.0.1.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n025.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 : Sun May 5 04:31:28 EDT 2024
% Result : Unsatisfiable 136.08s 19.76s
% Output : Refutation 136.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 33
% Syntax : Number of formulae : 99 ( 10 unt; 0 def)
% Number of atoms : 258 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 265 ( 106 ~; 144 |; 0 &)
% ( 15 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 18 ( 17 usr; 16 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 46 ( 46 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f514958,plain,
$false,
inference(avatar_sat_refutation,[],[f40,f57,f62,f83,f12512,f12535,f12562,f12613,f17715,f18008,f115438,f115494,f499829,f500021,f501949,f514957]) ).
fof(f514957,plain,
( spl0_31
| ~ spl0_111
| spl0_38 ),
inference(avatar_split_clause,[],[f22365,f17712,f184956,f12509]) ).
fof(f12509,plain,
( spl0_31
<=> less_than_or_equal(l,h(l)) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_31])]) ).
fof(f184956,plain,
( spl0_111
<=> less_than_or_equal(g(h(l)),upper_bound) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_111])]) ).
fof(f17712,plain,
( spl0_38
<=> less_than_or_equal(g(h(l)),l) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_38])]) ).
fof(f22365,plain,
( ~ less_than_or_equal(g(h(l)),upper_bound)
| less_than_or_equal(l,h(l))
| spl0_38 ),
inference(resolution,[],[f17714,f42]) ).
fof(f42,plain,
! [X0] :
( less_than_or_equal(g(X0),l)
| ~ less_than_or_equal(g(X0),upper_bound)
| less_than_or_equal(l,X0) ),
inference(resolution,[],[f11,f13]) ).
fof(f13,axiom,
! [X1] :
( less_than_or_equal(f(g(X1)),n0)
| less_than_or_equal(l,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',crossover3_and_g_function2) ).
fof(f11,axiom,
! [X1] :
( ~ less_than_or_equal(f(X1),n0)
| less_than_or_equal(X1,l)
| ~ less_than_or_equal(X1,upper_bound) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',crossover1) ).
fof(f17714,plain,
( ~ less_than_or_equal(g(h(l)),l)
| spl0_38 ),
inference(avatar_component_clause,[],[f17712]) ).
fof(f501949,plain,
( spl0_31
| spl0_111 ),
inference(avatar_contradiction_clause,[],[f501780]) ).
fof(f501780,plain,
( $false
| spl0_31
| spl0_111 ),
inference(resolution,[],[f184960,f12511]) ).
fof(f12511,plain,
( ~ less_than_or_equal(l,h(l))
| spl0_31 ),
inference(avatar_component_clause,[],[f12509]) ).
fof(f184960,plain,
( less_than_or_equal(l,h(l))
| spl0_111 ),
inference(resolution,[],[f184958,f12]) ).
fof(f12,axiom,
! [X1] :
( less_than_or_equal(g(X1),upper_bound)
| less_than_or_equal(l,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',crossover2_and_g_function1) ).
fof(f184958,plain,
( ~ less_than_or_equal(g(h(l)),upper_bound)
| spl0_111 ),
inference(avatar_component_clause,[],[f184956]) ).
fof(f500021,plain,
( spl0_5
| ~ spl0_13
| spl0_146 ),
inference(avatar_contradiction_clause,[],[f499919]) ).
fof(f499919,plain,
( $false
| spl0_5
| ~ spl0_13
| spl0_146 ),
inference(resolution,[],[f499834,f2704]) ).
fof(f2704,plain,
( less_than_or_equal(k(l),upper_bound)
| ~ spl0_13 ),
inference(avatar_component_clause,[],[f2703]) ).
fof(f2703,plain,
( spl0_13
<=> less_than_or_equal(k(l),upper_bound) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_13])]) ).
fof(f499834,plain,
( ~ less_than_or_equal(k(l),upper_bound)
| spl0_5
| spl0_146 ),
inference(resolution,[],[f321473,f6040]) ).
fof(f6040,plain,
( ! [X0] :
( less_than_or_equal(q(l,k(l)),X0)
| ~ less_than_or_equal(k(l),X0) )
| spl0_5 ),
inference(resolution,[],[f2040,f3]) ).
fof(f3,axiom,
! [X3,X1] :
( less_than_or_equal(X3,X1)
| less_than_or_equal(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',totality_of_less) ).
fof(f2040,plain,
( ! [X0] :
( ~ less_than_or_equal(X0,q(l,k(l)))
| ~ less_than_or_equal(k(l),X0) )
| spl0_5 ),
inference(resolution,[],[f408,f2]) ).
fof(f2,axiom,
! [X1] : less_than_or_equal(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_of_less) ).
fof(f408,plain,
( ! [X0,X1] :
( ~ less_than_or_equal(k(l),X0)
| ~ less_than_or_equal(X0,X1)
| ~ less_than_or_equal(X1,q(l,k(l))) )
| spl0_5 ),
inference(resolution,[],[f100,f78]) ).
fof(f78,plain,
( ~ less_than_or_equal(k(l),l)
| spl0_5 ),
inference(avatar_component_clause,[],[f76]) ).
fof(f76,plain,
( spl0_5
<=> less_than_or_equal(k(l),l) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_5])]) ).
fof(f100,plain,
! [X2,X3,X0,X1] :
( less_than_or_equal(X0,X2)
| ~ less_than_or_equal(X0,X1)
| ~ less_than_or_equal(X1,X3)
| ~ less_than_or_equal(X3,q(X2,X0)) ),
inference(resolution,[],[f25,f4]) ).
fof(f4,axiom,
! [X3,X1,X4] :
( less_than_or_equal(X1,X4)
| ~ less_than_or_equal(X1,X3)
| ~ less_than_or_equal(X3,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_of_less) ).
fof(f25,plain,
! [X2,X0,X1] :
( ~ less_than_or_equal(X1,q(X2,X0))
| ~ less_than_or_equal(X0,X1)
| less_than_or_equal(X0,X2) ),
inference(resolution,[],[f4,f5]) ).
fof(f5,axiom,
! [X3,X1] :
( ~ less_than_or_equal(X1,q(X3,X1))
| less_than_or_equal(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',interpolation1) ).
fof(f321473,plain,
( ~ less_than_or_equal(q(l,k(l)),upper_bound)
| spl0_146 ),
inference(avatar_component_clause,[],[f321471]) ).
fof(f321471,plain,
( spl0_146
<=> less_than_or_equal(q(l,k(l)),upper_bound) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_146])]) ).
fof(f499829,plain,
( spl0_1
| ~ spl0_146
| spl0_5
| ~ spl0_6 ),
inference(avatar_split_clause,[],[f15680,f80,f76,f321471,f33]) ).
fof(f33,plain,
( spl0_1
<=> less_than_or_equal(n0,f(l)) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).
fof(f80,plain,
( spl0_6
<=> in_interval(lower_bound,l,upper_bound) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_6])]) ).
fof(f15680,plain,
( ~ in_interval(lower_bound,l,upper_bound)
| less_than_or_equal(k(l),l)
| ~ less_than_or_equal(q(l,k(l)),upper_bound)
| less_than_or_equal(n0,f(l)) ),
inference(duplicate_literal_removal,[],[f15634]) ).
fof(f15634,plain,
( ~ in_interval(lower_bound,l,upper_bound)
| less_than_or_equal(k(l),l)
| ~ less_than_or_equal(q(l,k(l)),upper_bound)
| less_than_or_equal(n0,f(l))
| less_than_or_equal(k(l),l) ),
inference(resolution,[],[f816,f6]) ).
fof(f6,axiom,
! [X3,X1] :
( ~ less_than_or_equal(q(X1,X3),X1)
| less_than_or_equal(X3,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',interpolation2) ).
fof(f816,plain,
! [X0] :
( less_than_or_equal(q(X0,k(X0)),l)
| ~ in_interval(lower_bound,X0,upper_bound)
| less_than_or_equal(k(X0),X0)
| ~ less_than_or_equal(q(X0,k(X0)),upper_bound)
| less_than_or_equal(n0,f(X0)) ),
inference(resolution,[],[f194,f44]) ).
fof(f44,plain,
! [X0] :
( less_than_or_equal(n0,f(X0))
| ~ less_than_or_equal(X0,upper_bound)
| less_than_or_equal(X0,l) ),
inference(resolution,[],[f11,f3]) ).
fof(f194,plain,
! [X0] :
( ~ less_than_or_equal(n0,f(q(X0,k(X0))))
| less_than_or_equal(n0,f(X0))
| ~ in_interval(lower_bound,X0,upper_bound)
| less_than_or_equal(k(X0),X0) ),
inference(duplicate_literal_removal,[],[f187]) ).
fof(f187,plain,
! [X0] :
( ~ less_than_or_equal(n0,f(q(X0,k(X0))))
| less_than_or_equal(n0,f(X0))
| ~ in_interval(lower_bound,X0,upper_bound)
| less_than_or_equal(k(X0),X0)
| less_than_or_equal(k(X0),X0) ),
inference(resolution,[],[f69,f23]) ).
fof(f23,plain,
! [X0,X1] :
( less_than_or_equal(X1,q(X1,X0))
| less_than_or_equal(X0,X1) ),
inference(resolution,[],[f6,f3]) ).
fof(f69,plain,
! [X0,X1] :
( ~ less_than_or_equal(n0,f(q(X0,k(X1))))
| ~ less_than_or_equal(X1,q(X0,k(X1)))
| less_than_or_equal(n0,f(X1))
| ~ in_interval(lower_bound,X1,upper_bound)
| less_than_or_equal(k(X1),X0) ),
inference(resolution,[],[f10,f5]) ).
fof(f10,axiom,
! [X3,X1] :
( less_than_or_equal(k(X1),X3)
| ~ less_than_or_equal(n0,f(X3))
| ~ in_interval(lower_bound,X1,upper_bound)
| less_than_or_equal(n0,f(X1))
| ~ less_than_or_equal(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',continuity4) ).
fof(f115494,plain,
spl0_90,
inference(avatar_contradiction_clause,[],[f115439]) ).
fof(f115439,plain,
( $false
| spl0_90 ),
inference(resolution,[],[f115437,f17]) ).
fof(f17,axiom,
less_than_or_equal(n0,f(upper_bound)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',upper_mapping) ).
fof(f115437,plain,
( ~ less_than_or_equal(n0,f(upper_bound))
| spl0_90 ),
inference(avatar_component_clause,[],[f115435]) ).
fof(f115435,plain,
( spl0_90
<=> less_than_or_equal(n0,f(upper_bound)) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_90])]) ).
fof(f115438,plain,
( ~ spl0_32
| spl0_1
| ~ spl0_6
| ~ spl0_90
| spl0_13 ),
inference(avatar_split_clause,[],[f2707,f2703,f115435,f80,f33,f12532]) ).
fof(f12532,plain,
( spl0_32
<=> less_than_or_equal(l,upper_bound) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_32])]) ).
fof(f2707,plain,
( ~ less_than_or_equal(n0,f(upper_bound))
| ~ in_interval(lower_bound,l,upper_bound)
| less_than_or_equal(n0,f(l))
| ~ less_than_or_equal(l,upper_bound)
| spl0_13 ),
inference(resolution,[],[f2705,f10]) ).
fof(f2705,plain,
( ~ less_than_or_equal(k(l),upper_bound)
| spl0_13 ),
inference(avatar_component_clause,[],[f2703]) ).
fof(f18008,plain,
( spl0_31
| spl0_37 ),
inference(avatar_contradiction_clause,[],[f17986]) ).
fof(f17986,plain,
( $false
| spl0_31
| spl0_37 ),
inference(resolution,[],[f17716,f12511]) ).
fof(f17716,plain,
( less_than_or_equal(l,h(l))
| spl0_37 ),
inference(resolution,[],[f17710,f13]) ).
fof(f17710,plain,
( ~ less_than_or_equal(f(g(h(l))),n0)
| spl0_37 ),
inference(avatar_component_clause,[],[f17708]) ).
fof(f17708,plain,
( spl0_37
<=> less_than_or_equal(f(g(h(l))),n0) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_37])]) ).
fof(f17715,plain,
( spl0_31
| ~ spl0_37
| ~ spl0_38
| ~ spl0_33 ),
inference(avatar_split_clause,[],[f16232,f12611,f17712,f17708,f12509]) ).
fof(f12611,plain,
( spl0_33
<=> ! [X0] :
( ~ less_than_or_equal(f(X0),n0)
| ~ less_than_or_equal(X0,l)
| less_than_or_equal(X0,h(l)) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_33])]) ).
fof(f16232,plain,
( ~ less_than_or_equal(g(h(l)),l)
| ~ less_than_or_equal(f(g(h(l))),n0)
| less_than_or_equal(l,h(l))
| ~ spl0_33 ),
inference(resolution,[],[f12612,f14]) ).
fof(f14,axiom,
! [X1] :
( ~ less_than_or_equal(g(X1),X1)
| less_than_or_equal(l,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',crossover4_and_g_function3) ).
fof(f12612,plain,
( ! [X0] :
( less_than_or_equal(X0,h(l))
| ~ less_than_or_equal(X0,l)
| ~ less_than_or_equal(f(X0),n0) )
| ~ spl0_33 ),
inference(avatar_component_clause,[],[f12611]) ).
fof(f12613,plain,
( ~ spl0_6
| spl0_33
| spl0_2 ),
inference(avatar_split_clause,[],[f12425,f37,f12611,f80]) ).
fof(f37,plain,
( spl0_2
<=> less_than_or_equal(f(l),n0) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).
fof(f12425,plain,
( ! [X0] :
( ~ less_than_or_equal(f(X0),n0)
| ~ in_interval(lower_bound,l,upper_bound)
| less_than_or_equal(X0,h(l))
| ~ less_than_or_equal(X0,l) )
| spl0_2 ),
inference(resolution,[],[f39,f8]) ).
fof(f8,axiom,
! [X3,X1] :
( less_than_or_equal(f(X1),n0)
| ~ less_than_or_equal(f(X3),n0)
| ~ in_interval(lower_bound,X1,upper_bound)
| less_than_or_equal(X3,h(X1))
| ~ less_than_or_equal(X3,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',continuity2) ).
fof(f39,plain,
( ~ less_than_or_equal(f(l),n0)
| spl0_2 ),
inference(avatar_component_clause,[],[f37]) ).
fof(f12562,plain,
spl0_32,
inference(avatar_contradiction_clause,[],[f12536]) ).
fof(f12536,plain,
( $false
| spl0_32 ),
inference(resolution,[],[f12534,f21]) ).
fof(f21,plain,
less_than_or_equal(l,upper_bound),
inference(duplicate_literal_removal,[],[f19]) ).
fof(f19,plain,
( less_than_or_equal(l,upper_bound)
| less_than_or_equal(l,upper_bound) ),
inference(resolution,[],[f14,f12]) ).
fof(f12534,plain,
( ~ less_than_or_equal(l,upper_bound)
| spl0_32 ),
inference(avatar_component_clause,[],[f12532]) ).
fof(f12535,plain,
( ~ spl0_32
| ~ spl0_4
| spl0_6 ),
inference(avatar_split_clause,[],[f12513,f80,f54,f12532]) ).
fof(f54,plain,
( spl0_4
<=> less_than_or_equal(lower_bound,l) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_4])]) ).
fof(f12513,plain,
( ~ less_than_or_equal(lower_bound,l)
| ~ less_than_or_equal(l,upper_bound)
| spl0_6 ),
inference(resolution,[],[f82,f1]) ).
fof(f1,axiom,
! [X2,X0,X1] :
( in_interval(X0,X1,X2)
| ~ less_than_or_equal(X0,X1)
| ~ less_than_or_equal(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',in_interval) ).
fof(f82,plain,
( ~ in_interval(lower_bound,l,upper_bound)
| spl0_6 ),
inference(avatar_component_clause,[],[f80]) ).
fof(f12512,plain,
( ~ spl0_31
| ~ spl0_6
| spl0_2 ),
inference(avatar_split_clause,[],[f12426,f37,f80,f12509]) ).
fof(f12426,plain,
( ~ in_interval(lower_bound,l,upper_bound)
| ~ less_than_or_equal(l,h(l))
| spl0_2 ),
inference(resolution,[],[f39,f7]) ).
fof(f7,axiom,
! [X1] :
( less_than_or_equal(f(X1),n0)
| ~ in_interval(lower_bound,X1,upper_bound)
| ~ less_than_or_equal(X1,h(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',continuity1) ).
fof(f83,plain,
( ~ spl0_5
| ~ spl0_6
| spl0_1 ),
inference(avatar_split_clause,[],[f58,f33,f80,f76]) ).
fof(f58,plain,
( ~ in_interval(lower_bound,l,upper_bound)
| ~ less_than_or_equal(k(l),l)
| spl0_1 ),
inference(resolution,[],[f9,f35]) ).
fof(f35,plain,
( ~ less_than_or_equal(n0,f(l))
| spl0_1 ),
inference(avatar_component_clause,[],[f33]) ).
fof(f9,axiom,
! [X1] :
( less_than_or_equal(n0,f(X1))
| ~ in_interval(lower_bound,X1,upper_bound)
| ~ less_than_or_equal(k(X1),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',continuity3) ).
fof(f62,plain,
spl0_3,
inference(avatar_contradiction_clause,[],[f59]) ).
fof(f59,plain,
( $false
| spl0_3 ),
inference(resolution,[],[f52,f15]) ).
fof(f15,axiom,
less_than_or_equal(lower_bound,upper_bound),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',the_interval) ).
fof(f52,plain,
( ~ less_than_or_equal(lower_bound,upper_bound)
| spl0_3 ),
inference(avatar_component_clause,[],[f50]) ).
fof(f50,plain,
( spl0_3
<=> less_than_or_equal(lower_bound,upper_bound) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_3])]) ).
fof(f57,plain,
( ~ spl0_3
| spl0_4 ),
inference(avatar_split_clause,[],[f41,f54,f50]) ).
fof(f41,plain,
( less_than_or_equal(lower_bound,l)
| ~ less_than_or_equal(lower_bound,upper_bound) ),
inference(resolution,[],[f11,f16]) ).
fof(f16,axiom,
less_than_or_equal(f(lower_bound),n0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lower_mapping) ).
fof(f40,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f31,f37,f33]) ).
fof(f31,plain,
( ~ less_than_or_equal(f(l),n0)
| ~ less_than_or_equal(n0,f(l)) ),
inference(resolution,[],[f1,f18]) ).
fof(f18,axiom,
~ in_interval(f(l),n0,f(l)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_there_is_x_which_crosses) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ANA002-2 : TPTP v8.1.2. Bugfixed v1.0.1.
% 0.13/0.13 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.13/0.34 % Computer : n025.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri May 3 15:36:53 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % (14089)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.36 % (14093)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.21/0.36 TRYING [1]
% 0.21/0.36 TRYING [2]
% 0.21/0.36 TRYING [3]
% 0.21/0.36 TRYING [4]
% 0.21/0.36 TRYING [5]
% 0.21/0.36 % (14090)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.21/0.37 % (14092)dis-2_2:3_amm=sco:anc=none:bce=on:fsr=off:gsp=on:nm=16:nwc=1.2:nicw=on:sac=on:sp=weighted_frequency_476 on theBenchmark for (476ds/0Mi)
% 0.21/0.37 % (14091)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.21/0.37 % (14094)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.21/0.37 % (14095)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.21/0.37 % (14096)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2:si=on:rtra=on:rawr=on:rp=on:fmbksg=on_1451 on theBenchmark for (1451ds/0Mi)
% 0.21/0.37 TRYING [1]
% 0.21/0.37 TRYING [2]
% 0.21/0.37 TRYING [1]
% 0.21/0.37 TRYING [1]
% 0.21/0.37 TRYING [2]
% 0.21/0.37 TRYING [2]
% 0.21/0.37 TRYING [6]
% 0.21/0.37 TRYING [3]
% 0.21/0.37 TRYING [3]
% 0.21/0.37 TRYING [3]
% 0.21/0.37 TRYING [4]
% 0.21/0.37 TRYING [4]
% 0.21/0.37 TRYING [4]
% 0.21/0.37 TRYING [7]
% 0.21/0.37 TRYING [5]
% 0.21/0.38 TRYING [5]
% 0.21/0.38 TRYING [5]
% 0.21/0.38 TRYING [6]
% 0.21/0.38 TRYING [6]
% 0.21/0.39 TRYING [6]
% 0.21/0.39 TRYING [8]
% 0.21/0.39 TRYING [7]
% 0.21/0.39 TRYING [7]
% 0.21/0.40 TRYING [7]
% 0.21/0.41 TRYING [8]
% 0.21/0.42 TRYING [9]
% 0.21/0.42 TRYING [8]
% 0.21/0.42 TRYING [8]
% 0.21/0.47 TRYING [9]
% 0.21/0.47 TRYING [9]
% 0.21/0.48 TRYING [9]
% 0.21/0.52 TRYING [10]
% 1.57/0.57 TRYING [10]
% 1.72/0.59 TRYING [10]
% 1.72/0.60 TRYING [10]
% 4.19/0.94 TRYING [11]
% 4.34/0.99 TRYING [11]
% 4.83/1.05 TRYING [11]
% 5.25/1.10 TRYING [11]
% 24.86/3.91 TRYING [12]
% 25.45/4.00 TRYING [12]
% 25.90/4.03 TRYING [12]
% 26.18/4.08 TRYING [12]
% 135.64/19.72 % (14092)First to succeed.
% 135.92/19.72 % (14092)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-14089"
% 136.08/19.76 % (14092)Refutation found. Thanks to Tanya!
% 136.08/19.76 % SZS status Unsatisfiable for theBenchmark
% 136.08/19.76 % SZS output start Proof for theBenchmark
% See solution above
% 136.08/19.76 % (14092)------------------------------
% 136.08/19.76 % (14092)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 136.08/19.76 % (14092)Termination reason: Refutation
% 136.08/19.76
% 136.08/19.76 % (14092)Memory used [KB]: 188613
% 136.08/19.76 % (14092)Time elapsed: 19.357 s
% 136.08/19.76 % (14092)Instructions burned: 67990 (million)
% 136.08/19.76 % (14089)Success in time 19.317 s
%------------------------------------------------------------------------------