↑ Up

Vampire-SAT---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : NUN135-1.006 : TPTP v9.3.1. Released v9.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n009.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:27:11 PM UTC 2026

% Result   : Unsatisfiable 2.46s 0.99s
% Output   : Refutation 2.46s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   22
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   67 (  67 unt;   0 def)
%            Number of atoms       :   67 (  66 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    2 (   2   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    8 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   3 con; 0-4 aty)
%            Number of variables   :  138 ( 138   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0] : minus(X0,zero) = X0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule1) ).

fof(f2,axiom,
    ! [X0,X1] : minus(s(X0),s(X1)) = minus(X0,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule2) ).

fof(f3,axiom,
    ! [X0] : '<='(zero,X0) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule3) ).

fof(f4,axiom,
    ! [X0] : '<='(s(X0),zero) = false,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule4) ).

fof(f5,axiom,
    ! [X0,X1] : '<='(s(X0),s(X1)) = '<='(X0,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule5) ).

fof(f6,axiom,
    ! [X0,X1] : if(true,X0,X1) = X0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule6) ).

fof(f7,axiom,
    ! [X0,X1] : if(false,X0,X1) = X1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule7) ).

fof(f10,axiom,
    ! [X0] : perfectp(s(X0)) = f(X0,s(zero),s(X0),s(X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule9) ).

fof(f11,axiom,
    ! [X0,X1] : f(zero,X0,zero,X1) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule10) ).

fof(f12,plain,
    ! [X0,X1] : true = f(zero,X0,zero,X1),
    inference(reorient_equations,[],[f11]) ).

fof(f15,axiom,
    ! [X2,X0,X1] : f(s(X0),zero,X1,X2) = f(X0,X2,minus(X1,s(X0)),X2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule12) ).

fof(f16,axiom,
    ! [X2,X3,X0,X1] : f(s(X0),s(X1),X2,X3) = if('<='(X0,X1),f(s(X0),minus(X1,X0),X2,X3),f(X0,X3,X2,X3)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule13) ).

fof(f17,negated_conjecture,
    ! [X0] : perfectp(X0) != true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).

fof(f18,plain,
    ! [X0] : true != perfectp(X0),
    inference(reorient_equations,[],[f17]) ).

fof(f23,plain,
    ! [X2,X0,X1] : f(s(X1),zero,s(X0),X2) = f(X1,X2,minus(X0,X1),X2),
    inference(superposition,[],[f15,f2]) ).

fof(f24,plain,
    ! [X0,X1] : f(s(zero),zero,s(X0),X1) = f(zero,X1,X0,X1),
    inference(superposition,[],[f23,f1]) ).

fof(f25,plain,
    ! [X2,X0,X1] : f(s(s(X1)),zero,s(s(X0)),X2) = f(s(X1),X2,minus(X0,X1),X2),
    inference(superposition,[],[f23,f2]) ).

fof(f27,plain,
    ! [X0] : true = f(s(zero),zero,s(zero),X0),
    inference(superposition,[],[f24,f12]) ).

fof(f55,plain,
    ! [X0,X1] : f(s(s(zero)),zero,s(s(X0)),X1) = f(s(zero),X1,X0,X1),
    inference(superposition,[],[f25,f1]) ).

fof(f56,plain,
    ! [X2,X0,X1] : f(s(s(s(X1))),zero,s(s(s(X0))),X2) = f(s(s(X1)),X2,minus(X0,X1),X2),
    inference(superposition,[],[f25,f2]) ).

fof(f66,plain,
    ! [X0,X1] : f(s(s(s(zero))),zero,s(s(s(X0))),X1) = f(s(s(zero)),X1,X0,X1),
    inference(superposition,[],[f56,f1]) ).

fof(f118,plain,
    ! [X2,X0,X1] : f(s(s(X0)),s(zero),X1,X2) = if(false,f(s(s(X0)),minus(zero,s(X0)),X1,X2),f(s(X0),X2,X1,X2)),
    inference(superposition,[],[f16,f4]) ).

fof(f120,plain,
    ! [X2,X0,X1] : f(s(zero),s(X0),X1,X2) = if('<='(zero,X0),f(s(zero),X0,X1,X2),f(zero,X2,X1,X2)),
    inference(superposition,[],[f16,f1]) ).

fof(f121,plain,
    ! [X2,X3,X0,X1] : f(s(s(X1)),s(s(X0)),X2,X3) = if('<='(s(X1),s(X0)),f(s(s(X1)),minus(X0,X1),X2,X3),f(s(X1),X3,X2,X3)),
    inference(superposition,[],[f16,f2]) ).

fof(f164,plain,
    ! [X2,X3,X0,X1] : f(s(s(X1)),s(s(X0)),X2,X3) = if('<='(X1,X0),f(s(s(X1)),minus(X0,X1),X2,X3),f(s(X1),X3,X2,X3)),
    inference(forward_demodulation,[],[f121,f5]) ).

fof(f165,plain,
    ! [X2,X0,X1] : f(s(zero),s(X0),X1,X2) = if(true,f(s(zero),X0,X1,X2),f(zero,X2,X1,X2)),
    inference(forward_demodulation,[],[f120,f3]) ).

fof(f167,plain,
    ! [X2,X0,X1] : f(s(s(X0)),s(zero),X1,X2) = f(s(X0),X2,X1,X2),
    inference(forward_demodulation,[],[f118,f7]) ).

fof(f174,plain,
    ! [X2,X0,X1] : f(s(zero),s(X0),X1,X2) = f(s(zero),X0,X1,X2),
    inference(forward_demodulation,[],[f165,f6]) ).

fof(f205,plain,
    ! [X0,X1] : f(s(s(zero)),zero,s(s(X0)),X1) = f(s(s(zero)),s(zero),X0,X1),
    inference(superposition,[],[f167,f55]) ).

fof(f206,plain,
    ! [X0,X1] : f(s(s(s(zero))),zero,s(s(s(X0))),X1) = f(s(s(s(zero))),s(zero),X0,X1),
    inference(superposition,[],[f167,f66]) ).

fof(f208,plain,
    ! [X0,X1] : f(s(zero),X0,X1,s(X0)) = f(s(s(zero)),s(zero),X1,s(X0)),
    inference(superposition,[],[f167,f174]) ).

fof(f237,plain,
    ! [X0,X1] : f(s(zero),X0,X1,s(s(X0))) = f(s(s(zero)),s(zero),X1,s(s(X0))),
    inference(superposition,[],[f208,f174]) ).

fof(f310,plain,
    ! [X0,X1] : f(s(zero),X0,X1,s(s(s(X0)))) = f(s(s(zero)),s(zero),X1,s(s(s(X0)))),
    inference(superposition,[],[f237,f174]) ).

fof(f394,plain,
    ! [X0,X1] : f(s(zero),X0,X1,s(s(s(s(X0))))) = f(s(s(zero)),s(zero),X1,s(s(s(s(X0))))),
    inference(superposition,[],[f310,f174]) ).

fof(f801,plain,
    ! [X2,X0,X1] : f(s(s(s(X0))),s(s(zero)),X1,X2) = if(false,f(s(s(s(X0))),minus(zero,s(X0)),X1,X2),f(s(s(X0)),X2,X1,X2)),
    inference(superposition,[],[f164,f4]) ).

fof(f803,plain,
    ! [X2,X0,X1] : f(s(s(zero)),s(s(X0)),X1,X2) = if('<='(zero,X0),f(s(s(zero)),X0,X1,X2),f(s(zero),X2,X1,X2)),
    inference(superposition,[],[f164,f1]) ).

fof(f804,plain,
    ! [X2,X3,X0,X1] : f(s(s(s(X1))),s(s(s(X0))),X2,X3) = if('<='(s(X1),s(X0)),f(s(s(s(X1))),minus(X0,X1),X2,X3),f(s(s(X1)),X3,X2,X3)),
    inference(superposition,[],[f164,f2]) ).

fof(f881,plain,
    ! [X2,X3,X0,X1] : f(s(s(s(X1))),s(s(s(X0))),X2,X3) = if('<='(X1,X0),f(s(s(s(X1))),minus(X0,X1),X2,X3),f(s(s(X1)),X3,X2,X3)),
    inference(forward_demodulation,[],[f804,f5]) ).

fof(f882,plain,
    ! [X2,X0,X1] : f(s(s(zero)),s(s(X0)),X1,X2) = if(true,f(s(s(zero)),X0,X1,X2),f(s(zero),X2,X1,X2)),
    inference(forward_demodulation,[],[f803,f3]) ).

fof(f884,plain,
    ! [X2,X0,X1] : f(s(s(s(X0))),s(s(zero)),X1,X2) = f(s(s(X0)),X2,X1,X2),
    inference(forward_demodulation,[],[f801,f7]) ).

fof(f898,plain,
    ! [X2,X0,X1] : f(s(s(zero)),s(s(X0)),X1,X2) = f(s(s(zero)),X0,X1,X2),
    inference(forward_demodulation,[],[f882,f6]) ).

fof(f911,plain,
    ! [X0,X1] : f(s(s(zero)),X1,X0,s(s(X1))) = f(s(s(s(zero))),s(zero),X0,s(s(X1))),
    inference(superposition,[],[f898,f167]) ).

fof(f940,plain,
    ! [X2,X0,X1] : f(s(s(s(X0))),s(s(zero)),X1,X2) = f(s(s(s(X0))),s(zero),X1,X2),
    inference(superposition,[],[f884,f167]) ).

fof(f1026,plain,
    ! [X0,X1] : f(s(s(zero)),X0,X1,s(s(s(s(X0))))) = f(s(s(s(zero))),s(zero),X1,s(s(s(s(X0))))),
    inference(superposition,[],[f911,f898]) ).

fof(f2906,plain,
    ! [X2,X0,X1] : f(s(s(s(zero))),s(s(s(X0))),X1,X2) = if('<='(zero,X0),f(s(s(s(zero))),X0,X1,X2),f(s(s(zero)),X2,X1,X2)),
    inference(superposition,[],[f881,f1]) ).

fof(f2907,plain,
    ! [X2,X3,X0,X1] : f(s(s(s(s(X1)))),s(s(s(s(X0)))),X2,X3) = if('<='(s(X1),s(X0)),f(s(s(s(s(X1)))),minus(X0,X1),X2,X3),f(s(s(s(X1))),X3,X2,X3)),
    inference(superposition,[],[f881,f2]) ).

fof(f2997,plain,
    ! [X2,X3,X0,X1] : f(s(s(s(s(X1)))),s(s(s(s(X0)))),X2,X3) = if('<='(X1,X0),f(s(s(s(s(X1)))),minus(X0,X1),X2,X3),f(s(s(s(X1))),X3,X2,X3)),
    inference(forward_demodulation,[],[f2907,f5]) ).

fof(f2998,plain,
    ! [X2,X0,X1] : f(s(s(s(zero))),s(s(s(X0))),X1,X2) = if(true,f(s(s(s(zero))),X0,X1,X2),f(s(s(zero)),X2,X1,X2)),
    inference(forward_demodulation,[],[f2906,f3]) ).

fof(f3016,plain,
    ! [X2,X0,X1] : f(s(s(s(zero))),s(s(s(X0))),X1,X2) = f(s(s(s(zero))),X0,X1,X2),
    inference(forward_demodulation,[],[f2998,f6]) ).

fof(f3036,plain,
    ! [X0,X1] : f(s(s(s(zero))),X1,X0,s(s(s(X1)))) = f(s(s(s(s(zero)))),s(zero),X0,s(s(s(X1)))),
    inference(superposition,[],[f3016,f167]) ).

fof(f3183,plain,
    ! [X0,X1] : f(s(s(s(zero))),X0,X1,s(s(s(s(s(s(X0))))))) = f(s(s(s(s(zero)))),s(zero),X1,s(s(s(s(s(s(X0))))))),
    inference(superposition,[],[f3036,f3016]) ).

fof(f6113,plain,
    ! [X2,X0,X1] : f(s(s(s(s(zero)))),s(s(s(s(X0)))),X1,X2) = if('<='(zero,X0),f(s(s(s(s(zero)))),X0,X1,X2),f(s(s(s(zero))),X2,X1,X2)),
    inference(superposition,[],[f2997,f1]) ).

fof(f6218,plain,
    ! [X2,X0,X1] : f(s(s(s(s(zero)))),s(s(s(s(X0)))),X1,X2) = if(true,f(s(s(s(s(zero)))),X0,X1,X2),f(s(s(s(zero))),X2,X1,X2)),
    inference(forward_demodulation,[],[f6113,f3]) ).

fof(f6232,plain,
    ! [X2,X0,X1] : f(s(s(s(s(zero)))),s(s(s(s(X0)))),X1,X2) = f(s(s(s(s(zero)))),X0,X1,X2),
    inference(forward_demodulation,[],[f6218,f6]) ).

fof(f6253,plain,
    ! [X0,X1] : f(s(s(s(s(zero)))),X1,X0,s(s(s(s(X1))))) = f(s(s(s(s(s(zero))))),s(zero),X0,s(s(s(s(X1))))),
    inference(superposition,[],[f6232,f167]) ).

fof(f6475,plain,
    perfectp(s(s(s(s(s(s(zero))))))) = f(s(s(s(s(zero)))),s(s(zero)),s(s(s(s(s(s(zero)))))),s(s(s(s(s(s(zero))))))),
    inference(superposition,[],[f10,f6253]) ).

fof(f6476,plain,
    perfectp(s(s(s(s(s(s(zero))))))) = f(s(s(s(s(zero)))),s(zero),s(s(s(s(s(s(zero)))))),s(s(s(s(s(s(zero))))))),
    inference(forward_demodulation,[],[f6475,f940]) ).

fof(f6489,plain,
    perfectp(s(s(s(s(s(s(zero))))))) = f(s(s(s(zero))),zero,s(s(s(s(s(s(zero)))))),s(s(s(s(s(s(zero))))))),
    inference(forward_demodulation,[],[f6476,f3183]) ).

fof(f6494,plain,
    perfectp(s(s(s(s(s(s(zero))))))) = f(s(s(s(zero))),s(zero),s(s(s(zero))),s(s(s(s(s(s(zero))))))),
    inference(forward_demodulation,[],[f6489,f206]) ).

fof(f6499,plain,
    perfectp(s(s(s(s(s(s(zero))))))) = f(s(s(zero)),s(s(zero)),s(s(s(zero))),s(s(s(s(s(s(zero))))))),
    inference(forward_demodulation,[],[f6494,f1026]) ).

fof(f6504,plain,
    perfectp(s(s(s(s(s(s(zero))))))) = f(s(s(zero)),zero,s(s(s(zero))),s(s(s(s(s(s(zero))))))),
    inference(forward_demodulation,[],[f6499,f898]) ).

fof(f6508,plain,
    f(s(s(zero)),s(zero),s(zero),s(s(s(s(s(s(zero))))))) = perfectp(s(s(s(s(s(s(zero))))))),
    inference(forward_demodulation,[],[f6504,f205]) ).

fof(f6510,plain,
    perfectp(s(s(s(s(s(s(zero))))))) = f(s(zero),s(s(zero)),s(zero),s(s(s(s(s(s(zero))))))),
    inference(forward_demodulation,[],[f6508,f394]) ).

fof(f6512,plain,
    perfectp(s(s(s(s(s(s(zero))))))) = f(s(zero),s(zero),s(zero),s(s(s(s(s(s(zero))))))),
    inference(forward_demodulation,[],[f6510,f174]) ).

fof(f6514,plain,
    f(s(zero),zero,s(zero),s(s(s(s(s(s(zero))))))) = perfectp(s(s(s(s(s(s(zero))))))),
    inference(forward_demodulation,[],[f6512,f174]) ).

fof(f6516,plain,
    true = perfectp(s(s(s(s(s(s(zero))))))),
    inference(forward_demodulation,[],[f6514,f27]) ).

fof(f6518,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f6516,f18]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUN135-1.006 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.14/0.41  % Computer : n009.cluster.edu
% 0.14/0.41  % Model    : x86_64 x86_64
% 0.14/0.41  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.41  % Memory   : 8046.5625MB
% 0.14/0.41  % OS       : Linux 6.8.0-71-generic
% 0.14/0.41  % CPULimit : 300
% 0.14/0.41  % WCLimit  : 300
% 0.14/0.41  % DateTime : Sun Sep 27 22:06:00 UTC 2026
% 0.14/0.42  % CPUTime  : 
% 0.14/0.42  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.14/0.47  Running first-order model finding
% 0.22/0.47  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
% 2.46/0.99  % (2447136)Will run a generic schedule for satisfiability detection.
% 2.46/0.99  % (2447142)% WARNING: option uhcvi not known.
% 2.46/0.99  % (2447142)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1609349943:i=135531:add=off:rawr=on_3000 on theBenchmark for (3000ds/135531Mi)
% 2.46/0.99  % (2447141)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1736978026_3000 on theBenchmark for (3000ds/0Mi)
% 2.46/0.99  % (2447143)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3963353150:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 2.46/0.99  % (2447144)dis+10_1_sil=32000:sp=arity:random_seed=3229147000:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 2.46/0.99  % (2447145)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=506738922:i=116_3000 on theBenchmark for (3000ds/116Mi)
% 2.46/0.99  % (2447146)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1578895471:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 2.46/0.99  % (2447147)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1817594356:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_3000 on theBenchmark for (3000ds/159Mi)
% 2.46/0.99  % TRYING [1]
% 2.46/0.99  % TRYING [2]
% 2.46/0.99  % TRYING [3]
% 2.46/0.99  % TRYING [4]
% 2.46/0.99  % (2447144)Instruction limit reached! 
% 2.46/0.99  % (2447144)------------------------------
% 2.46/0.99  % (2447144)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.46/0.99  % (2447144)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.46/0.99  % (2447144)CaDiCaL version: 2.1.3
% 2.46/0.99  % (2447144)Termination reason: Instruction limit
% 2.46/0.99  % (2447144)Termination phase: Saturation
% 2.46/0.99  % (2447144)Time elapsed: 0.098 s
% 2.46/0.99  % (2447144)Peak memory usage: 11 MB
% 2.46/0.99  % (2447144)Instructions burned: 103 (million)
% 2.46/0.99  % (2447145)Instruction limit reached! 
% 2.46/0.99  % (2447145)------------------------------
% 2.46/0.99  % (2447145)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.46/0.99  % (2447145)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.46/0.99  % (2447145)CaDiCaL version: 2.1.3
% 2.46/0.99  % (2447145)Termination reason: Instruction limit
% 2.46/0.99  % (2447145)Termination phase: Saturation
% 2.46/0.99  % (2447145)Time elapsed: 0.114 s
% 2.46/0.99  % (2447145)Peak memory usage: 12 MB
% 2.46/0.99  % (2447145)Instructions burned: 116 (million)
% 2.46/0.99  % (2447157)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2669038329:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 2.46/0.99  % TRYING [1]
% 2.46/0.99  % TRYING [2]
% 2.46/0.99  % (2447146)Instruction limit reached! 
% 2.46/0.99  % (2447146)------------------------------
% 2.46/0.99  % (2447146)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.46/0.99  % (2447146)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.46/0.99  % (2447146)CaDiCaL version: 2.1.3
% 2.46/0.99  % (2447146)Termination reason: Instruction limit
% 2.46/0.99  % (2447146)Termination phase: Saturation
% 2.46/0.99  % (2447146)Time elapsed: 0.123 s
% 2.46/0.99  % TRYING [3]
% 2.46/0.99  % (2447146)Peak memory usage: 12 MB
% 2.46/0.99  % (2447146)Instructions burned: 131 (million)
% 2.46/0.99  % (2447147)Instruction limit reached! 
% 2.46/0.99  % (2447147)------------------------------
% 2.46/0.99  % (2447147)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.46/0.99  % (2447147)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.46/0.99  % (2447147)CaDiCaL version: 2.1.3
% 2.46/0.99  % (2447147)Termination reason: Instruction limit
% 2.46/0.99  % (2447147)Termination phase: Saturation
% 2.46/0.99  % (2447147)Time elapsed: 0.145 s
% 2.46/0.99  % (2447147)Peak memory usage: 12 MB
% 2.46/0.99  % (2447147)Instructions burned: 159 (million)
% 2.46/0.99  % (2447158)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1287242784:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 2.46/0.99  % (2447160)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=1196925673:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 2.46/0.99  % TRYING [4]
% 2.46/0.99  % (2447162)ott-21_1_sil=16000:fs=off:random_seed=503694973:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 2.46/0.99  % TRYING [5]
% 2.46/0.99  % (2447158)Instruction limit reached! 
% 2.46/0.99  % (2447158)------------------------------
% 2.46/0.99  % (2447158)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.46/0.99  % (2447158)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.46/0.99  % (2447158)CaDiCaL version: 2.1.3
% 2.46/0.99  % (2447158)Termination reason: Instruction limit
% 2.46/0.99  % (2447158)Termination phase: Saturation
% 2.46/0.99  % (2447158)Time elapsed: 0.131 s
% 2.46/0.99  % (2447158)Peak memory usage: 12 MB
% 2.46/0.99  % (2447158)Instructions burned: 131 (million)
% 2.46/0.99  % (2447165)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=1822125088:i=477:bd=all_2996 on theBenchmark for (2996ds/477Mi)
% 2.46/0.99  % (2447162)Instruction limit reached! 
% 2.46/0.99  % (2447162)------------------------------
% 2.46/0.99  % (2447162)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.46/0.99  % (2447162)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.46/0.99  % (2447162)CaDiCaL version: 2.1.3
% 2.46/0.99  % (2447162)Termination reason: Instruction limit
% 2.46/0.99  % (2447162)Termination phase: Saturation
% 2.46/0.99  % (2447162)Time elapsed: 0.161 s
% 2.46/0.99  % (2447162)Peak memory usage: 11 MB
% 2.46/0.99  % (2447162)Instructions burned: 181 (million)
% 2.46/0.99  % TRYING [5]
% 2.46/0.99  % (2447167)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3689558165:fmbsr=1.3:i=865:ins=25_2996 on theBenchmark for (2996ds/865Mi)
% 2.46/0.99  % TRYING [1]
% 2.46/0.99  % TRYING [2]
% 2.46/0.99  % TRYING [3]
% 2.46/0.99  % TRYING [4]
% 2.46/0.99  % (2447143) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2447136-2447143"...
% 2.46/0.99  % (2447143)...printing done.
% 2.46/0.99  % (2447143)Refutation found. Thanks to Tanya!
% 2.46/0.99  % SZS status Unsatisfiable for theBenchmark
% 2.46/0.99  % SZS output start Proof for theBenchmark
% See solution above
% 2.46/0.99  % (2447143)------------------------------
% 2.46/0.99  % (2447143)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.46/0.99  % (2447143)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.46/0.99  % (2447143)CaDiCaL version: 2.1.3
% 2.46/0.99  % (2447143)Termination reason: Refutation
% 2.46/0.99  % (2447143)Time elapsed: 0.461 s
% 2.46/0.99  % (2447143)Peak memory usage: 14 MB
% 2.46/0.99  % (2447143)Instructions burned: 516 (million)
% 2.46/0.99  % (2447136)Success in time 0.509 s
% 2.46/0.99  % Vampire exiting
%------------------------------------------------------------------------------