%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SYN014-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n008.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 01:49:00 PM UTC 2026
% Result : Unsatisfiable 3.03s 1.10s
% Output : Refutation 3.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 24
% Syntax : Number of formulae : 125 ( 6 unt; 9 def)
% Number of atoms : 388 ( 139 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 434 ( 171 ~; 254 |; 0 &)
% ( 9 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 10 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-1 aty)
% Number of variables : 40 ( 0 sgn 40 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
m != n,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_1) ).
fof(f2,negated_conjecture,
( n = k
| m = k ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_2) ).
fof(f3,negated_conjecture,
! [X0] :
( X0 = j
| X0 != k
| element(X0,j) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_3) ).
fof(f4,plain,
! [X0] :
( j = X0
| k != X0
| element(X0,j) ),
inference(reorient_equations,[],[f3]) ).
fof(f5,negated_conjecture,
! [X0] :
( X0 = j
| X0 = k
| ~ element(X0,j) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_4) ).
fof(f6,plain,
! [X0] :
( ~ element(X0,j)
| k = X0
| j = X0 ),
inference(reorient_equations,[],[f5]) ).
fof(f7,negated_conjecture,
! [X0] :
( X0 = m
| ~ element(X0,m)
| f(X0) != m ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_5) ).
fof(f8,plain,
! [X0] :
( m != f(X0)
| ~ element(X0,m)
| m = X0 ),
inference(reorient_equations,[],[f7]) ).
fof(f9,negated_conjecture,
! [X0] :
( X0 = m
| ~ element(X0,m)
| f(X0) != X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_6) ).
fof(f10,plain,
! [X0] :
( f(X0) != X0
| ~ element(X0,m)
| m = X0 ),
inference(reorient_equations,[],[f9]) ).
fof(f11,negated_conjecture,
! [X0] :
( X0 = m
| ~ element(X0,m)
| element(X0,f(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_7) ).
fof(f12,plain,
! [X0] :
( element(X0,f(X0))
| ~ element(X0,m)
| m = X0 ),
inference(reorient_equations,[],[f11]) ).
fof(f13,negated_conjecture,
! [X0] :
( X0 = m
| ~ element(X0,m)
| element(f(X0),X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_8) ).
fof(f14,plain,
! [X0] :
( element(f(X0),X0)
| ~ element(X0,m)
| m = X0 ),
inference(reorient_equations,[],[f13]) ).
fof(f15,negated_conjecture,
! [X0,X1] :
( X0 = m
| element(X0,m)
| X1 = m
| X1 = X0
| ~ element(X0,X1)
| ~ element(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_9) ).
fof(f16,plain,
! [X0,X1] :
( ~ element(X1,X0)
| element(X0,m)
| m = X1
| X0 = X1
| ~ element(X0,X1)
| m = X0 ),
inference(reorient_equations,[],[f15]) ).
fof(f17,negated_conjecture,
! [X0] :
( X0 = n
| element(X0,n)
| g(X0) != n ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_10) ).
fof(f18,plain,
! [X0] :
( n != g(X0)
| element(X0,n)
| n = X0 ),
inference(reorient_equations,[],[f17]) ).
fof(f19,negated_conjecture,
! [X0] :
( X0 = n
| element(X0,n)
| g(X0) != X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_11) ).
fof(f20,plain,
! [X0] :
( g(X0) != X0
| element(X0,n)
| n = X0 ),
inference(reorient_equations,[],[f19]) ).
fof(f23,negated_conjecture,
! [X0] :
( X0 = n
| element(X0,n)
| element(g(X0),X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_13) ).
fof(f24,plain,
! [X0] :
( element(g(X0),X0)
| element(X0,n)
| n = X0 ),
inference(reorient_equations,[],[f23]) ).
fof(f27,negated_conjecture,
! [X0] :
( X0 = k
| X0 != m
| element(X0,k) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_15) ).
fof(f28,plain,
! [X0] :
( k = X0
| m != X0
| element(X0,k) ),
inference(reorient_equations,[],[f27]) ).
fof(f29,negated_conjecture,
! [X0] :
( X0 = k
| X0 != n
| element(X0,k) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_16) ).
fof(f30,plain,
! [X0] :
( k = X0
| n != X0
| element(X0,k) ),
inference(reorient_equations,[],[f29]) ).
fof(f31,negated_conjecture,
! [X0] :
( X0 = k
| X0 = m
| X0 = n
| ~ element(X0,k) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_17) ).
fof(f32,plain,
! [X0] :
( ~ element(X0,k)
| m = X0
| n = X0
| k = X0 ),
inference(reorient_equations,[],[f31]) ).
fof(f33,plain,
( k = j
| element(k,j) ),
inference(equality_resolution,[],[f4]) ).
fof(f34,plain,
( m = k
| element(m,k) ),
inference(equality_resolution,[],[f28]) ).
fof(f35,plain,
( n = k
| element(n,k) ),
inference(equality_resolution,[],[f30]) ).
fof(f37,definition,
( spl0_1
<=> element(n,k) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f39,plain,
( element(n,k)
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f37]) ).
fof(f41,definition,
( spl0_2
<=> n = k ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f43,plain,
( n = k
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f41]) ).
fof(f44,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f35,f41,f37]) ).
fof(f46,definition,
( spl0_3
<=> element(m,k) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f48,plain,
( element(m,k)
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f46]) ).
fof(f50,definition,
( spl0_4
<=> m = k ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f52,plain,
( m = k
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f50]) ).
fof(f53,plain,
( spl0_3
| spl0_4 ),
inference(avatar_split_clause,[],[f34,f50,f46]) ).
fof(f55,definition,
( spl0_5
<=> element(k,j) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f57,plain,
( element(k,j)
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f55]) ).
fof(f59,definition,
( spl0_6
<=> k = j ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f61,plain,
( k = j
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f59]) ).
fof(f62,plain,
( spl0_5
| spl0_6 ),
inference(avatar_split_clause,[],[f33,f59,f55]) ).
fof(f63,plain,
( spl0_4
| spl0_2 ),
inference(avatar_split_clause,[],[f2,f41,f50]) ).
fof(f64,plain,
( element(m,n)
| ~ spl0_2
| ~ spl0_3 ),
inference(forward_demodulation,[],[f48,f43]) ).
fof(f65,plain,
( element(n,j)
| ~ spl0_2
| ~ spl0_5 ),
inference(forward_demodulation,[],[f57,f43]) ).
fof(f71,definition,
( spl0_7
<=> m = j ),
introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).
fof(f73,plain,
( m = j
| ~ spl0_7 ),
inference(avatar_component_clause,[],[f71]) ).
fof(f83,plain,
( element(j,n)
| n = j
| k = g(j)
| j = g(j) ),
inference(resolution,[],[f24,f6]) ).
fof(f84,plain,
( element(j,n)
| n = j
| k = g(j) ),
inference(forward_subsumption_resolution,[],[f83,f20]) ).
fof(f85,plain,
( n = g(j)
| element(j,n)
| n = j
| ~ spl0_2 ),
inference(forward_demodulation,[],[f84,f43]) ).
fof(f86,plain,
( element(j,n)
| n = j
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f85,f18]) ).
fof(f88,definition,
( spl0_10
<=> n = j ),
introduced(definition,[new_symbols(definition,[spl0_10])],[avatar_definition]) ).
fof(f89,plain,
( n != j
| spl0_10 ),
inference(avatar_component_clause,[],[f88]) ).
fof(f90,plain,
( n = j
| ~ spl0_10 ),
inference(avatar_component_clause,[],[f88]) ).
fof(f92,definition,
( spl0_11
<=> element(j,n) ),
introduced(definition,[new_symbols(definition,[spl0_11])],[avatar_definition]) ).
fof(f94,plain,
( element(j,n)
| ~ spl0_11 ),
inference(avatar_component_clause,[],[f92]) ).
fof(f95,plain,
( spl0_10
| spl0_11
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f86,f41,f92,f88]) ).
fof(f97,plain,
( ! [X0] :
( ~ element(X0,n)
| k = X0
| n = X0 )
| ~ spl0_10 ),
inference(superposition,[],[f6,f90]) ).
fof(f99,plain,
( ! [X0] :
( n = X0
| ~ element(X0,n)
| n = X0 )
| ~ spl0_2
| ~ spl0_10 ),
inference(forward_demodulation,[],[f97,f43]) ).
fof(f100,plain,
( ! [X0] :
( ~ element(X0,n)
| n = X0 )
| ~ spl0_2
| ~ spl0_10 ),
inference(duplicate_literal_removal,[],[f99]) ).
fof(f101,plain,
( m = f(k)
| n = f(k)
| k = f(k)
| ~ element(k,m)
| m = k ),
inference(resolution,[],[f32,f14]) ).
fof(f106,plain,
( n = f(k)
| k = f(k)
| ~ element(k,m)
| m = k ),
inference(forward_subsumption_resolution,[],[f101,f8]) ).
fof(f108,plain,
( n = f(k)
| ~ element(k,m)
| m = k ),
inference(forward_subsumption_resolution,[],[f106,f10]) ).
fof(f110,plain,
( n = f(n)
| ~ element(k,m)
| m = k
| ~ spl0_2 ),
inference(forward_demodulation,[],[f108,f43]) ).
fof(f111,plain,
( ~ element(n,m)
| n = f(n)
| m = k
| ~ spl0_2 ),
inference(forward_demodulation,[],[f110,f43]) ).
fof(f112,plain,
! [X0] :
( element(f(X0),m)
| m = X0
| f(X0) = X0
| ~ element(f(X0),X0)
| m = f(X0)
| ~ element(X0,m)
| m = X0 ),
inference(resolution,[],[f16,f12]) ).
fof(f120,plain,
! [X0] :
( element(f(X0),m)
| m = X0
| f(X0) = X0
| ~ element(f(X0),X0)
| m = f(X0)
| ~ element(X0,m) ),
inference(duplicate_literal_removal,[],[f112]) ).
fof(f123,plain,
! [X0] :
( element(f(X0),m)
| m = X0
| ~ element(f(X0),X0)
| m = f(X0)
| ~ element(X0,m) ),
inference(forward_subsumption_resolution,[],[f120,f10]) ).
fof(f126,plain,
! [X0] :
( element(f(X0),m)
| m = X0
| m = f(X0)
| ~ element(X0,m) ),
inference(forward_subsumption_resolution,[],[f123,f14]) ).
fof(f129,plain,
! [X0] :
( element(f(X0),m)
| m = X0
| ~ element(X0,m) ),
inference(forward_subsumption_resolution,[],[f126,f8]) ).
fof(f145,plain,
( m = n
| ~ spl0_2
| ~ spl0_3
| ~ spl0_10 ),
inference(resolution,[],[f100,f64]) ).
fof(f149,plain,
( $false
| ~ spl0_2
| ~ spl0_3
| ~ spl0_10 ),
inference(forward_subsumption_resolution,[],[f145,f1]) ).
fof(f150,plain,
( ~ spl0_2
| ~ spl0_3
| ~ spl0_10 ),
inference(avatar_contradiction_clause,[],[f149]) ).
fof(f151,plain,
( m = n
| ~ element(n,m)
| n = f(n)
| ~ spl0_2 ),
inference(forward_demodulation,[],[f111,f43]) ).
fof(f156,plain,
( m = n
| ~ element(n,m)
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f151,f10]) ).
fof(f159,plain,
( ~ element(n,m)
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f156,f1]) ).
fof(f162,plain,
( element(n,m)
| m = j
| n = j
| ~ element(n,j)
| m = n
| ~ spl0_11 ),
inference(resolution,[],[f94,f16]) ).
fof(f164,plain,
( m = j
| n = j
| ~ element(n,j)
| m = n
| ~ spl0_2
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[],[f162,f159]) ).
fof(f165,plain,
( m = j
| ~ element(n,j)
| m = n
| ~ spl0_2
| spl0_10
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[],[f164,f89]) ).
fof(f166,plain,
( m = j
| m = n
| ~ spl0_2
| ~ spl0_5
| spl0_10
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[],[f165,f65]) ).
fof(f167,plain,
( m = j
| ~ spl0_2
| ~ spl0_5
| spl0_10
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[],[f166,f1]) ).
fof(f168,plain,
( spl0_7
| ~ spl0_2
| ~ spl0_5
| spl0_10
| ~ spl0_11 ),
inference(avatar_split_clause,[],[f167,f92,f88,f55,f41,f71]) ).
fof(f173,plain,
( element(n,m)
| ~ spl0_2
| ~ spl0_5
| ~ spl0_7 ),
inference(superposition,[],[f65,f73]) ).
fof(f174,plain,
( $false
| ~ spl0_2
| ~ spl0_5
| ~ spl0_7 ),
inference(forward_subsumption_resolution,[],[f173,f159]) ).
fof(f175,plain,
( ~ spl0_2
| ~ spl0_5
| ~ spl0_7 ),
inference(avatar_contradiction_clause,[],[f174]) ).
fof(f178,plain,
( m = n
| ~ spl0_2
| ~ spl0_4 ),
inference(superposition,[],[f52,f43]) ).
fof(f184,plain,
( $false
| ~ spl0_2
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f178,f1]) ).
fof(f185,plain,
( ~ spl0_2
| ~ spl0_4 ),
inference(avatar_contradiction_clause,[],[f184]) ).
fof(f186,plain,
( element(n,m)
| ~ spl0_1
| ~ spl0_4 ),
inference(forward_demodulation,[],[f39,f52]) ).
fof(f234,plain,
( n = j
| ~ spl0_2
| ~ spl0_6 ),
inference(forward_demodulation,[],[f61,f43]) ).
fof(f239,plain,
( $false
| ~ spl0_2
| ~ spl0_6
| spl0_10 ),
inference(forward_subsumption_resolution,[],[f234,f89]) ).
fof(f240,plain,
( ~ spl0_2
| ~ spl0_6
| spl0_10 ),
inference(avatar_contradiction_clause,[],[f239]) ).
fof(f265,plain,
( ! [X0] :
( ~ element(X0,m)
| m = X0
| n = X0
| m = X0 )
| ~ spl0_4 ),
inference(superposition,[],[f32,f52]) ).
fof(f266,plain,
( ! [X0] :
( ~ element(X0,m)
| m = X0
| n = X0 )
| ~ spl0_4 ),
inference(duplicate_literal_removal,[],[f265]) ).
fof(f298,plain,
( ! [X0] :
( m = X0
| ~ element(X0,m)
| m = f(X0)
| n = f(X0) )
| ~ spl0_4 ),
inference(resolution,[],[f129,f266]) ).
fof(f312,plain,
( ! [X0] :
( ~ element(X0,m)
| m = X0
| n = f(X0) )
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f298,f8]) ).
fof(f320,plain,
( m = n
| n = f(n)
| ~ spl0_1
| ~ spl0_4 ),
inference(resolution,[],[f312,f186]) ).
fof(f326,plain,
( n = f(n)
| ~ spl0_1
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f320,f1]) ).
fof(f337,plain,
( n != n
| ~ element(n,m)
| m = n
| ~ spl0_1
| ~ spl0_4 ),
inference(superposition,[],[f10,f326]) ).
fof(f339,plain,
( ~ element(n,m)
| m = n
| ~ spl0_1
| ~ spl0_4 ),
inference(trivial_inequality_removal,[],[f337]) ).
fof(f340,plain,
( m = n
| ~ spl0_1
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f339,f186]) ).
fof(f343,plain,
( $false
| ~ spl0_1
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f340,f1]) ).
fof(f344,plain,
( ~ spl0_1
| ~ spl0_4 ),
inference(avatar_contradiction_clause,[],[f343]) ).
cnf(s1,plain,
( spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f44]) ).
cnf(s2,plain,
( spl0_3
| spl0_4 ),
inference(sat_conversion,[],[f53]) ).
cnf(s3,plain,
( spl0_5
| spl0_6 ),
inference(sat_conversion,[],[f62]) ).
cnf(s4,plain,
( spl0_2
| spl0_4 ),
inference(sat_conversion,[],[f63]) ).
cnf(s6,plain,
( ~ spl0_2
| spl0_10
| spl0_11 ),
inference(sat_conversion,[],[f95]) ).
cnf(s7,plain,
( ~ spl0_2
| ~ spl0_3
| ~ spl0_10 ),
inference(sat_conversion,[],[f150]) ).
cnf(s8,plain,
( ~ spl0_2
| ~ spl0_5
| spl0_7
| spl0_10
| ~ spl0_11 ),
inference(sat_conversion,[],[f168]) ).
cnf(s9,plain,
( ~ spl0_2
| ~ spl0_5
| ~ spl0_7 ),
inference(sat_conversion,[],[f175]) ).
cnf(s11,plain,
( ~ spl0_2
| ~ spl0_4 ),
inference(sat_conversion,[],[f185]) ).
cnf(s16,plain,
( ~ spl0_2
| ~ spl0_6
| spl0_10 ),
inference(sat_conversion,[],[f240]) ).
cnf(s26,plain,
( ~ spl0_1
| ~ spl0_4 ),
inference(sat_conversion,[],[f344]) ).
cnf(s27,plain,
( spl0_10
| ~ spl0_2 ),
inference(rat,[],[s8,s9,s3,s16,s6]) ).
cnf(s28,plain,
( ~ spl0_3
| ~ spl0_2 ),
inference(rat,[],[s27,s7]) ).
cnf(s29,plain,
~ spl0_2,
inference(rat,[],[s28,s2,s11]) ).
cnf(s30,plain,
spl0_4,
inference(rat,[],[s4,s29]) ).
cnf(s31,plain,
spl0_1,
inference(rat,[],[s1,s29]) ).
cnf(s32,plain,
$false,
inference(rat,[],[s26,s30,s31]) ).
fof(f347,plain,
$false,
inference(avatar_sat_refutation,[],[s32]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN014-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.19 % Computer : n008.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Mon Sep 28 15:20:54 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.23 Running first-order theorem proving
% 0.09/0.23 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.03/1.10 % (2333804)Input is clausal, will run a generic CNF schedule.
% 3.03/1.10 % (2333810)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=711643970:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 3.03/1.10 % (2333814)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3136863486:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 3.03/1.10 % (2333809)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=412582196:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 3.03/1.10 % (2333813)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=2273327219:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 3.03/1.10 % (2333811)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=2508422939:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 3.03/1.10 % (2333815)dis-21_1_sil=8000:lcm=predicate:random_seed=1858428523:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/117Mi)
% 3.03/1.10 % (2333812)lrs+10_1_sil=8000:sp=occurrence:random_seed=575736666:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 3.03/1.10 % (2333812)First to succeed.
% 3.03/1.10 % (2333814)Also succeeded, but the first one will report.
% 3.03/1.10 % (2333812)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2333804"
% 3.03/1.10 % (2333813)Also succeeded, but the first one will report.
% 3.03/1.10 % (2333815)Instruction limit reached!
% 3.03/1.10 % (2333815)------------------------------
% 3.03/1.10 % (2333815)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.03/1.10 % (2333815)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.03/1.10 % (2333815)CaDiCaL version: 2.1.3
% 3.03/1.10 % (2333815)Termination reason: Instruction limit
% 3.03/1.10 % (2333815)Termination phase: Saturation
% 3.03/1.10 % (2333815)Time elapsed: 0.053 s
% 3.03/1.10 % (2333815)Peak memory usage: 88 MB
% 3.03/1.10 % (2333815)Instructions burned: 119 (million)
% 3.03/1.10 % (2333823)dis+1010_3_sil=8000:plsq=on:drc=off:fde=none:plsqc=1:bsd=on:plsqr=7,2:sos=on:spb=goal_then_units:random_seed=2997838411:i=143:sd=2:aac=none:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/143Mi)
% 3.03/1.10 % (2333823)Also succeeded, but the first one will report.
% 3.03/1.10 % (2333812)Refutation found. Thanks to Tanya!
% 3.03/1.10 % SZS status Unsatisfiable for theBenchmark
% 3.03/1.10 % SZS output start Proof for theBenchmark
% See solution above
% 3.62/1.19 % (2333812)------------------------------
% 3.62/1.19 % (2333812)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.62/1.19 % (2333812)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.62/1.19 % (2333812)CaDiCaL version: 2.1.3
% 3.62/1.19 % (2333812)Termination reason: Refutation
% 3.62/1.19 % (2333812)Time elapsed: 0.009 s
% 3.62/1.19 % (2333812)Peak memory usage: 89 MB
% 3.62/1.19 % (2333812)Instructions burned: 11 (million)
% 3.62/1.19 % (2333812)------------------------------
% 3.62/1.19 % (2333812)------------------------------
% 3.62/1.19 % (2333804)Success in time 0.436 s
% 3.62/1.19 % Vampire exiting
%------------------------------------------------------------------------------