↑ 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  : GRP095-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT

% 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 10:16:38 AM UTC 2026

% Result   : Unsatisfiable 0.89s 0.59s
% Output   : Refutation 0.89s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   22
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   80 (  54 unt;   4 def)
%            Number of atoms       :  116 (  73 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   69 (  33   ~;  32   |;   0   &)
%                                         (   4 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    6 (   4 usr;   5 prp; 0-2 aty)
%            Number of functors    :   13 (  13 usr;  10 con; 0-2 aty)
%            Number of variables   :  112 (   0 sgn 112   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X2,X0,X1] : divide(divide(identity,X0),divide(divide(divide(X1,X0),X2),X1)) = X2,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).

fof(f2,axiom,
    ! [X0,X1] : multiply(X0,X1) = divide(X0,divide(identity,X1)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).

fof(f3,axiom,
    ! [X0] : inverse(X0) = divide(identity,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',inverse) ).

fof(f4,plain,
    ! [X0] : divide(identity,X0) = inverse(X0),
    inference(reorient_equations,[],[f3]) ).

fof(f5,axiom,
    ! [X0] : identity = divide(X0,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',identity) ).

fof(f6,negated_conjecture,
    ( multiply(inverse(a1),a1) != multiply(inverse(b1),b1)
    | multiply(multiply(inverse(b2),b2),a2) != a2
    | multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
    | multiply(a4,b4) != multiply(b4,a4) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms) ).

fof(f7,plain,
    ( multiply(inverse(a1),a1) != multiply(inverse(b1),b1)
    | a2 != multiply(multiply(inverse(b2),b2),a2)
    | multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
    | multiply(a4,b4) != multiply(b4,a4) ),
    inference(reorient_equations,[],[f6]) ).

fof(f8,plain,
    ( divide(divide(identity,a1),divide(identity,a1)) != divide(divide(identity,b1),divide(identity,b1))
    | a2 != divide(divide(divide(identity,b2),divide(identity,b2)),divide(identity,a2))
    | divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != divide(a3,divide(identity,divide(b3,divide(identity,c3))))
    | divide(a4,divide(identity,b4)) != divide(b4,divide(identity,a4)) ),
    inference(definition_unfolding,[],[f7,f2,f4,f2,f4,f2,f2,f4,f2,f2,f2,f2,f2,f2]) ).

fof(f10,definition,
    ( spl0_1
  <=> divide(a4,divide(identity,b4)) = divide(b4,divide(identity,a4)) ),
    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).

fof(f12,plain,
    ( divide(a4,divide(identity,b4)) != divide(b4,divide(identity,a4))
    | spl0_1 ),
    inference(avatar_component_clause,[],[f10]) ).

fof(f14,definition,
    ( spl0_2
  <=> divide(divide(a3,divide(identity,b3)),divide(identity,c3)) = divide(a3,divide(identity,divide(b3,divide(identity,c3)))) ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

fof(f16,plain,
    ( divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != divide(a3,divide(identity,divide(b3,divide(identity,c3))))
    | spl0_2 ),
    inference(avatar_component_clause,[],[f14]) ).

fof(f18,definition,
    ( spl0_3
  <=> a2 = divide(divide(divide(identity,b2),divide(identity,b2)),divide(identity,a2)) ),
    introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).

fof(f20,plain,
    ( a2 != divide(divide(divide(identity,b2),divide(identity,b2)),divide(identity,a2))
    | spl0_3 ),
    inference(avatar_component_clause,[],[f18]) ).

fof(f22,definition,
    ( spl0_4
  <=> divide(divide(identity,a1),divide(identity,a1)) = divide(divide(identity,b1),divide(identity,b1)) ),
    introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).

fof(f24,plain,
    ( divide(divide(identity,a1),divide(identity,a1)) != divide(divide(identity,b1),divide(identity,b1))
    | spl0_4 ),
    inference(avatar_component_clause,[],[f22]) ).

fof(f25,plain,
    ( ~ spl0_1
    | ~ spl0_2
    | ~ spl0_3
    | ~ spl0_4 ),
    inference(avatar_split_clause,[],[f8,f22,f18,f14,f10]) ).

fof(f26,plain,
    ! [X0,X1] : divide(identity,divide(divide(divide(X0,identity),X1),X0)) = X1,
    inference(superposition,[],[f1,f5]) ).

fof(f27,plain,
    ! [X0,X1] : divide(divide(identity,X0),divide(divide(identity,X1),X0)) = X1,
    inference(superposition,[],[f1,f5]) ).

fof(f28,plain,
    ! [X2,X3,X0,X1] : divide(divide(identity,divide(divide(divide(X1,X2),X0),X1)),divide(divide(X0,X3),divide(identity,X2))) = X3,
    inference(superposition,[],[f1,f1]) ).

fof(f29,plain,
    ! [X2,X0,X1] : divide(divide(divide(X2,X1),X0),X2) = divide(divide(identity,X1),divide(X0,identity)),
    inference(superposition,[],[f1,f1]) ).

fof(f30,plain,
    ! [X0,X1] : divide(X1,X0) = divide(divide(identity,X0),divide(identity,X1)),
    inference(superposition,[],[f1,f5]) ).

fof(f31,plain,
    ! [X2,X0] : divide(divide(identity,X0),divide(divide(identity,X0),divide(X2,identity))) = X2,
    inference(backward_demodulation,[],[f1,f29]) ).

fof(f32,plain,
    ! [X2,X3,X0] : divide(divide(identity,divide(divide(identity,X2),divide(X0,identity))),divide(divide(X0,X3),divide(identity,X2))) = X3,
    inference(forward_demodulation,[],[f28,f29]) ).

fof(f33,plain,
    ! [X1] : divide(identity,divide(divide(identity,identity),divide(X1,identity))) = X1,
    inference(forward_demodulation,[],[f26,f29]) ).

fof(f34,plain,
    ! [X1] : divide(identity,divide(identity,divide(X1,identity))) = X1,
    inference(forward_demodulation,[],[f33,f5]) ).

fof(f40,plain,
    ! [X0,X1] : divide(X0,divide(X0,divide(X1,identity))) = X1,
    inference(superposition,[],[f31,f34]) ).

fof(f44,plain,
    ! [X0,X1] : divide(divide(identity,divide(divide(identity,X0),X1)),X0) = X1,
    inference(superposition,[],[f27,f27]) ).

fof(f52,plain,
    ! [X0] : divide(X0,identity) = X0,
    inference(superposition,[],[f27,f40]) ).

fof(f55,plain,
    ! [X0,X1] : divide(X0,divide(X0,X1)) = X1,
    inference(backward_demodulation,[],[f40,f52]) ).

fof(f56,plain,
    ! [X2,X3,X0] : divide(divide(identity,divide(divide(identity,X2),X0)),divide(divide(X0,X3),divide(identity,X2))) = X3,
    inference(backward_demodulation,[],[f32,f52]) ).

fof(f57,plain,
    ! [X2,X0,X1] : divide(divide(identity,X1),X0) = divide(divide(divide(X2,X1),X0),X2),
    inference(backward_demodulation,[],[f29,f52]) ).

fof(f75,plain,
    ! [X0,X1] : divide(divide(identity,X1),X0) = divide(divide(identity,X0),X1),
    inference(superposition,[],[f57,f5]) ).

fof(f77,plain,
    ! [X2,X0,X1] : divide(divide(identity,divide(identity,X0)),X2) = divide(divide(divide(X0,X1),X2),divide(identity,X1)),
    inference(superposition,[],[f57,f30]) ).

fof(f82,plain,
    ! [X0,X1] : divide(divide(X0,X1),X0) = divide(divide(identity,X1),identity),
    inference(superposition,[],[f57,f52]) ).

fof(f83,plain,
    ! [X0,X1] : divide(identity,X1) = divide(divide(X0,X1),X0),
    inference(forward_demodulation,[],[f82,f52]) ).

fof(f84,plain,
    ! [X2,X0,X1] : divide(divide(divide(X0,X1),X2),divide(identity,X1)) = divide(X0,X2),
    inference(forward_demodulation,[],[f77,f55]) ).

fof(f90,plain,
    ! [X2,X0,X1] : divide(divide(identity,divide(X1,X0)),X2) = divide(divide(X0,X2),X1),
    inference(superposition,[],[f57,f55]) ).

fof(f92,plain,
    ! [X0,X1] : divide(X0,divide(identity,X1)) = divide(X1,divide(identity,X0)),
    inference(superposition,[],[f30,f55]) ).

fof(f94,plain,
    ! [X0,X1] : divide(divide(X1,X0),divide(identity,X0)) = X1,
    inference(backward_demodulation,[],[f44,f90]) ).

fof(f96,plain,
    ! [X2,X3,X0] : divide(divide(X0,divide(divide(X0,X3),divide(identity,X2))),divide(identity,X2)) = X3,
    inference(backward_demodulation,[],[f56,f90]) ).

fof(f97,plain,
    ! [X2,X3,X0] : divide(X2,divide(identity,divide(X0,divide(divide(X0,X3),divide(identity,X2))))) = X3,
    inference(forward_demodulation,[],[f96,f92]) ).

fof(f99,plain,
    ! [X0,X1] : divide(X0,divide(identity,divide(X1,X0))) = X1,
    inference(forward_demodulation,[],[f94,f92]) ).

fof(f119,plain,
    ! [X2,X3,X0,X1] : divide(divide(identity,divide(identity,divide(X1,divide(divide(X1,X0),divide(identity,X2))))),X3) = divide(divide(X0,X3),X2),
    inference(superposition,[],[f57,f97]) ).

fof(f123,plain,
    ! [X2,X3,X0,X1] : divide(X0,X3) = divide(divide(identity,X1),divide(identity,divide(X2,divide(divide(X2,X0),divide(identity,divide(X3,X1)))))),
    inference(superposition,[],[f57,f97]) ).

fof(f124,plain,
    ! [X2,X3,X0,X1] : divide(X0,X3) = divide(divide(X2,divide(divide(X2,X0),divide(identity,divide(X3,X1)))),X1),
    inference(forward_demodulation,[],[f123,f30]) ).

fof(f128,plain,
    ! [X2,X3,X0,X1] : divide(divide(X0,X3),X2) = divide(divide(divide(X1,divide(divide(X1,X0),divide(identity,X2))),X3),identity),
    inference(forward_demodulation,[],[f119,f90]) ).

fof(f148,plain,
    ! [X2,X3,X0,X1] : divide(divide(X0,X3),X2) = divide(divide(X1,divide(divide(X1,X0),divide(identity,X2))),X3),
    inference(forward_demodulation,[],[f128,f52]) ).

fof(f157,plain,
    ! [X3,X0,X1] : divide(X0,X3) = divide(divide(X0,X1),divide(X3,X1)),
    inference(backward_demodulation,[],[f124,f148]) ).

fof(f169,plain,
    ! [X2,X0,X1] : divide(divide(X2,X0),X1) = divide(X2,divide(identity,divide(divide(identity,X0),X1))),
    inference(superposition,[],[f99,f57]) ).

fof(f175,plain,
    ! [X0,X1] : divide(X1,X0) = divide(identity,divide(X0,X1)),
    inference(superposition,[],[f55,f99]) ).

fof(f191,plain,
    ! [X2,X0,X1] : divide(divide(X2,X0),X1) = divide(X2,divide(X1,divide(identity,X0))),
    inference(forward_demodulation,[],[f169,f175]) ).

fof(f241,plain,
    ! [X2,X0,X1] : divide(divide(X0,X1),divide(identity,X2)) = divide(X2,divide(X1,X0)),
    inference(superposition,[],[f30,f175]) ).

fof(f246,plain,
    ! [X2,X0,X1] : divide(X0,X2) = divide(X1,divide(X2,divide(X0,X1))),
    inference(backward_demodulation,[],[f84,f241]) ).

fof(f308,plain,
    ! [X2,X0,X1] : divide(divide(X1,X2),divide(identity,X0)) = divide(X1,divide(X2,X0)),
    inference(superposition,[],[f157,f83]) ).

fof(f332,plain,
    ! [X2,X3,X0,X1] : divide(divide(divide(X2,X0),X1),X3) = divide(X2,divide(X3,divide(divide(identity,X0),X1))),
    inference(superposition,[],[f246,f57]) ).

fof(f425,plain,
    ( divide(a4,divide(identity,b4)) != divide(a4,divide(identity,b4))
    | spl0_1 ),
    inference(superposition,[],[f12,f92]) ).

fof(f448,plain,
    ( $false
    | spl0_1 ),
    inference(trivial_inequality_removal,[],[f425]) ).

fof(f449,plain,
    spl0_1,
    inference(avatar_contradiction_clause,[],[f448]) ).

fof(f528,plain,
    ( divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != divide(a3,divide(divide(identity,c3),b3))
    | spl0_2 ),
    inference(forward_demodulation,[],[f16,f191]) ).

fof(f529,plain,
    ( divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != divide(a3,divide(divide(identity,b3),c3))
    | spl0_2 ),
    inference(forward_demodulation,[],[f528,f75]) ).

fof(f530,plain,
    ( $false
    | spl0_2 ),
    inference(forward_subsumption_resolution,[],[f529,f308]) ).

fof(f531,plain,
    spl0_2,
    inference(avatar_contradiction_clause,[],[f530]) ).

fof(f533,plain,
    ( a2 != divide(a2,divide(identity,divide(divide(identity,b2),divide(identity,b2))))
    | spl0_3 ),
    inference(forward_demodulation,[],[f20,f92]) ).

fof(f535,plain,
    ( a2 != divide(divide(divide(a2,b2),divide(identity,b2)),identity)
    | spl0_3 ),
    inference(forward_demodulation,[],[f533,f332]) ).

fof(f536,plain,
    ( a2 != divide(divide(a2,b2),divide(identity,b2))
    | spl0_3 ),
    inference(forward_demodulation,[],[f535,f52]) ).

fof(f537,plain,
    ( a2 != divide(b2,divide(identity,divide(a2,b2)))
    | spl0_3 ),
    inference(forward_demodulation,[],[f536,f92]) ).

fof(f538,plain,
    ( a2 != divide(a2,identity)
    | spl0_3 ),
    inference(forward_demodulation,[],[f537,f246]) ).

fof(f539,plain,
    ( $false
    | spl0_3 ),
    inference(forward_subsumption_resolution,[],[f538,f52]) ).

fof(f540,plain,
    spl0_3,
    inference(avatar_contradiction_clause,[],[f539]) ).

fof(f542,plain,
    ( identity != divide(divide(identity,a1),divide(identity,a1))
    | spl0_4 ),
    inference(forward_demodulation,[],[f24,f5]) ).

fof(f544,plain,
    ( $false
    | spl0_4 ),
    inference(forward_subsumption_resolution,[],[f542,f5]) ).

fof(f545,plain,
    spl0_4,
    inference(avatar_contradiction_clause,[],[f544]) ).

cnf(s1,plain,
    ( ~ spl0_1
    | ~ spl0_2
    | ~ spl0_3
    | ~ spl0_4 ),
    inference(sat_conversion,[],[f25]) ).

cnf(s3,plain,
    spl0_1,
    inference(sat_conversion,[],[f449]) ).

cnf(s4,plain,
    spl0_2,
    inference(sat_conversion,[],[f531]) ).

cnf(s5,plain,
    spl0_3,
    inference(sat_conversion,[],[f540]) ).

cnf(s6,plain,
    spl0_4,
    inference(sat_conversion,[],[f545]) ).

cnf(s7,plain,
    $false,
    inference(rat,[],[s1,s6,s5,s4,s3]) ).

fof(f549,plain,
    $false,
    inference(avatar_sat_refutation,[],[s7]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP095-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.38  % Computer : n026.cluster.edu
% 0.12/0.38  % Model    : x86_64 x86_64
% 0.12/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38  % Memory   : 8046.5625MB
% 0.12/0.38  % OS       : Linux 6.8.0-71-generic
% 0.13/0.38  % CPULimit : 300
% 0.13/0.38  % WCLimit  : 300
% 0.13/0.38  % DateTime : Sun Sep 27 09:21:56 UTC 2026
% 0.13/0.38  % CPUTime  : 
% 0.13/0.38  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.43  Running first-order model finding
% 0.13/0.44  Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.89/0.59  % (2566454)Will run a generic schedule for satisfiability detection.
% 0.89/0.59  % (2566459)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1006843045_2999 on theBenchmark for (2999ds/0Mi)
% 0.89/0.59  % TRYING [1]
% 0.89/0.59  % TRYING [2]
% 0.89/0.59  % TRYING [3]
% 0.89/0.59  % TRYING [4]
% 0.89/0.59  % (2566460)% WARNING: option uhcvi not known.
% 0.89/0.59  % (2566460)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=240989930:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.89/0.59  % (2566462)dis+10_1_sil=32000:sp=arity:random_seed=1378585126:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.89/0.59  % (2566463)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3608500419:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.89/0.59  % (2566461)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1632548795:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.89/0.59  % (2566464)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=44843231:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.89/0.59  % (2566465)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4012922572:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.89/0.59  % TRYING [5]
% 0.89/0.59  % TRYING [6]
% 0.89/0.59  % (2566462)Instruction limit reached! 
% 0.89/0.59  % (2566462)------------------------------
% 0.89/0.59  % (2566462)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.89/0.59  % (2566462)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.89/0.59  % (2566462)CaDiCaL version: 2.1.3
% 0.89/0.59  % (2566462)Termination reason: Instruction limit
% 0.89/0.59  % (2566462)Termination phase: Saturation
% 0.89/0.59  % (2566462)Time elapsed: 0.056 s
% 0.89/0.59  % (2566462)Peak memory usage: 12 MB
% 0.89/0.59  % (2566462)Instructions burned: 103 (million)
% 0.89/0.59  % (2566463)Instruction limit reached! 
% 0.89/0.59  % (2566463)------------------------------
% 0.89/0.59  % (2566463)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.89/0.59  % (2566463)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.89/0.59  % (2566463)CaDiCaL version: 2.1.3
% 0.89/0.59  % (2566463)Termination reason: Instruction limit
% 0.89/0.59  % (2566463)Termination phase: Saturation
% 0.89/0.59  % (2566463)Time elapsed: 0.065 s
% 0.89/0.59  % (2566463)Peak memory usage: 12 MB
% 0.89/0.59  % (2566463)Instructions burned: 116 (million)
% 0.89/0.59  % (2566473)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2004579213:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.89/0.59  % (2566464)Instruction limit reached! 
% 0.89/0.59  % (2566464)------------------------------
% 0.89/0.59  % (2566464)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.89/0.59  % (2566464)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.89/0.59  % (2566464)CaDiCaL version: 2.1.3
% 0.89/0.59  % (2566464)Termination reason: Instruction limit
% 0.89/0.59  % (2566464)Termination phase: Saturation
% 0.89/0.59  % (2566464)Time elapsed: 0.075 s
% 0.89/0.59  % (2566464)Peak memory usage: 12 MB
% 0.89/0.59  % (2566464)Instructions burned: 131 (million)
% 0.89/0.59  % TRYING [1]
% 0.89/0.59  % TRYING [2]
% 0.89/0.59  % TRYING [3]
% 0.89/0.59  % (2566474)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1229385060:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 0.89/0.59  % TRYING [4]
% 0.89/0.59  % (2566479)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=1986063371:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 0.89/0.59  % (2566465)Instruction limit reached! 
% 0.89/0.59  % (2566465)------------------------------
% 0.89/0.59  % (2566465)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.89/0.59  % (2566465)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.89/0.59  % (2566465)CaDiCaL version: 2.1.3
% 0.89/0.59  % (2566465)Termination reason: Instruction limit
% 0.89/0.59  % (2566465)Termination phase: Saturation
% 0.89/0.59  % (2566465)Time elapsed: 0.098 s
% 0.89/0.59  % (2566465)Peak memory usage: 13 MB
% 0.89/0.59  % (2566465)Instructions burned: 160 (million)
% 0.89/0.59  % (2566474) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2566454-2566474"...
% 0.89/0.59  % (2566474)...printing done.
% 0.89/0.59  % (2566474)Refutation found. Thanks to Tanya!
% 0.89/0.59  % SZS status Unsatisfiable for theBenchmark
% 0.89/0.59  % SZS output start Proof for theBenchmark
% See solution above
% 0.89/0.59  % (2566474)------------------------------
% 0.89/0.59  % (2566474)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.89/0.59  % (2566474)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.89/0.59  % (2566474)CaDiCaL version: 2.1.3
% 0.89/0.59  % (2566474)Termination reason: Refutation
% 0.89/0.59  % (2566474)Time elapsed: 0.018 s
% 0.89/0.59  % (2566474)Peak memory usage: 12 MB
% 0.89/0.59  % (2566474)Instructions burned: 26 (million)
% 0.89/0.59  % (2566454)Success in time 0.141 s
% 0.89/0.59  % Vampire exiting
%------------------------------------------------------------------------------