%------------------------------------------------------------------------------
% File : Vampire-SAT---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 SAT
% Computer : n013.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 02:06:26 PM UTC 2026
% Result : Unsatisfiable 0.25s 0.37s
% Output : Refutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 25
% Syntax : Number of formulae : 125 ( 7 unt; 10 def)
% Number of atoms : 372 ( 128 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 413 ( 166 ~; 237 |; 0 &)
% ( 10 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 11 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-1 aty)
% Number of variables : 44 ( 0 sgn 44 !; 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] :
( j = X0
| k = X0
| ~ element(X0,j) ),
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] :
( k = X0
| m = X0
| n = X0
| ~ element(X0,k) ),
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(f66,plain,
( ! [X0] :
( ~ element(X0,j)
| j = X0
| n = X0 )
| ~ spl0_2 ),
inference(forward_demodulation,[],[f6,f43]) ).
fof(f75,definition,
( spl0_8
<=> m = j ),
introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).
fof(f77,plain,
( m = j
| ~ spl0_8 ),
inference(avatar_component_clause,[],[f75]) ).
fof(f83,plain,
( element(j,n)
| n = j
| j = g(j)
| n = g(j)
| ~ spl0_2 ),
inference(resolution,[],[f24,f66]) ).
fof(f84,plain,
( element(j,n)
| n = j
| n = g(j)
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f83,f20]) ).
fof(f85,plain,
( element(j,n)
| n = j
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f84,f18]) ).
fof(f87,definition,
( spl0_10
<=> n = j ),
introduced(definition,[new_symbols(definition,[spl0_10])],[avatar_definition]) ).
fof(f88,plain,
( n != j
| spl0_10 ),
inference(avatar_component_clause,[],[f87]) ).
fof(f89,plain,
( n = j
| ~ spl0_10 ),
inference(avatar_component_clause,[],[f87]) ).
fof(f91,definition,
( spl0_11
<=> element(j,n) ),
introduced(definition,[new_symbols(definition,[spl0_11])],[avatar_definition]) ).
fof(f93,plain,
( element(j,n)
| ~ spl0_11 ),
inference(avatar_component_clause,[],[f91]) ).
fof(f94,plain,
( spl0_10
| spl0_11
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f85,f41,f91,f87]) ).
fof(f95,plain,
( ! [X0] :
( n = X0
| m = X0
| n = X0
| ~ element(X0,k) )
| ~ spl0_2 ),
inference(forward_demodulation,[],[f32,f43]) ).
fof(f96,plain,
( ! [X0] :
( n = X0
| m = X0
| ~ element(X0,k) )
| ~ spl0_2 ),
inference(duplicate_literal_removal,[],[f95]) ).
fof(f97,plain,
( ! [X0] :
( ~ element(X0,n)
| n = X0
| m = X0 )
| ~ spl0_2 ),
inference(forward_demodulation,[],[f96,f43]) ).
fof(f99,plain,
( ! [X0] :
( ~ element(X0,n)
| n = X0
| n = X0 )
| ~ spl0_2
| ~ spl0_10 ),
inference(superposition,[],[f66,f89]) ).
fof(f101,plain,
( ! [X0] :
( ~ element(X0,n)
| n = X0 )
| ~ spl0_2
| ~ spl0_10 ),
inference(duplicate_literal_removal,[],[f99]) ).
fof(f103,plain,
( n = f(n)
| m = f(n)
| ~ element(n,m)
| m = n
| ~ spl0_2 ),
inference(resolution,[],[f97,f14]) ).
fof(f105,plain,
( m = f(n)
| ~ element(n,m)
| m = n
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f103,f10]) ).
fof(f106,plain,
( ~ element(n,m)
| m = n
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f105,f8]) ).
fof(f107,plain,
( ~ element(n,m)
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f106,f1]) ).
fof(f108,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(f116,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,[],[f108]) ).
fof(f119,plain,
! [X0] :
( element(f(X0),m)
| m = X0
| f(X0) = X0
| m = f(X0)
| ~ element(X0,m) ),
inference(forward_subsumption_resolution,[],[f116,f14]) ).
fof(f120,plain,
! [X0] :
( element(f(X0),m)
| m = X0
| m = f(X0)
| ~ element(X0,m) ),
inference(forward_subsumption_resolution,[],[f119,f10]) ).
fof(f121,plain,
! [X0] :
( element(f(X0),m)
| m = X0
| ~ element(X0,m) ),
inference(forward_subsumption_resolution,[],[f120,f8]) ).
fof(f148,plain,
( m = n
| ~ spl0_2
| ~ spl0_3
| ~ spl0_10 ),
inference(resolution,[],[f101,f64]) ).
fof(f152,plain,
( $false
| ~ spl0_2
| ~ spl0_3
| ~ spl0_10 ),
inference(forward_subsumption_resolution,[],[f148,f1]) ).
fof(f153,plain,
( ~ spl0_2
| ~ spl0_3
| ~ spl0_10 ),
inference(avatar_contradiction_clause,[],[f152]) ).
fof(f154,plain,
( n = j
| m = j
| ~ spl0_2
| ~ spl0_11 ),
inference(resolution,[],[f93,f97]) ).
fof(f169,plain,
( element(n,m)
| ~ spl0_2
| ~ spl0_5
| ~ spl0_8 ),
inference(superposition,[],[f65,f77]) ).
fof(f170,plain,
( $false
| ~ spl0_2
| ~ spl0_5
| ~ spl0_8 ),
inference(forward_subsumption_resolution,[],[f169,f107]) ).
fof(f171,plain,
( ~ spl0_2
| ~ spl0_5
| ~ spl0_8 ),
inference(avatar_contradiction_clause,[],[f170]) ).
fof(f173,plain,
( spl0_8
| spl0_10
| ~ spl0_2
| ~ spl0_11 ),
inference(avatar_split_clause,[],[f154,f91,f41,f87,f75]) ).
fof(f187,plain,
( m = n
| ~ spl0_2
| ~ spl0_4 ),
inference(superposition,[],[f52,f43]) ).
fof(f191,plain,
( $false
| ~ spl0_2
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f187,f1]) ).
fof(f192,plain,
( ~ spl0_2
| ~ spl0_4 ),
inference(avatar_contradiction_clause,[],[f191]) ).
fof(f193,plain,
( element(n,m)
| ~ spl0_1
| ~ spl0_4 ),
inference(forward_demodulation,[],[f39,f52]) ).
fof(f197,plain,
( ! [X0] :
( m = X0
| m = X0
| n = X0
| ~ element(X0,k) )
| ~ spl0_4 ),
inference(forward_demodulation,[],[f32,f52]) ).
fof(f198,plain,
( ! [X0] :
( m = X0
| n = X0
| ~ element(X0,k) )
| ~ spl0_4 ),
inference(duplicate_literal_removal,[],[f197]) ).
fof(f204,plain,
( ! [X0] :
( ~ element(X0,m)
| m = X0
| n = X0 )
| ~ spl0_4 ),
inference(forward_demodulation,[],[f198,f52]) ).
fof(f213,definition,
( spl0_15
<=> element(n,m) ),
introduced(definition,[new_symbols(definition,[spl0_15])],[avatar_definition]) ).
fof(f215,plain,
( element(n,m)
| ~ spl0_15 ),
inference(avatar_component_clause,[],[f213]) ).
fof(f217,plain,
( spl0_15
| ~ spl0_1
| ~ spl0_4 ),
inference(avatar_split_clause,[],[f193,f50,f37,f213]) ).
fof(f268,plain,
( ! [X0] :
( m = f(X0)
| n = f(X0)
| m = X0
| ~ element(X0,m) )
| ~ spl0_4 ),
inference(resolution,[],[f204,f121]) ).
fof(f272,plain,
( ! [X0] :
( ~ element(X0,m)
| m = X0
| n = f(X0) )
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f268,f8]) ).
fof(f320,plain,
( m = n
| n = f(n)
| ~ spl0_4
| ~ spl0_15 ),
inference(resolution,[],[f272,f215]) ).
fof(f326,plain,
( n = f(n)
| ~ spl0_4
| ~ spl0_15 ),
inference(forward_subsumption_resolution,[],[f320,f1]) ).
fof(f330,plain,
( n != n
| ~ element(n,m)
| m = n
| ~ spl0_4
| ~ spl0_15 ),
inference(superposition,[],[f10,f326]) ).
fof(f332,plain,
( ~ element(n,m)
| m = n
| ~ spl0_4
| ~ spl0_15 ),
inference(trivial_inequality_removal,[],[f330]) ).
fof(f333,plain,
( m = n
| ~ spl0_4
| ~ spl0_15 ),
inference(forward_subsumption_resolution,[],[f332,f215]) ).
fof(f336,plain,
( $false
| ~ spl0_4
| ~ spl0_15 ),
inference(forward_subsumption_resolution,[],[f333,f1]) ).
fof(f337,plain,
( ~ spl0_4
| ~ spl0_15 ),
inference(avatar_contradiction_clause,[],[f336]) ).
fof(f361,plain,
( n = j
| ~ spl0_2
| ~ spl0_6 ),
inference(forward_demodulation,[],[f61,f43]) ).
fof(f362,plain,
( $false
| ~ spl0_2
| ~ spl0_6
| spl0_10 ),
inference(forward_subsumption_resolution,[],[f361,f88]) ).
fof(f363,plain,
( ~ spl0_2
| ~ spl0_6
| spl0_10 ),
inference(avatar_contradiction_clause,[],[f362]) ).
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,[],[f94]) ).
cnf(s7,plain,
( ~ spl0_2
| ~ spl0_3
| ~ spl0_10 ),
inference(sat_conversion,[],[f153]) ).
cnf(s10,plain,
( ~ spl0_2
| ~ spl0_5
| ~ spl0_8 ),
inference(sat_conversion,[],[f171]) ).
cnf(s11,plain,
( ~ spl0_2
| spl0_8
| spl0_10
| ~ spl0_11 ),
inference(sat_conversion,[],[f173]) ).
cnf(s15,plain,
( ~ spl0_2
| ~ spl0_4 ),
inference(sat_conversion,[],[f192]) ).
cnf(s17,plain,
( ~ spl0_1
| ~ spl0_4
| spl0_15 ),
inference(sat_conversion,[],[f217]) ).
cnf(s41,plain,
( ~ spl0_4
| ~ spl0_15 ),
inference(sat_conversion,[],[f337]) ).
cnf(s47,plain,
( ~ spl0_2
| ~ spl0_6
| spl0_10 ),
inference(sat_conversion,[],[f363]) ).
cnf(s48,plain,
( spl0_10
| ~ spl0_2 ),
inference(rat,[],[s10,s3,s11,s47,s6]) ).
cnf(s49,plain,
( ~ spl0_3
| ~ spl0_2 ),
inference(rat,[],[s48,s7]) ).
cnf(s50,plain,
~ spl0_2,
inference(rat,[],[s49,s2,s15]) ).
cnf(s51,plain,
spl0_4,
inference(rat,[],[s4,s50]) ).
cnf(s52,plain,
spl0_1,
inference(rat,[],[s1,s50]) ).
cnf(s53,plain,
~ spl0_15,
inference(rat,[],[s41,s51]) ).
cnf(s55,plain,
$false,
inference(rat,[],[s17,s53,s52,s51]) ).
fof(f364,plain,
$false,
inference(avatar_sat_refutation,[],[s55]) ).
%------------------------------------------------------------------------------
%----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 SAT
% 0.11/0.25 % Computer : n013.cluster.edu
% 0.11/0.25 % Model : x86_64 x86_64
% 0.11/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.25 % Memory : 8046.5625MB
% 0.11/0.25 % OS : Linux 6.8.0-71-generic
% 0.11/0.25 % CPULimit : 300
% 0.11/0.25 % WCLimit : 300
% 0.11/0.25 % DateTime : Mon Sep 28 15:19:36 UTC 2026
% 0.11/0.26 % CPUTime :
% 0.11/0.26 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.25/0.31 Running first-order model finding
% 0.25/0.31 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.25/0.37 % (1265612)Will run a generic schedule for satisfiability detection.
% 0.25/0.37 % (1265617)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3089594152_3000 on theBenchmark for (3000ds/0Mi)
% 0.25/0.37 % TRYING [1]
% 0.25/0.37 % TRYING [2]
% 0.25/0.37 % TRYING [3]
% 0.25/0.37 % TRYING [4]
% 0.25/0.37 % TRYING [5]
% 0.25/0.37 % (1265622)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3840892313:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 0.25/0.37 % TRYING [6]
% 0.25/0.37 % TRYING [7]
% 0.25/0.37 % TRYING [8]
% 0.25/0.37 % (1265618)% WARNING: option uhcvi not known.
% 0.25/0.37 % TRYING [9]
% 0.25/0.37 % TRYING [10]
% 0.25/0.37 % (1265618)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=602492384:i=135531:add=off:rawr=on_3000 on theBenchmark for (3000ds/135531Mi)
% 0.25/0.37 % (1265620)dis+10_1_sil=32000:sp=arity:random_seed=2273196381:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 0.25/0.37 % (1265619)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3663825819:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 0.25/0.37 % (1265621)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=904676343:i=116_3000 on theBenchmark for (3000ds/116Mi)
% 0.25/0.37 % (1265623)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3727497145:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_3000 on theBenchmark for (3000ds/159Mi)
% 0.25/0.37 % TRYING [11]
% 0.25/0.37 % TRYING [12]
% 0.25/0.37 % (1265620) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1265612-1265620"...
% 0.25/0.37 % TRYING [13]
% 0.25/0.37 % (1265622) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1265612-1265622"...
% 0.25/0.37 % (1265620)...printing done.
% 0.25/0.37 % (1265618) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1265612-1265618"...
% 0.25/0.37 % (1265621) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1265612-1265621"...
% 0.25/0.37 % TRYING [14]
% 0.25/0.37 % (1265620)Refutation found. Thanks to Tanya!
% 0.25/0.37 % SZS status Unsatisfiable for theBenchmark
% 0.25/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.25/0.38 % (1265620)------------------------------
% 0.25/0.38 % (1265620)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.25/0.38 % (1265620)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.25/0.38 % (1265620)CaDiCaL version: 2.1.3
% 0.25/0.38 % (1265620)Termination reason: Refutation
% 0.25/0.38 % (1265620)Time elapsed: 0.013 s
% 0.25/0.38 % (1265620)Peak memory usage: 12 MB
% 0.25/0.38 % (1265620)Instructions burned: 11 (million)
% 0.25/0.38 % (1265612)Success in time 0.052 s
% 0.25/0.38 % Vampire exiting
%------------------------------------------------------------------------------