↑ Up

Vampire-SAT---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : LCL486+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/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 11:58:47 AM UTC 2026

% Result   : Theorem 6.15s 1.32s
% Output   : Refutation 6.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   52 (  26 unt;   0 def)
%            Number of atoms       :   91 (   4 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   75 (  36   ~;  26   |;   2   &)
%                                         (   4 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    8 (   6 usr;   6 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   86 (  83   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ( modus_ponens
  <=> ! [X0,X1] :
        ( ( is_a_theorem(X0)
          & is_a_theorem(implies(X0,X1)) )
       => is_a_theorem(X1) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',modus_ponens) ).

fof(f6,axiom,
    ( implies_3
  <=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',implies_3) ).

fof(f25,axiom,
    ( r4
  <=> ! [X0,X1,X2] : is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',r4) ).

fof(f26,axiom,
    ( r5
  <=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2)))) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',r5) ).

fof(f30,axiom,
    ( op_implies_or
   => ! [X0,X1] : implies(X0,X1) = or(not(X0),X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_implies_or) ).

fof(f32,axiom,
    op_implies_or,
    file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax',principia_op_implies_or) ).

fof(f35,axiom,
    modus_ponens,
    file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax',principia_modus_ponens) ).

fof(f39,axiom,
    r4,
    file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax',principia_r4) ).

fof(f40,axiom,
    r5,
    file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax',principia_r5) ).

fof(f45,conjecture,
    implies_3,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_implies_3) ).

fof(f46,negated_conjecture,
    ~ implies_3,
    inference(negated_conjecture,[status(cth)],[f45]) ).

fof(f47,plain,
    ~ implies_3,
    inference(flattening,[],[f46]) ).

fof(f48,plain,
    ( r5
   => ! [X0,X1,X2] : is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2)))) ),
    inference(unused_predicate_definition_removal,[],[f26]) ).

fof(f49,plain,
    ( r4
   => ! [X0,X1,X2] : is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))) ),
    inference(unused_predicate_definition_removal,[],[f25]) ).

fof(f53,plain,
    ( ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))))
   => implies_3 ),
    inference(unused_predicate_definition_removal,[],[f6]) ).

fof(f55,plain,
    ( modus_ponens
   => ! [X0,X1] :
        ( ( is_a_theorem(X0)
          & is_a_theorem(implies(X0,X1)) )
       => is_a_theorem(X1) ) ),
    inference(unused_predicate_definition_removal,[],[f1]) ).

fof(f56,plain,
    ( ! [X0,X1] :
        ( is_a_theorem(X1)
        | ~ is_a_theorem(X0)
        | ~ is_a_theorem(implies(X0,X1)) )
    | ~ modus_ponens ),
    inference(ennf_transformation,[],[f55]) ).

fof(f57,plain,
    ( ! [X0,X1] :
        ( is_a_theorem(X1)
        | ~ is_a_theorem(X0)
        | ~ is_a_theorem(implies(X0,X1)) )
    | ~ modus_ponens ),
    inference(flattening,[],[f56]) ).

fof(f59,plain,
    ( implies_3
    | ? [X0,X1,X2] : ~ is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))) ),
    inference(ennf_transformation,[],[f53]) ).

fof(f63,plain,
    ( ! [X0,X1,X2] : is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2))))
    | ~ r4 ),
    inference(ennf_transformation,[],[f49]) ).

fof(f64,plain,
    ( ! [X0,X1,X2] : is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2))))
    | ~ r5 ),
    inference(ennf_transformation,[],[f48]) ).

fof(f68,plain,
    ( ! [X0,X1] : implies(X0,X1) = or(not(X0),X1)
    | ~ op_implies_or ),
    inference(ennf_transformation,[],[f30]) ).

fof(f70,plain,
    ! [X0,X1] :
      ( ~ modus_ponens
      | ~ is_a_theorem(implies(X0,X1))
      | ~ is_a_theorem(X0)
      | is_a_theorem(X1) ),
    inference(cnf_transformation,[],[f57]) ).

fof(f72,plain,
    ( ~ is_a_theorem(implies(implies(sK0,sK1),implies(implies(sK1,sK2),implies(sK0,sK2))))
    | implies_3 ),
    inference(cnf_transformation,[],[f59]) ).

fof(f76,plain,
    ! [X2,X0,X1] :
      ( ~ r4
      | is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))) ),
    inference(cnf_transformation,[],[f63]) ).

fof(f77,plain,
    ! [X2,X0,X1] :
      ( ~ r5
      | is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2)))) ),
    inference(cnf_transformation,[],[f64]) ).

fof(f81,plain,
    ! [X0,X1] :
      ( ~ op_implies_or
      | implies(X0,X1) = or(not(X0),X1) ),
    inference(cnf_transformation,[],[f68]) ).

fof(f83,plain,
    op_implies_or,
    inference(cnf_transformation,[],[f32]) ).

fof(f86,plain,
    modus_ponens,
    inference(cnf_transformation,[],[f35]) ).

fof(f90,plain,
    r4,
    inference(cnf_transformation,[],[f39]) ).

fof(f91,plain,
    r5,
    inference(cnf_transformation,[],[f40]) ).

fof(f96,plain,
    ~ implies_3,
    inference(cnf_transformation,[],[f47]) ).

fof(f97,plain,
    ! [X0,X1] :
      ( modus_ponens
      | is_a_theorem(implies(X0,X1))
      | is_a_theorem(X0)
      | ~ is_a_theorem(X1) ),
    inference(consistent_polarity_flipping,[],[f70]) ).

fof(f99,plain,
    ( is_a_theorem(implies(implies(sK0,sK1),implies(implies(sK1,sK2),implies(sK0,sK2))))
    | ~ implies_3 ),
    inference(consistent_polarity_flipping,[],[f72]) ).

fof(f103,plain,
    ! [X2,X0,X1] :
      ( ~ r4
      | ~ is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))) ),
    inference(consistent_polarity_flipping,[],[f76]) ).

fof(f104,plain,
    ! [X2,X0,X1] :
      ( ~ r5
      | ~ is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2)))) ),
    inference(consistent_polarity_flipping,[],[f77]) ).

fof(f110,plain,
    ~ modus_ponens,
    inference(consistent_polarity_flipping,[],[f86]) ).

fof(f116,plain,
    implies_3,
    inference(consistent_polarity_flipping,[],[f96]) ).

fof(f118,plain,
    ! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
    inference(forward_subsumption_resolution,[],[f81,f83]) ).

fof(f122,plain,
    ! [X2,X0,X1] : ~ is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2)))),
    inference(forward_subsumption_resolution,[],[f104,f91]) ).

fof(f123,plain,
    ! [X2,X0,X1] : ~ is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
    inference(forward_subsumption_resolution,[],[f103,f90]) ).

fof(f127,plain,
    is_a_theorem(implies(implies(sK0,sK1),implies(implies(sK1,sK2),implies(sK0,sK2)))),
    inference(forward_subsumption_resolution,[],[f99,f116]) ).

fof(f129,plain,
    ! [X0,X1] :
      ( ~ is_a_theorem(X1)
      | is_a_theorem(X0)
      | is_a_theorem(implies(X0,X1)) ),
    inference(forward_subsumption_resolution,[],[f97,f110]) ).

fof(f136,plain,
    ! [X0] :
      ( is_a_theorem(implies(X0,implies(implies(sK0,sK1),implies(implies(sK1,sK2),implies(sK0,sK2)))))
      | is_a_theorem(X0) ),
    inference(resolution,[],[f129,f127]) ).

fof(f578,plain,
    ! [X2,X0,X1] : ~ is_a_theorem(implies(implies(X2,X1),implies(or(not(X0),X2),implies(X0,X1)))),
    inference(superposition,[],[f122,f118]) ).

fof(f579,plain,
    ! [X2,X0,X1] : ~ is_a_theorem(implies(implies(X2,X1),implies(implies(X0,X2),implies(X0,X1)))),
    inference(forward_demodulation,[],[f578,f118]) ).

fof(f588,plain,
    ! [X2,X0,X1] : ~ is_a_theorem(implies(or(X1,or(not(X0),X2)),implies(X0,or(X1,X2)))),
    inference(superposition,[],[f123,f118]) ).

fof(f589,plain,
    ! [X2,X0,X1] : ~ is_a_theorem(implies(or(X1,implies(X0,X2)),implies(X0,or(X1,X2)))),
    inference(forward_demodulation,[],[f588,f118]) ).

fof(f2873,plain,
    ! [X2,X0,X1] : ~ is_a_theorem(implies(or(not(X0),implies(X2,X1)),implies(X2,implies(X0,X1)))),
    inference(superposition,[],[f589,f118]) ).

fof(f2884,plain,
    ! [X2,X0,X1] : ~ is_a_theorem(implies(implies(X0,implies(X2,X1)),implies(X2,implies(X0,X1)))),
    inference(forward_demodulation,[],[f2873,f118]) ).

fof(f10002,plain,
    is_a_theorem(implies(implies(sK1,sK2),implies(implies(sK0,sK1),implies(sK0,sK2)))),
    inference(resolution,[],[f2884,f136]) ).

fof(f10042,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f10002,f579]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL486+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.36  % Computer : n009.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Sun Sep 27 15:50:45 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.36  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.39  Running first-order model finding
% 0.10/0.39  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
% 6.15/1.32  % (2207232)Will run a generic schedule for satisfiability detection.
% 6.15/1.32  % (2207238)% WARNING: option uhcvi not known.
% 6.15/1.32  % (2207237)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1389654782_2999 on theBenchmark for (2999ds/0Mi)
% 6.15/1.32  % (2207238)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3394519428:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 6.15/1.32  % (2207239)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=192697549:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 6.15/1.32  % (2207240)dis+10_1_sil=32000:sp=arity:random_seed=1059253312:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 6.15/1.32  % (2207241)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3052292683:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 6.15/1.32  % (2207242)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1138729495:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 6.15/1.32  % (2207243)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=726274794:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 6.15/1.32  % TRYING [1]
% 6.15/1.32  % TRYING [2]
% 6.15/1.32  % TRYING [3]
% 6.15/1.32  % TRYING [4]
% 6.15/1.32  % (2207240)Instruction limit reached! 
% 6.15/1.32  % (2207240)------------------------------
% 6.15/1.32  % (2207240)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.15/1.32  % (2207240)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.15/1.32  % (2207240)CaDiCaL version: 2.1.3
% 6.15/1.32  % (2207240)Termination reason: Instruction limit
% 6.15/1.32  % (2207240)Termination phase: Saturation
% 6.15/1.32  % (2207240)Time elapsed: 0.065 s
% 6.15/1.32  % (2207240)Peak memory usage: 13 MB
% 6.15/1.32  % (2207240)Instructions burned: 104 (million)
% 6.15/1.32  % (2207241)Instruction limit reached! 
% 6.15/1.32  % (2207241)------------------------------
% 6.15/1.32  % (2207241)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.15/1.32  % (2207241)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.15/1.32  % (2207241)CaDiCaL version: 2.1.3
% 6.15/1.32  % (2207241)Termination reason: Instruction limit
% 6.15/1.32  % (2207241)Termination phase: Saturation
% 6.15/1.32  % (2207241)Time elapsed: 0.075 s
% 6.15/1.32  % (2207241)Peak memory usage: 13 MB
% 6.15/1.32  % (2207241)Instructions burned: 116 (million)
% 6.15/1.32  % (2207242)Instruction limit reached! 
% 6.15/1.32  % (2207242)------------------------------
% 6.15/1.32  % (2207242)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.15/1.32  % (2207242)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.15/1.32  % (2207242)CaDiCaL version: 2.1.3
% 6.15/1.32  % (2207242)Termination reason: Instruction limit
% 6.15/1.32  % (2207242)Termination phase: Saturation
% 6.15/1.32  % (2207242)Time elapsed: 0.084 s
% 6.15/1.32  % (2207242)Peak memory usage: 14 MB
% 6.15/1.32  % (2207242)Instructions burned: 132 (million)
% 6.15/1.32  % (2207251)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=11346212:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 6.15/1.32  % TRYING [1]
% 6.15/1.32  % TRYING [2]
% 6.15/1.32  % TRYING [3]
% 6.15/1.32  % (2207252)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=170881053:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 6.15/1.32  % (2207253)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=2470878969:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 6.15/1.32  % TRYING [4]
% 6.15/1.32  % (2207243)Instruction limit reached! 
% 6.15/1.32  % (2207243)------------------------------
% 6.15/1.32  % (2207243)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.15/1.32  % (2207243)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.15/1.32  % (2207243)CaDiCaL version: 2.1.3
% 6.15/1.32  % (2207243)Termination reason: Instruction limit
% 6.15/1.32  % (2207243)Termination phase: Saturation
% 6.15/1.32  % (2207243)Time elapsed: 0.112 s
% 6.15/1.32  % (2207243)Peak memory usage: 14 MB
% 6.15/1.32  % (2207243)Instructions burned: 160 (million)
% 6.15/1.32  % (2207257)ott-21_1_sil=16000:fs=off:random_seed=493785985:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 6.15/1.32  % (2207252)Instruction limit reached! 
% 6.15/1.32  % (2207252)------------------------------
% 6.15/1.32  % (2207252)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.15/1.32  % (2207252)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.15/1.32  % (2207252)CaDiCaL version: 2.1.3
% 6.15/1.32  % (2207252)Termination reason: Instruction limit
% 6.15/1.32  % (2207252)Termination phase: Saturation
% 6.15/1.32  % (2207252)Time elapsed: 0.088 s
% 6.15/1.32  % (2207252)Peak memory usage: 14 MB
% 6.15/1.32  % (2207252)Instructions burned: 132 (million)
% 6.15/1.32  % (2207259)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=833916480:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 6.15/1.32  % TRYING [5]
% 6.15/1.32  % (2207257)Instruction limit reached! 
% 6.15/1.32  % (2207257)------------------------------
% 6.15/1.32  % (2207257)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.15/1.32  % (2207257)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.15/1.32  % (2207257)CaDiCaL version: 2.1.3
% 6.15/1.32  % (2207257)Termination reason: Instruction limit
% 6.15/1.32  % (2207257)Termination phase: Saturation
% 6.15/1.32  % (2207257)Time elapsed: 0.099 s
% 6.15/1.32  % (2207257)Peak memory usage: 13 MB
% 6.15/1.32  % (2207257)Instructions burned: 181 (million)
% 6.15/1.32  % (2207261)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1421095259:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 6.15/1.32  % TRYING [1]
% 6.15/1.32  % TRYING [2]
% 6.15/1.32  % TRYING [3]
% 6.15/1.32  % TRYING [4]
% 6.15/1.32  % TRYING [5]
% 6.15/1.32  % (2207251)Instruction limit reached! 
% 6.15/1.32  % (2207251)------------------------------
% 6.15/1.32  % (2207251)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.15/1.32  % (2207251)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.15/1.32  % (2207251)CaDiCaL version: 2.1.3
% 6.15/1.32  % (2207251)Termination reason: Instruction limit
% 6.15/1.32  % (2207251)Termination phase: Finite model building SAT solving
% 6.15/1.32  % (2207251)Time elapsed: 0.417 s
% 6.15/1.32  % (2207251)Peak memory usage: 18 MB
% 6.15/1.32  % (2207251)Instructions burned: 714 (million)
% 6.15/1.32  % (2207259)Instruction limit reached! 
% 6.15/1.32  % (2207259)------------------------------
% 6.15/1.32  % (2207259)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.15/1.32  % (2207259)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.15/1.32  % (2207259)CaDiCaL version: 2.1.3
% 6.15/1.32  % (2207259)Termination reason: Instruction limit
% 6.15/1.32  % (2207259)Termination phase: Saturation
% 6.15/1.32  % (2207259)Time elapsed: 0.308 s
% 6.15/1.32  % (2207259)Peak memory usage: 14 MB
% 6.15/1.32  % (2207259)Instructions burned: 478 (million)
% 6.15/1.32  % (2207263)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3258499067:i=1179_2994 on theBenchmark for (2994ds/1179Mi)
% 6.15/1.32  % (2207264)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=1975151265:i=889:ins=1_2994 on theBenchmark for (2994ds/889Mi)
% 6.15/1.32  % (2207253)Instruction limit reached! 
% 6.15/1.32  % (2207253)------------------------------
% 6.15/1.32  % (2207253)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.15/1.32  % (2207253)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.15/1.32  % (2207253)CaDiCaL version: 2.1.3
% 6.15/1.32  % (2207253)Termination reason: Instruction limit
% 6.15/1.32  % (2207253)Termination phase: Saturation
% 6.15/1.32  % (2207253)Time elapsed: 0.450 s
% 6.15/1.32  % (2207253)Peak memory usage: 20 MB
% 6.15/1.32  % (2207253)Instructions burned: 684 (million)
% 6.15/1.32  % (2207267)ott+1_16_sil=32000:plsq=on:plsqc=2:sas=cadical:avsql=on:sp=reverse_frequency:plsqr=128,1:bsr=unit_only:rp=on:newcnf=on:random_seed=1307393748:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2994 on theBenchmark for (2994ds/692Mi)
% 6.15/1.32  % TRYING [14]
% 6.15/1.32  % TRYING [5]
% 6.15/1.32  % (2207261)Instruction limit reached! 
% 6.15/1.32  % (2207261)------------------------------
% 6.15/1.32  % (2207261)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.15/1.32  % (2207261)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.15/1.32  % (2207261)CaDiCaL version: 2.1.3
% 6.15/1.32  % (2207261)Termination reason: Instruction limit
% 6.15/1.32  % (2207261)Termination phase: Finite model building constraint generation
% 6.15/1.32  % (2207261)Time elapsed: 0.403 s
% 6.15/1.32  % (2207261)Peak memory usage: 18 MB
% 6.15/1.32  % (2207261)Instructions burned: 868 (million)
% 6.15/1.32  % (2207269)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=3060981302:i=879:kws=inv_precedence:fsr=off_2993 on theBenchmark for (2993ds/879Mi)
% 6.15/1.32  % (2207264)Instruction limit reached! 
% 6.15/1.32  % (2207264)------------------------------
% 6.15/1.32  % (2207264)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.15/1.32  % (2207264)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.15/1.32  % (2207264)CaDiCaL version: 2.1.3
% 6.15/1.32  % (2207264)Termination reason: Instruction limit
% 6.15/1.32  % (2207264)Termination phase: Finite model building constraint generation
% 6.15/1.32  % (2207264)Time elapsed: 0.310 s
% 6.15/1.32  % (2207264)Peak memory usage: 67 MB
% 6.15/1.32  % (2207264)Instructions burned: 889 (million)
% 6.15/1.32  % (2207271)fmb+10_1_sil=64000:random_seed=606044851:i=22061:nm=2:gsp=on_2991 on theBenchmark for (2991ds/22061Mi)
% 6.15/1.32  % TRYING [1]
% 6.15/1.32  % TRYING [2]
% 6.15/1.32  % TRYING [3]
% 6.15/1.32  % (2207267) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2207232-2207267"...
% 6.15/1.32  % (2207267)...printing done.
% 6.15/1.32  % (2207267)Refutation found. Thanks to Tanya!
% 6.15/1.32  % SZS status Theorem for theBenchmark
% 6.15/1.32  % SZS output start Proof for theBenchmark
% See solution above
% 6.15/1.32  % (2207267)------------------------------
% 6.15/1.32  % (2207267)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.15/1.32  % (2207267)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.15/1.32  % (2207267)CaDiCaL version: 2.1.3
% 6.15/1.32  % (2207267)Termination reason: Refutation
% 6.15/1.32  % (2207267)Time elapsed: 0.305 s
% 6.15/1.32  % (2207267)Peak memory usage: 18 MB
% 6.15/1.32  % (2207267)Instructions burned: 446 (million)
% 6.15/1.32  % (2207232)Success in time 0.923 s
% 6.15/1.32  % Vampire exiting
%------------------------------------------------------------------------------