TSTP Solution File: SWV007-1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SWV007-1 : TPTP v8.1.2. Released v1.0.0.
% 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 : Tue Apr 30 16:36:06 EDT 2024
% Result : Unsatisfiable 0.14s 0.39s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 33
% Syntax : Number of formulae : 130 ( 31 unt; 0 def)
% Number of atoms : 270 ( 55 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 246 ( 106 ~; 128 |; 0 &)
% ( 12 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 15 ( 13 usr; 13 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-1 aty)
% Number of variables : 63 ( 63 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f321,plain,
$false,
inference(avatar_sat_refutation,[],[f114,f125,f152,f199,f215,f218,f232,f238,f240,f304,f313,f315,f320]) ).
fof(f320,plain,
( ~ spl0_4
| ~ spl0_12 ),
inference(avatar_contradiction_clause,[],[f319]) ).
fof(f319,plain,
( $false
| ~ spl0_4
| ~ spl0_12 ),
inference(subsumption_resolution,[],[f316,f28]) ).
fof(f28,plain,
! [X0] : ~ less_than(successor(X0),X0),
inference(resolution,[],[f10,f6]) ).
fof(f6,axiom,
! [X0] : less_than(X0,successor(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_than_successor) ).
fof(f10,axiom,
! [X0,X1] :
( ~ less_than(X1,X0)
| ~ less_than(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',anti_symmetry_of_less_than) ).
fof(f316,plain,
( less_than(successor(n),n)
| ~ spl0_4
| ~ spl0_12 ),
inference(resolution,[],[f303,f220]) ).
fof(f220,plain,
( ! [X0] :
( ~ less_than(X0,m)
| less_than(X0,n) )
| ~ spl0_4 ),
inference(resolution,[],[f124,f7]) ).
fof(f7,axiom,
! [X2,X0,X1] :
( ~ less_than(X1,X2)
| ~ less_than(X0,X1)
| less_than(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_of_less_than) ).
fof(f124,plain,
( less_than(m,n)
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f122]) ).
fof(f122,plain,
( spl0_4
<=> less_than(m,n) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_4])]) ).
fof(f303,plain,
( less_than(successor(n),m)
| ~ spl0_12 ),
inference(avatar_component_clause,[],[f301]) ).
fof(f301,plain,
( spl0_12
<=> less_than(successor(n),m) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_12])]) ).
fof(f315,plain,
~ spl0_11,
inference(avatar_contradiction_clause,[],[f314]) ).
fof(f314,plain,
( $false
| ~ spl0_11 ),
inference(subsumption_resolution,[],[f311,f16]) ).
fof(f16,axiom,
~ less_than(n,m),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).
fof(f311,plain,
( less_than(n,m)
| ~ spl0_11 ),
inference(superposition,[],[f6,f299]) ).
fof(f299,plain,
( m = successor(n)
| ~ spl0_11 ),
inference(avatar_component_clause,[],[f297]) ).
fof(f297,plain,
( spl0_11
<=> m = successor(n) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_11])]) ).
fof(f313,plain,
( ~ spl0_4
| ~ spl0_11 ),
inference(avatar_contradiction_clause,[],[f312]) ).
fof(f312,plain,
( $false
| ~ spl0_4
| ~ spl0_11 ),
inference(subsumption_resolution,[],[f309,f124]) ).
fof(f309,plain,
( ~ less_than(m,n)
| ~ spl0_11 ),
inference(superposition,[],[f28,f299]) ).
fof(f304,plain,
( spl0_11
| spl0_12 ),
inference(avatar_split_clause,[],[f222,f301,f297]) ).
fof(f222,plain,
( less_than(successor(n),m)
| m = successor(n) ),
inference(resolution,[],[f212,f8]) ).
fof(f8,axiom,
! [X0,X1] :
( less_than(X1,X0)
| less_than(X0,X1)
| X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',all_related) ).
fof(f212,plain,
~ less_than(m,successor(n)),
inference(subsumption_resolution,[],[f208,f31]) ).
fof(f31,plain,
~ less_than(m,i),
inference(resolution,[],[f10,f17]) ).
fof(f17,axiom,
less_than(i,m),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).
fof(f208,plain,
( ~ less_than(m,successor(n))
| less_than(m,i) ),
inference(resolution,[],[f23,f20]) ).
fof(f20,axiom,
less_than(a(m),a(k)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_8) ).
fof(f23,axiom,
! [X0] :
( ~ less_than(a(X0),a(k))
| ~ less_than(X0,successor(n))
| less_than(X0,i) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_11) ).
fof(f240,plain,
( ~ spl0_6
| spl0_7
| ~ spl0_9 ),
inference(avatar_contradiction_clause,[],[f239]) ).
fof(f239,plain,
( $false
| ~ spl0_6
| spl0_7
| ~ spl0_9 ),
inference(subsumption_resolution,[],[f235,f151]) ).
fof(f151,plain,
( less_than(i,k)
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f149]) ).
fof(f149,plain,
( spl0_6
<=> less_than(i,k) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_6])]) ).
fof(f235,plain,
( ~ less_than(i,k)
| spl0_7
| ~ spl0_9 ),
inference(superposition,[],[f193,f227]) ).
fof(f227,plain,
( i = one
| ~ spl0_9 ),
inference(avatar_component_clause,[],[f225]) ).
fof(f225,plain,
( spl0_9
<=> i = one ),
introduced(avatar_definition,[new_symbols(naming,[spl0_9])]) ).
fof(f193,plain,
( ~ less_than(one,k)
| spl0_7 ),
inference(avatar_component_clause,[],[f192]) ).
fof(f192,plain,
( spl0_7
<=> less_than(one,k) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_7])]) ).
fof(f238,plain,
( spl0_7
| spl0_8
| ~ spl0_9 ),
inference(avatar_contradiction_clause,[],[f237]) ).
fof(f237,plain,
( $false
| spl0_7
| spl0_8
| ~ spl0_9 ),
inference(subsumption_resolution,[],[f233,f14]) ).
fof(f14,axiom,
~ less_than(k,i),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).
fof(f233,plain,
( less_than(k,i)
| spl0_7
| spl0_8
| ~ spl0_9 ),
inference(superposition,[],[f204,f227]) ).
fof(f204,plain,
( less_than(k,one)
| spl0_7
| spl0_8 ),
inference(global_subsumption,[],[f22,f13,f14,f15,f16,f17,f18,f19,f9,f20,f5,f6,f1,f2,f10,f30,f31,f32,f28,f33,f29,f3,f36,f4,f39,f35,f41,f38,f43,f7,f45,f46,f47,f50,f52,f48,f54,f56,f55,f51,f61,f62,f63,f49,f64,f65,f66,f8,f68,f71,f72,f73,f75,f87,f90,f91,f92,f94,f97,f99,f78,f80,f81,f21,f153,f154,f155,f101,f100,f82,f23,f197,f193,f202]) ).
fof(f202,plain,
( less_than(k,one)
| k = one
| spl0_7 ),
inference(resolution,[],[f193,f8]) ).
fof(f197,plain,
( k != one
| spl0_8 ),
inference(avatar_component_clause,[],[f196]) ).
fof(f196,plain,
( spl0_8
<=> k = one ),
introduced(avatar_definition,[new_symbols(naming,[spl0_8])]) ).
fof(f82,plain,
( less_than(one,i)
| i = one ),
inference(resolution,[],[f8,f18]) ).
fof(f100,plain,
( less_than(i,k)
| k = i ),
inference(resolution,[],[f8,f14]) ).
fof(f101,plain,
( less_than(one,i)
| i = one ),
inference(resolution,[],[f8,f18]) ).
fof(f155,plain,
! [X0] :
( ~ less_than(a(successor(X0)),a(X0))
| ~ less_than(one,successor(X0))
| ~ less_than(successor(X0),i) ),
inference(superposition,[],[f21,f1]) ).
fof(f154,plain,
! [X0] :
( ~ less_than(one,X0)
| ~ less_than(X0,i)
| less_than(a(predecessor(X0)),a(X0))
| a(X0) = a(predecessor(X0)) ),
inference(resolution,[],[f21,f8]) ).
fof(f153,plain,
! [X0] :
( ~ less_than(one,X0)
| ~ less_than(X0,i)
| less_than(a(predecessor(X0)),a(X0))
| a(X0) = a(predecessor(X0)) ),
inference(resolution,[],[f21,f8]) ).
fof(f21,axiom,
! [X0] :
( ~ less_than(a(X0),a(predecessor(X0)))
| ~ less_than(one,X0)
| ~ less_than(X0,i) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_9) ).
fof(f81,plain,
( less_than(i,k)
| k = i ),
inference(resolution,[],[f8,f14]) ).
fof(f80,plain,
( less_than(m,n)
| n = m ),
inference(resolution,[],[f8,f16]) ).
fof(f78,plain,
( less_than(k,n)
| n = k ),
inference(resolution,[],[f8,f13]) ).
fof(f99,plain,
( less_than(m,n)
| n = m ),
inference(resolution,[],[f8,f16]) ).
fof(f97,plain,
( less_than(k,n)
| n = k ),
inference(resolution,[],[f8,f13]) ).
fof(f94,plain,
( less_than(i,successor(m))
| i = successor(m) ),
inference(resolution,[],[f8,f56]) ).
fof(f92,plain,
! [X0] :
( less_than(a(m),X0)
| a(m) = X0
| less_than(X0,a(k)) ),
inference(resolution,[],[f8,f49]) ).
fof(f91,plain,
! [X0] :
( less_than(i,X0)
| i = X0
| less_than(X0,n) ),
inference(resolution,[],[f8,f47]) ).
fof(f90,plain,
! [X0] :
( less_than(predecessor(i),X0)
| predecessor(i) = X0
| less_than(X0,n) ),
inference(resolution,[],[f8,f51]) ).
fof(f87,plain,
! [X2,X0,X1] :
( less_than(X0,X1)
| X0 = X1
| ~ less_than(X2,X1)
| less_than(X2,X0) ),
inference(resolution,[],[f8,f7]) ).
fof(f75,plain,
( less_than(i,successor(m))
| i = successor(m) ),
inference(resolution,[],[f8,f56]) ).
fof(f73,plain,
! [X0] :
( less_than(a(m),X0)
| a(m) = X0
| less_than(X0,a(k)) ),
inference(resolution,[],[f8,f49]) ).
fof(f72,plain,
! [X0] :
( less_than(i,X0)
| i = X0
| less_than(X0,n) ),
inference(resolution,[],[f8,f47]) ).
fof(f71,plain,
! [X0] :
( less_than(predecessor(i),X0)
| predecessor(i) = X0
| less_than(X0,n) ),
inference(resolution,[],[f8,f51]) ).
fof(f68,plain,
! [X2,X0,X1] :
( less_than(X0,X1)
| X0 = X1
| ~ less_than(X2,X1)
| less_than(X2,X0) ),
inference(resolution,[],[f8,f7]) ).
fof(f66,plain,
~ less_than(a(k),predecessor(a(m))),
inference(resolution,[],[f64,f10]) ).
fof(f65,plain,
! [X0] :
( ~ less_than(X0,predecessor(a(m)))
| less_than(X0,a(k)) ),
inference(resolution,[],[f64,f7]) ).
fof(f64,plain,
less_than(predecessor(a(m)),a(k)),
inference(resolution,[],[f49,f5]) ).
fof(f49,plain,
! [X0] :
( ~ less_than(X0,a(m))
| less_than(X0,a(k)) ),
inference(resolution,[],[f7,f20]) ).
fof(f63,plain,
~ less_than(n,predecessor(predecessor(i))),
inference(resolution,[],[f61,f10]) ).
fof(f62,plain,
! [X0] :
( ~ less_than(X0,predecessor(predecessor(i)))
| less_than(X0,n) ),
inference(resolution,[],[f61,f7]) ).
fof(f61,plain,
less_than(predecessor(predecessor(i)),n),
inference(resolution,[],[f51,f5]) ).
fof(f51,plain,
! [X0] :
( ~ less_than(X0,predecessor(i))
| less_than(X0,n) ),
inference(resolution,[],[f50,f7]) ).
fof(f55,plain,
! [X0] :
( ~ less_than(m,X0)
| ~ less_than(X0,i) ),
inference(resolution,[],[f48,f10]) ).
fof(f56,plain,
~ less_than(successor(m),i),
inference(resolution,[],[f48,f28]) ).
fof(f54,plain,
! [X0,X1] :
( ~ less_than(X0,i)
| ~ less_than(X1,X0)
| less_than(X1,m) ),
inference(resolution,[],[f48,f7]) ).
fof(f48,plain,
! [X0] :
( less_than(X0,m)
| ~ less_than(X0,i) ),
inference(resolution,[],[f7,f17]) ).
fof(f52,plain,
~ less_than(n,predecessor(i)),
inference(resolution,[],[f50,f10]) ).
fof(f50,plain,
less_than(predecessor(i),n),
inference(resolution,[],[f47,f5]) ).
fof(f47,plain,
! [X0] :
( ~ less_than(X0,i)
| less_than(X0,n) ),
inference(resolution,[],[f7,f15]) ).
fof(f46,plain,
! [X0,X1] :
( ~ less_than(X0,predecessor(X1))
| less_than(X0,X1) ),
inference(resolution,[],[f7,f5]) ).
fof(f45,plain,
! [X0,X1] :
( ~ less_than(X0,X1)
| less_than(X0,successor(X1)) ),
inference(resolution,[],[f7,f6]) ).
fof(f43,plain,
! [X0,X1] :
( X0 != X1
| predecessor(X0) = predecessor(X1) ),
inference(superposition,[],[f38,f2]) ).
fof(f38,plain,
! [X0,X1] :
( successor(X1) != X0
| predecessor(X0) = X1 ),
inference(superposition,[],[f4,f2]) ).
fof(f41,plain,
! [X0,X1] :
( X0 != X1
| successor(X0) = successor(X1) ),
inference(superposition,[],[f35,f1]) ).
fof(f35,plain,
! [X0,X1] :
( predecessor(X1) != X0
| successor(X0) = X1 ),
inference(superposition,[],[f3,f1]) ).
fof(f39,plain,
! [X0,X1] :
( successor(X1) != X0
| predecessor(X0) = X1 ),
inference(superposition,[],[f4,f2]) ).
fof(f4,axiom,
! [X0,X1] :
( successor(X0) != successor(X1)
| X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',well_defined_successor) ).
fof(f36,plain,
! [X0,X1] :
( predecessor(X1) != X0
| successor(X0) = X1 ),
inference(superposition,[],[f3,f1]) ).
fof(f3,axiom,
! [X0,X1] :
( predecessor(X0) != predecessor(X1)
| X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',well_defined_predecessor) ).
fof(f29,plain,
! [X0] : ~ less_than(X0,predecessor(X0)),
inference(resolution,[],[f10,f5]) ).
fof(f33,plain,
! [X0] : ~ less_than(X0,predecessor(X0)),
inference(superposition,[],[f28,f2]) ).
fof(f32,plain,
~ less_than(a(k),a(m)),
inference(resolution,[],[f10,f20]) ).
fof(f30,plain,
~ less_than(n,i),
inference(resolution,[],[f10,f15]) ).
fof(f2,axiom,
! [X0] : successor(predecessor(X0)) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_predecessor) ).
fof(f1,axiom,
! [X0] : predecessor(successor(X0)) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',predecessor_successor) ).
fof(f5,axiom,
! [X0] : less_than(predecessor(X0),X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',predecessor_less_than) ).
fof(f9,axiom,
! [X0] : ~ less_than(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x_not_less_than_x) ).
fof(f19,axiom,
k != m,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_7) ).
fof(f18,axiom,
~ less_than(i,one),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).
fof(f15,axiom,
less_than(i,n),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).
fof(f13,axiom,
~ less_than(n,k),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).
fof(f22,axiom,
! [X0] :
( ~ less_than(one,X0)
| less_than(X0,i)
| less_than(n,X0)
| ~ less_than(a(X0),a(predecessor(i))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_10) ).
fof(f232,plain,
( spl0_9
| spl0_10 ),
inference(avatar_split_clause,[],[f82,f229,f225]) ).
fof(f229,plain,
( spl0_10
<=> less_than(one,i) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_10])]) ).
fof(f218,plain,
~ spl0_3,
inference(avatar_contradiction_clause,[],[f217]) ).
fof(f217,plain,
( $false
| ~ spl0_3 ),
inference(subsumption_resolution,[],[f216,f30]) ).
fof(f216,plain,
( less_than(n,i)
| ~ spl0_3 ),
inference(subsumption_resolution,[],[f209,f6]) ).
fof(f209,plain,
( ~ less_than(n,successor(n))
| less_than(n,i)
| ~ spl0_3 ),
inference(resolution,[],[f23,f129]) ).
fof(f129,plain,
( less_than(a(n),a(k))
| ~ spl0_3 ),
inference(superposition,[],[f20,f120]) ).
fof(f120,plain,
( n = m
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f118]) ).
fof(f118,plain,
( spl0_3
<=> n = m ),
introduced(avatar_definition,[new_symbols(naming,[spl0_3])]) ).
fof(f215,plain,
~ spl0_3,
inference(avatar_contradiction_clause,[],[f214]) ).
fof(f214,plain,
( $false
| ~ spl0_3 ),
inference(subsumption_resolution,[],[f213,f6]) ).
fof(f213,plain,
( ~ less_than(n,successor(n))
| ~ spl0_3 ),
inference(forward_demodulation,[],[f212,f120]) ).
fof(f199,plain,
( spl0_7
| spl0_8
| ~ spl0_5 ),
inference(avatar_split_clause,[],[f188,f145,f196,f192]) ).
fof(f145,plain,
( spl0_5
<=> k = i ),
introduced(avatar_definition,[new_symbols(naming,[spl0_5])]) ).
fof(f188,plain,
( k = one
| less_than(one,k)
| ~ spl0_5 ),
inference(forward_demodulation,[],[f187,f147]) ).
fof(f147,plain,
( k = i
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f145]) ).
fof(f187,plain,
( less_than(one,k)
| i = one
| ~ spl0_5 ),
inference(forward_demodulation,[],[f82,f147]) ).
fof(f152,plain,
( spl0_5
| spl0_6 ),
inference(avatar_split_clause,[],[f81,f149,f145]) ).
fof(f125,plain,
( spl0_3
| spl0_4 ),
inference(avatar_split_clause,[],[f80,f122,f118]) ).
fof(f114,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f78,f111,f107]) ).
fof(f107,plain,
( spl0_1
<=> n = k ),
introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).
fof(f111,plain,
( spl0_2
<=> less_than(k,n) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWV007-1 : TPTP v8.1.2. Released v1.0.0.
% 0.12/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.36 % Computer : n025.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Apr 30 05:03:41 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 % (18005)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.38 % (18008)WARNING: value z3 for option sas not known
% 0.14/0.38 % (18008)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.14/0.38 % (18007)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.14/0.38 % (18009)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.14/0.38 % (18010)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.14/0.38 % (18012)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.14/0.38 % (18011)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.14/0.38 TRYING [1]
% 0.14/0.38 TRYING [2]
% 0.14/0.38 TRYING [3]
% 0.14/0.38 % (18006)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.14/0.38 TRYING [4]
% 0.14/0.38 TRYING [1]
% 0.14/0.38 TRYING [2]
% 0.14/0.38 TRYING [3]
% 0.14/0.39 TRYING [5]
% 0.14/0.39 TRYING [1]
% 0.14/0.39 TRYING [4]
% 0.14/0.39 TRYING [2]
% 0.14/0.39 % (18008)First to succeed.
% 0.14/0.39 % (18010)Also succeeded, but the first one will report.
% 0.14/0.39 TRYING [6]
% 0.14/0.39 TRYING [5]
% 0.14/0.39 % (18008)Refutation found. Thanks to Tanya!
% 0.14/0.39 % SZS status Unsatisfiable for theBenchmark
% 0.14/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.39 % (18008)------------------------------
% 0.14/0.39 % (18008)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.14/0.39 % (18008)Termination reason: Refutation
% 0.14/0.39
% 0.14/0.39 % (18008)Memory used [KB]: 921
% 0.14/0.39 % (18008)Time elapsed: 0.011 s
% 0.14/0.39 % (18008)Instructions burned: 19 (million)
% 0.14/0.39 % (18008)------------------------------
% 0.14/0.39 % (18008)------------------------------
% 0.14/0.39 % (18005)Success in time 0.024 s
%------------------------------------------------------------------------------