%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : NUM420-1.000 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n026.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 12:15:06 PM UTC 2026
% Result : Unsatisfiable 3.58s 1.47s
% Output : Refutation 3.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 20
% Syntax : Number of formulae : 82 ( 20 unt; 7 def)
% Number of atoms : 183 ( 70 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 195 ( 94 ~; 94 |; 0 &)
% ( 7 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 7 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 8 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 70 ( 0 sgn 70 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f49,negated_conjecture,
! [X2,X0,X1] : plus(X0,plus(plus(times(X1,plus(X2,plus(n1,n1))),times(X2,plus(X0,n1))),n1)) = plus(X1,times(plus(X1,plus(X0,n1)),plus(X2,n1))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).
fof(f68,negated_conjecture,
! [X2,X0,X1] :
( ~ less(X0,n0)
| ~ less(n0,p__0)
| ~ less(X0,p__0)
| plus(X0,times(X1,p__0)) != plus(n0,times(X2,p__0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_14) ).
fof(f75,negated_conjecture,
( ~ less(n0,p__0)
| p__0 = plus(s_7(p__0),n1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_18) ).
fof(f85,negated_conjecture,
! [X2,X0,X1] :
( ~ less(n0,X0)
| ~ less(n0,p__0)
| ~ less(X0,p__0)
| plus(X0,times(X1,p__0)) != plus(n0,times(X2,p__0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_24) ).
fof(f86,negated_conjecture,
! [X0] : plus(n1,plus(X0,n1)) != n1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_25) ).
fof(f87,plain,
! [X0] : n1 != plus(n1,plus(X0,n1)),
inference(reorient_equations,[],[f86]) ).
fof(f99,negated_conjecture,
! [X0] :
( X0 = n0
| less(X0,n0)
| less(n0,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_33) ).
fof(f100,plain,
! [X0] :
( less(n0,X0)
| less(X0,n0)
| n0 = X0 ),
inference(reorient_equations,[],[f99]) ).
fof(f101,negated_conjecture,
( ~ less(plus(n0,n1),p__0)
| less(n0,p__0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_34) ).
fof(f103,negated_conjecture,
plus(n0,n1) = n1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_36) ).
fof(f104,plain,
n1 = plus(n0,n1),
inference(reorient_equations,[],[f103]) ).
fof(f116,negated_conjecture,
! [X0] :
( X0 != p__0
| less(n1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_44) ).
fof(f117,plain,
! [X0] :
( p__0 != X0
| less(n1,X0) ),
inference(reorient_equations,[],[f116]) ).
fof(f124,negated_conjecture,
! [X0] :
( X0 = n1
| times(s_1(X0),s_4(X0)) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_48) ).
fof(f125,plain,
! [X0] :
( times(s_1(X0),s_4(X0)) = X0
| n1 = X0 ),
inference(reorient_equations,[],[f124]) ).
fof(f128,negated_conjecture,
! [X0] :
( X0 = n1
| times(s_4(X0),s_1(X0)) = times(s_1(X0),s_4(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_50) ).
fof(f129,plain,
! [X0] :
( times(s_1(X0),s_4(X0)) = times(s_4(X0),s_1(X0))
| n1 = X0 ),
inference(reorient_equations,[],[f128]) ).
fof(f134,negated_conjecture,
! [X0] :
( X0 = n1
| s_1(X0) = p__0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_53) ).
fof(f135,plain,
! [X0] :
( p__0 = s_1(X0)
| n1 = X0 ),
inference(reorient_equations,[],[f134]) ).
fof(f138,negated_conjecture,
! [X0,X1] :
( X0 != p__0
| plus(n0,times(X1,X0)) = times(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_55) ).
fof(f139,plain,
! [X0,X1] :
( p__0 != X0
| times(X1,X0) = plus(n0,times(X1,X0)) ),
inference(reorient_equations,[],[f138]) ).
fof(f165,plain,
less(n1,p__0),
inference(equality_resolution,[],[f117]) ).
fof(f172,plain,
! [X1] : times(X1,p__0) = plus(n0,times(X1,p__0)),
inference(equality_resolution,[],[f139]) ).
fof(f175,definition,
( spl0_1
<=> less(n0,p__0) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f179,definition,
( spl0_2
<=> less(plus(n0,n1),p__0) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f181,plain,
( ~ less(plus(n0,n1),p__0)
| spl0_2 ),
inference(avatar_component_clause,[],[f179]) ).
fof(f182,plain,
( spl0_1
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f101,f179,f175]) ).
fof(f192,definition,
( spl0_5
<=> ! [X2,X0,X1] :
( ~ less(n0,X0)
| plus(X0,times(X1,p__0)) != plus(n0,times(X2,p__0))
| ~ less(X0,p__0) ) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f193,plain,
( ! [X2,X0,X1] :
( ~ less(n0,X0)
| plus(X0,times(X1,p__0)) != plus(n0,times(X2,p__0))
| ~ less(X0,p__0) )
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f192]) ).
fof(f194,plain,
( ~ spl0_1
| spl0_5 ),
inference(avatar_split_clause,[],[f85,f192,f175]) ).
fof(f204,definition,
( spl0_8
<=> p__0 = plus(s_7(p__0),n1) ),
introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).
fof(f206,plain,
( p__0 = plus(s_7(p__0),n1)
| ~ spl0_8 ),
inference(avatar_component_clause,[],[f204]) ).
fof(f207,plain,
( spl0_8
| ~ spl0_1 ),
inference(avatar_split_clause,[],[f75,f175,f204]) ).
fof(f209,definition,
( spl0_9
<=> ! [X2,X0,X1] :
( ~ less(X0,n0)
| plus(X0,times(X1,p__0)) != plus(n0,times(X2,p__0))
| ~ less(X0,p__0) ) ),
introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition]) ).
fof(f210,plain,
( ! [X2,X0,X1] :
( ~ less(X0,n0)
| plus(X0,times(X1,p__0)) != plus(n0,times(X2,p__0))
| ~ less(X0,p__0) )
| ~ spl0_9 ),
inference(avatar_component_clause,[],[f209]) ).
fof(f211,plain,
( ~ spl0_1
| spl0_9 ),
inference(avatar_split_clause,[],[f68,f209,f175]) ).
fof(f216,plain,
( ~ less(n1,p__0)
| spl0_2 ),
inference(forward_demodulation,[],[f181,f104]) ).
fof(f217,plain,
( $false
| spl0_2 ),
inference(forward_subsumption_resolution,[],[f216,f165]) ).
fof(f218,plain,
spl0_2,
inference(avatar_contradiction_clause,[],[f217]) ).
fof(f220,plain,
n1 != plus(n1,n1),
inference(superposition,[],[f87,f104]) ).
fof(f222,plain,
! [X0] :
( times(p__0,s_4(X0)) = X0
| n1 = X0
| n1 = X0 ),
inference(superposition,[],[f125,f135]) ).
fof(f223,plain,
! [X0] :
( times(p__0,s_4(X0)) = X0
| n1 = X0 ),
inference(duplicate_literal_removal,[],[f222]) ).
fof(f225,plain,
! [X0] :
( times(p__0,s_4(X0)) = times(s_4(X0),p__0)
| n1 = X0
| n1 = X0 ),
inference(superposition,[],[f129,f135]) ).
fof(f227,plain,
! [X0] :
( times(p__0,s_4(X0)) = times(s_4(X0),p__0)
| n1 = X0 ),
inference(duplicate_literal_removal,[],[f225]) ).
fof(f242,plain,
( ! [X2,X0,X1] :
( ~ less(n0,X0)
| times(X2,p__0) != plus(X0,times(X1,p__0))
| ~ less(X0,p__0) )
| ~ spl0_5 ),
inference(forward_demodulation,[],[f193,f172]) ).
fof(f244,plain,
( ! [X2,X0,X1] :
( plus(X1,times(X2,p__0)) != times(X0,p__0)
| ~ less(X1,p__0)
| less(X1,n0)
| n0 = X1 )
| ~ spl0_5 ),
inference(resolution,[],[f242,f100]) ).
fof(f253,plain,
( ! [X2,X0,X1] :
( ~ less(X0,n0)
| times(X2,p__0) != plus(X0,times(X1,p__0))
| ~ less(X0,p__0) )
| ~ spl0_9 ),
inference(forward_demodulation,[],[f210,f172]) ).
fof(f280,plain,
! [X0,X1] : n1 != plus(X0,times(plus(X0,plus(n1,n1)),plus(X1,n1))),
inference(superposition,[],[f87,f49]) ).
fof(f290,plain,
( ! [X0] : n1 != plus(X0,times(plus(X0,plus(n1,n1)),p__0))
| ~ spl0_8 ),
inference(superposition,[],[f280,f206]) ).
fof(f354,plain,
( ! [X2,X0,X1] :
( ~ less(X1,p__0)
| plus(X1,times(X2,p__0)) != times(X0,p__0)
| n0 = X1 )
| ~ spl0_5
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f244,f253]) ).
fof(f359,plain,
( ! [X0,X1] :
( times(X1,p__0) != plus(n1,times(X0,p__0))
| n0 = n1 )
| ~ spl0_5
| ~ spl0_9 ),
inference(resolution,[],[f354,f165]) ).
fof(f364,definition,
( spl0_13
<=> n0 = n1 ),
introduced(definition,[new_symbols(definition,[spl0_13])],[avatar_definition]) ).
fof(f366,plain,
( n0 = n1
| ~ spl0_13 ),
inference(avatar_component_clause,[],[f364]) ).
fof(f368,definition,
( spl0_14
<=> ! [X0,X1] : times(X1,p__0) != plus(n1,times(X0,p__0)) ),
introduced(definition,[new_symbols(definition,[spl0_14])],[avatar_definition]) ).
fof(f369,plain,
( ! [X0,X1] : times(X1,p__0) != plus(n1,times(X0,p__0))
| ~ spl0_14 ),
inference(avatar_component_clause,[],[f368]) ).
fof(f370,plain,
( spl0_13
| spl0_14
| ~ spl0_5
| ~ spl0_9 ),
inference(avatar_split_clause,[],[f359,f209,f192,f368,f364]) ).
fof(f372,plain,
( n1 = plus(n1,n1)
| ~ spl0_13 ),
inference(superposition,[],[f104,f366]) ).
fof(f383,plain,
( $false
| ~ spl0_13 ),
inference(forward_subsumption_resolution,[],[f372,f220]) ).
fof(f384,plain,
~ spl0_13,
inference(avatar_contradiction_clause,[],[f383]) ).
fof(f398,plain,
( ! [X0,X1] :
( times(p__0,s_4(X0)) != plus(n1,times(X1,p__0))
| n1 = X0 )
| ~ spl0_14 ),
inference(superposition,[],[f369,f227]) ).
fof(f460,plain,
( ! [X0,X1] :
( plus(n1,times(X1,p__0)) != X0
| n1 = X0
| n1 = X0 )
| ~ spl0_14 ),
inference(superposition,[],[f398,f223]) ).
fof(f464,plain,
( ! [X0,X1] :
( plus(n1,times(X1,p__0)) != X0
| n1 = X0 )
| ~ spl0_14 ),
inference(duplicate_literal_removal,[],[f460]) ).
fof(f498,plain,
( ! [X0] : n1 = plus(n1,times(X0,p__0))
| ~ spl0_14 ),
inference(equality_resolution,[],[f464]) ).
fof(f506,plain,
( n1 != n1
| ~ spl0_8
| ~ spl0_14 ),
inference(superposition,[],[f290,f498]) ).
fof(f509,plain,
( $false
| ~ spl0_8
| ~ spl0_14 ),
inference(trivial_inequality_removal,[],[f506]) ).
fof(f510,plain,
( ~ spl0_8
| ~ spl0_14 ),
inference(avatar_contradiction_clause,[],[f509]) ).
cnf(s1,plain,
( spl0_1
| ~ spl0_2 ),
inference(sat_conversion,[],[f182]) ).
cnf(s4,plain,
( ~ spl0_1
| spl0_5 ),
inference(sat_conversion,[],[f194]) ).
cnf(s7,plain,
( ~ spl0_1
| spl0_8 ),
inference(sat_conversion,[],[f207]) ).
cnf(s8,plain,
( ~ spl0_1
| spl0_9 ),
inference(sat_conversion,[],[f211]) ).
cnf(s10,plain,
spl0_2,
inference(sat_conversion,[],[f218]) ).
cnf(s12,plain,
( ~ spl0_5
| ~ spl0_9
| spl0_13
| spl0_14 ),
inference(sat_conversion,[],[f370]) ).
cnf(s13,plain,
~ spl0_13,
inference(sat_conversion,[],[f384]) ).
cnf(s14,plain,
( ~ spl0_8
| ~ spl0_14 ),
inference(sat_conversion,[],[f510]) ).
cnf(s15,plain,
( ~ spl0_5
| ~ spl0_9
| spl0_14 ),
inference(rat,[],[s12,s13]) ).
cnf(s16,plain,
spl0_1,
inference(rat,[],[s1,s10]) ).
cnf(s18,plain,
spl0_9,
inference(rat,[],[s8,s16]) ).
cnf(s19,plain,
spl0_8,
inference(rat,[],[s7,s16]) ).
cnf(s22,plain,
spl0_5,
inference(rat,[],[s4,s16]) ).
cnf(s25,plain,
~ spl0_14,
inference(rat,[],[s14,s19]) ).
cnf(s26,plain,
$false,
inference(rat,[],[s15,s18,s25,s22]) ).
fof(f512,plain,
$false,
inference(avatar_sat_refutation,[],[s26]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM420-1.000 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n026.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 27 19:51:57 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 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
% 2.57/1.27 % (3169918)Input is clausal, will run a generic CNF schedule.
% 2.57/1.27 % (3169926)lrs+10_1_sil=8000:sp=occurrence:random_seed=42437239:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 2.57/1.27 % (3169924)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=2735609000:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 2.57/1.27 % (3169925)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=3404864356:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 2.57/1.27 % (3169923)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=3918565931:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 2.57/1.27 % (3169926)Instruction limit reached!
% 2.57/1.27 % (3169926)------------------------------
% 2.57/1.27 % (3169926)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.57/1.27 % (3169926)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.57/1.27 % (3169926)CaDiCaL version: 2.1.3
% 2.57/1.27 % (3169926)Termination reason: Instruction limit
% 2.57/1.27 % (3169926)Termination phase: Saturation
% 2.57/1.27 % (3169926)Time elapsed: 0.037 s
% 2.57/1.27 % (3169926)Peak memory usage: 89 MB
% 2.57/1.27 % (3169926)Instructions burned: 109 (million)
% 2.57/1.27 % (3169928)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=4057984928:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 2.57/1.27 % (3169929)dis-21_1_sil=8000:lcm=predicate:random_seed=1737230735: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)
% 2.57/1.27 % (3169927)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=2889742889:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 2.57/1.27 % (3169928)First to succeed.
% 2.57/1.27 % (3169928)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3169918"
% 2.57/1.27 % (3169929)Instruction limit reached!
% 2.57/1.27 % (3169929)------------------------------
% 2.57/1.27 % (3169929)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.57/1.27 % (3169929)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.57/1.27 % (3169929)CaDiCaL version: 2.1.3
% 2.57/1.27 % (3169929)Termination reason: Instruction limit
% 2.57/1.27 % (3169929)Termination phase: Saturation
% 2.57/1.27 % (3169929)Time elapsed: 0.071 s
% 2.57/1.27 % (3169929)Peak memory usage: 89 MB
% 2.57/1.27 % (3169929)Instructions burned: 118 (million)
% 2.57/1.27 % (3169927)Instruction limit reached!
% 2.57/1.27 % (3169927)------------------------------
% 2.57/1.27 % (3169927)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.57/1.27 % (3169927)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.57/1.27 % (3169927)CaDiCaL version: 2.1.3
% 2.57/1.27 % (3169927)Termination reason: Instruction limit
% 2.57/1.27 % (3169927)Termination phase: Saturation
% 2.57/1.27 % (3169927)Time elapsed: 0.072 s
% 2.57/1.27 % (3169927)Peak memory usage: 89 MB
% 2.57/1.27 % (3169927)Instructions burned: 114 (million)
% 2.57/1.27 % (3169934)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=1689066696:i=143:sd=2:aac=none:ss=axioms:sgt=16_2998 on theBenchmark for (2998ds/143Mi)
% 2.57/1.27 % (3169934)Instruction limit reached!
% 2.57/1.27 % (3169934)------------------------------
% 2.57/1.27 % (3169934)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.57/1.27 % (3169934)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.57/1.27 % (3169934)CaDiCaL version: 2.1.3
% 2.57/1.27 % (3169934)Termination reason: Instruction limit
% 2.57/1.27 % (3169934)Termination phase: Saturation
% 2.57/1.27 % (3169934)Time elapsed: 0.043 s
% 2.57/1.27 % (3169934)Peak memory usage: 89 MB
% 2.57/1.27 % (3169934)Instructions burned: 145 (million)
% 2.57/1.27 % (3169938)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=120693624:st=3:avsq=on:s2a=on:i=189:s2at=1.2:avsqr=1,16:sd=2:bd=all:nm=64:ss=axioms:sgt=30_2997 on theBenchmark for (2997ds/189Mi)
% 2.57/1.27 % (3169939)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=1202010207:st=4:i=219:sd=3:ss=axioms_2997 on theBenchmark for (2997ds/219Mi)
% 2.57/1.27 % (3169941)lrs+10_64_to=lpo:sil=8000:random_seed=3879778300:i=126:bd=preordered_2997 on theBenchmark for (2997ds/126Mi)
% 3.58/1.47 % (3169941)Instruction limit reached!
% 3.58/1.47 % (3169941)------------------------------
% 3.58/1.47 % (3169941)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.58/1.47 % (3169941)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.58/1.47 % (3169941)CaDiCaL version: 2.1.3
% 3.58/1.47 % (3169941)Termination reason: Instruction limit
% 3.58/1.47 % (3169941)Termination phase: Saturation
% 3.58/1.47 % (3169941)Time elapsed: 0.036 s
% 3.58/1.47 % (3169941)Peak memory usage: 89 MB
% 3.58/1.47 % (3169941)Instructions burned: 131 (million)
% 3.58/1.47 % (3169928)Refutation found. Thanks to Tanya!
% 3.58/1.47 % SZS status Unsatisfiable for theBenchmark
% 3.58/1.47 % SZS output start Proof for theBenchmark
% See solution above
% 3.58/1.47 % (3169928)------------------------------
% 3.58/1.47 % (3169928)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.58/1.47 % (3169928)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.58/1.47 % (3169928)CaDiCaL version: 2.1.3
% 3.58/1.47 % (3169928)Termination reason: Refutation
% 3.58/1.47 % (3169928)Time elapsed: 0.021 s
% 3.58/1.47 % (3169928)Peak memory usage: 90 MB
% 3.58/1.47 % (3169928)Instructions burned: 25 (million)
% 3.58/1.47 % (3169928)------------------------------
% 3.58/1.47 % (3169928)------------------------------
% 3.58/1.47 % (3169918)Success in time 0.42 s
% 3.58/1.47 % Vampire exiting
%------------------------------------------------------------------------------