↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : LCL489+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n010.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:52:35 AM UTC 2026

% Result   : Theorem 6.64s 1.96s
% Output   : Refutation 8.44s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   73 (  32 unt;   0 def)
%            Number of atoms       :  128 (  10 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   98 (  43   ~;  39   |;   2   &)
%                                         (   5 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :   10 (   8 usr;   8 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   2 con; 0-2 aty)
%            Number of variables   :  129 ( 127   !;   2   ?)

% 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/theBenchmark.p',modus_ponens) ).

fof(f9,axiom,
    ( and_3
  <=> ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1)))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',and_3) ).

fof(f24,axiom,
    ( r3
  <=> ! [X0,X1] : is_a_theorem(implies(or(X0,X1),or(X1,X0))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',r3) ).

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/theBenchmark.p',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/theBenchmark.p',r5) ).

fof(f28,axiom,
    ( op_and
   => ! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_and) ).

fof(f30,axiom,
    ( op_implies_or
   => ! [X0,X1] : implies(X0,X1) = or(not(X0),X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_implies_or) ).

fof(f32,axiom,
    op_implies_or,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_op_implies_or) ).

fof(f33,axiom,
    op_and,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_op_and) ).

fof(f35,axiom,
    modus_ponens,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_modus_ponens) ).

fof(f38,axiom,
    r3,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_r3) ).

fof(f39,axiom,
    r4,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_r4) ).

fof(f40,axiom,
    r5,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_r5) ).

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

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

fof(f47,plain,
    ~ and_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(f50,plain,
    ( r3
   => ! [X0,X1] : is_a_theorem(implies(or(X0,X1),or(X1,X0))) ),
    inference(unused_predicate_definition_removal,[],[f24]) ).

fof(f53,plain,
    ( ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1))))
   => and_3 ),
    inference(unused_predicate_definition_removal,[],[f9]) ).

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,
    ( and_3
    | ? [X0,X1] : ~ is_a_theorem(implies(X0,implies(X1,and(X0,X1)))) ),
    inference(ennf_transformation,[],[f53]) ).

fof(f62,plain,
    ( ! [X0,X1] : is_a_theorem(implies(or(X0,X1),or(X1,X0)))
    | ~ r3 ),
    inference(ennf_transformation,[],[f50]) ).

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(f66,plain,
    ( ! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1)))
    | ~ op_and ),
    inference(ennf_transformation,[],[f28]) ).

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

fof(f70,plain,
    ( and_3
    | ~ is_a_theorem(implies(sK0,implies(sK1,and(sK0,sK1)))) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f59]) ).

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

fof(f73,plain,
    ( and_3
    | ~ is_a_theorem(implies(sK0,implies(sK1,and(sK0,sK1)))) ),
    inference(cnf_transformation,[],[f70]) ).

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

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

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

fof(f80,plain,
    ! [X0,X1] :
      ( and(X0,X1) = not(or(not(X0),not(X1)))
      | ~ op_and ),
    inference(cnf_transformation,[],[f66]) ).

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

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

fof(f85,plain,
    op_and,
    inference(cnf_transformation,[],[f33]) ).

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

fof(f90,plain,
    r3,
    inference(cnf_transformation,[],[f38]) ).

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

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

fof(f97,plain,
    ~ and_3,
    inference(cnf_transformation,[],[f47]) ).

fof(f99,plain,
    ! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
    inference(forward_subsumption_resolution,[],[f82,f84]) ).

fof(f101,plain,
    ! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
    inference(forward_subsumption_resolution,[],[f80,f85]) ).

fof(f103,plain,
    ! [X2,X0,X1] : is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2)))),
    inference(forward_subsumption_resolution,[],[f78,f92]) ).

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

fof(f105,plain,
    ! [X0,X1] : is_a_theorem(implies(or(X0,X1),or(X1,X0))),
    inference(forward_subsumption_resolution,[],[f76,f90]) ).

fof(f108,plain,
    ~ is_a_theorem(implies(sK0,implies(sK1,and(sK0,sK1)))),
    inference(forward_subsumption_resolution,[],[f73,f97]) ).

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

fof(f111,plain,
    ! [X0,X1] : and(X0,X1) = not(implies(X0,not(X1))),
    inference(forward_demodulation,[],[f101,f99]) ).

fof(f135,plain,
    ! [X2,X0,X1] :
      ( is_a_theorem(implies(or(X2,X0),or(X2,X1)))
      | ~ is_a_theorem(implies(X0,X1)) ),
    inference(resolution,[],[f110,f103]) ).

fof(f136,plain,
    ! [X2,X0,X1] :
      ( ~ is_a_theorem(or(X0,or(X1,X2)))
      | is_a_theorem(or(X1,or(X0,X2))) ),
    inference(resolution,[],[f110,f104]) ).

fof(f138,plain,
    ! [X2,X0,X1] :
      ( ~ is_a_theorem(or(X2,implies(X0,X1)))
      | is_a_theorem(or(not(X0),or(X2,X1))) ),
    inference(superposition,[],[f136,f99]) ).

fof(f139,plain,
    ! [X2,X0,X1] :
      ( ~ is_a_theorem(implies(X0,or(X1,X2)))
      | is_a_theorem(or(X1,or(not(X0),X2))) ),
    inference(superposition,[],[f136,f99]) ).

fof(f140,plain,
    ! [X2,X0,X1] :
      ( ~ is_a_theorem(implies(X0,or(X1,X2)))
      | is_a_theorem(or(X1,implies(X0,X2))) ),
    inference(forward_demodulation,[],[f139,f99]) ).

fof(f141,plain,
    ! [X2,X0,X1] :
      ( ~ is_a_theorem(or(X2,implies(X0,X1)))
      | is_a_theorem(implies(X0,or(X2,X1))) ),
    inference(forward_demodulation,[],[f138,f99]) ).

fof(f144,plain,
    ! [X2,X0,X1] :
      ( ~ is_a_theorem(implies(X2,implies(X0,X1)))
      | is_a_theorem(or(not(X0),implies(X2,X1))) ),
    inference(superposition,[],[f140,f99]) ).

fof(f147,plain,
    ! [X2,X0,X1] :
      ( ~ is_a_theorem(implies(X2,implies(X0,X1)))
      | is_a_theorem(implies(X0,implies(X2,X1))) ),
    inference(forward_demodulation,[],[f144,f99]) ).

fof(f166,plain,
    ! [X2,X0,X1] :
      ( ~ is_a_theorem(or(X2,X0))
      | ~ is_a_theorem(implies(X0,X1))
      | is_a_theorem(or(X2,X1)) ),
    inference(resolution,[],[f135,f110]) ).

fof(f173,plain,
    ! [X0,X1] : is_a_theorem(implies(implies(X0,X1),or(X1,not(X0)))),
    inference(superposition,[],[f105,f99]) ).

fof(f185,plain,
    ! [X2,X0,X1] :
      ( ~ is_a_theorem(implies(X0,X1))
      | ~ is_a_theorem(implies(X1,X2))
      | is_a_theorem(or(not(X0),X2)) ),
    inference(superposition,[],[f166,f99]) ).

fof(f186,plain,
    ! [X2,X0,X1] :
      ( ~ is_a_theorem(implies(X1,X2))
      | ~ is_a_theorem(implies(X0,X1))
      | is_a_theorem(implies(X0,X2)) ),
    inference(forward_demodulation,[],[f185,f99]) ).

fof(f193,plain,
    ! [X2,X0,X1] :
      ( ~ is_a_theorem(implies(X0,or(X1,X2)))
      | is_a_theorem(implies(X0,or(X2,X1))) ),
    inference(resolution,[],[f186,f105]) ).

fof(f244,plain,
    ! [X2,X0,X1] : implies(implies(X0,not(X1)),X2) = or(and(X0,X1),X2),
    inference(superposition,[],[f99,f111]) ).

fof(f366,plain,
    ! [X0,X1] : is_a_theorem(implies(implies(X1,not(X0)),implies(X0,not(X1)))),
    inference(superposition,[],[f173,f99]) ).

fof(f368,plain,
    ! [X0,X1] : is_a_theorem(or(and(X1,X0),implies(X0,not(X1)))),
    inference(forward_demodulation,[],[f366,f244]) ).

fof(f373,plain,
    ! [X0,X1] : is_a_theorem(implies(X0,or(and(X1,X0),not(X1)))),
    inference(resolution,[],[f368,f141]) ).

fof(f402,plain,
    ! [X0,X1] : is_a_theorem(implies(X0,or(not(X1),and(X1,X0)))),
    inference(resolution,[],[f373,f193]) ).

fof(f412,plain,
    ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X1,X0)))),
    inference(forward_demodulation,[],[f402,f99]) ).

fof(f413,plain,
    ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1)))),
    inference(resolution,[],[f412,f147]) ).

fof(f419,plain,
    $false,
    inference(resolution,[],[f413,f108]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL489+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37  % Computer : n010.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Sun Sep 27 15:51:01 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.41  Running first-order theorem proving
% 0.10/0.41  Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.64/1.96  % (1125424)Detected formulas, will run a generic FOF schedule.
% 6.64/1.96  % (1125431)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=3298388185:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 6.64/1.96  % (1125432)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2502793627:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 6.64/1.96  % (1125433)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=273610813:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 6.64/1.96  % (1125430)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=73692453:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 6.64/1.96  % (1125435)dis-21_1_sil=8000:lcm=predicate:random_seed=2386636058:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 6.64/1.96  % (1125429)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=1595756389:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 6.64/1.96  % (1125434)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2743100970:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 6.64/1.96  % (1125433)Refutation not found, incomplete strategy
% 6.64/1.96  % (1125433)------------------------------
% 6.64/1.96  % (1125433)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.64/1.96  % (1125433)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.64/1.96  % (1125432)Refutation not found, incomplete strategy
% 6.64/1.96  % (1125432)------------------------------
% 6.64/1.96  % (1125432)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.64/1.96  % (1125433)CaDiCaL version: 2.1.3
% 6.64/1.96  % (1125433)Termination reason: Refutation not found, incomplete strategy
% 6.64/1.96  % (1125433)Time elapsed: 0.001 s
% 6.64/1.96  % (1125433)Peak memory usage: 86 MB
% 6.64/1.96  % (1125432)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.64/1.96  % (1125432)CaDiCaL version: 2.1.3
% 6.64/1.96  % (1125432)Termination reason: Refutation not found, incomplete strategy
% 6.64/1.96  % (1125432)Time elapsed: 0.001 s
% 6.64/1.96  % (1125432)Peak memory usage: 86 MB
% 6.64/1.96  % (1125435)Refutation not found, incomplete strategy
% 6.64/1.96  % (1125435)------------------------------
% 6.64/1.96  % (1125435)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.64/1.96  % (1125435)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.64/1.96  % (1125435)CaDiCaL version: 2.1.3
% 6.64/1.96  % (1125435)Termination reason: Refutation not found, incomplete strategy
% 6.64/1.96  % (1125435)Time elapsed: 0.001 s
% 6.64/1.96  % (1125435)Peak memory usage: 88 MB
% 6.64/1.96  % (1125435)Instructions burned: 1 (million)
% 6.64/1.96  % (1125434)Instruction limit reached! 
% 6.64/1.96  % (1125434)------------------------------
% 6.64/1.96  % (1125434)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.64/1.96  % (1125434)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.64/1.96  % (1125434)CaDiCaL version: 2.1.3
% 6.64/1.96  % (1125434)Termination reason: Instruction limit
% 6.64/1.96  % (1125434)Termination phase: Saturation
% 6.64/1.96  % (1125434)Time elapsed: 0.088 s
% 6.64/1.96  % (1125434)Peak memory usage: 90 MB
% 6.64/1.96  % (1125434)Instructions burned: 139 (million)
% 6.64/1.96  % (1125432)------------------------------
% 6.64/1.96  % (1125432)------------------------------
% 6.64/1.96  % (1125433)------------------------------
% 6.64/1.96  % (1125433)------------------------------
% 6.64/1.96  % (1125435)------------------------------
% 6.64/1.96  % (1125435)------------------------------
% 6.64/1.96  % (1125443)lrs+10_1_sil=8000:sp=occurrence:random_seed=1302133686:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 6.64/1.96  % (1125443)Refutation not found, incomplete strategy
% 6.64/1.96  % (1125443)------------------------------
% 6.64/1.96  % (1125443)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.64/1.96  % (1125443)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.64/1.96  % (1125443)CaDiCaL version: 2.1.3
% 6.64/1.96  % (1125443)Termination reason: Refutation not found, incomplete strategy
% 6.64/1.96  % (1125443)Time elapsed: 0.001 s
% 6.64/1.96  % (1125443)Peak memory usage: 87 MB
% 6.64/1.96  % (1125431)Refutation not found, incomplete strategy
% 6.64/1.96  % (1125431)------------------------------
% 6.64/1.96  % (1125431)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.64/1.96  % (1125431)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.64/1.96  % (1125431)CaDiCaL version: 2.1.3
% 6.64/1.96  % (1125431)Termination reason: Refutation not found, incomplete strategy
% 6.64/1.96  % (1125431)Time elapsed: 0.320 s
% 6.64/1.96  % (1125431)Peak memory usage: 127 MB
% 6.64/1.96  % (1125431)Instructions burned: 824 (million)
% 6.64/1.96  % (1125445)lrs+10_1_sil=32000:urr=on:br=off:random_seed=581859491:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2995 on theBenchmark for (2995ds/157Mi)
% 6.64/1.96  % (1125447)dis+10_5:1_slsqr=1,4:sil=8000:fde=unused:erd=off:urr=full:fd=off:s2agt=8:br=off:slsq=on:random_seed=3911881007:s2a=on:i=248:s2at=1.23:gtg=position_2995 on theBenchmark for (2995ds/248Mi)
% 6.64/1.96  % (1125446)lrs+1011_1_sil=32000:sp=occurrence:random_seed=3923382007:i=325:sd=1:ss=axioms:sgt=32_2995 on theBenchmark for (2995ds/325Mi)
% 6.64/1.96  % (1125446)Refutation not found, incomplete strategy
% 6.64/1.96  % (1125446)------------------------------
% 6.64/1.96  % (1125446)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.64/1.96  % (1125446)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.64/1.96  % (1125445)Refutation not found, incomplete strategy
% 6.64/1.96  % (1125445)------------------------------
% 6.64/1.96  % (1125445)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.64/1.96  % (1125445)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.64/1.96  % (1125446)CaDiCaL version: 2.1.3
% 6.64/1.96  % (1125446)Termination reason: Refutation not found, incomplete strategy
% 6.64/1.96  % (1125446)Time elapsed: 0.001 s
% 6.64/1.96  % (1125445)CaDiCaL version: 2.1.3
% 6.64/1.96  % (1125446)Peak memory usage: 86 MB
% 6.64/1.96  % (1125445)Termination reason: Refutation not found, incomplete strategy
% 6.64/1.96  % (1125445)Time elapsed: 0.001 s
% 6.64/1.96  % (1125445)Peak memory usage: 87 MB
% 6.64/1.96  % (1125431)------------------------------
% 6.64/1.96  % (1125431)------------------------------
% 6.64/1.96  % (1125443)------------------------------
% 6.64/1.96  % (1125443)------------------------------
% 6.64/1.96  % (1125447)Instruction limit reached! 
% 6.64/1.96  % (1125447)------------------------------
% 6.64/1.96  % (1125447)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.64/1.96  % (1125447)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.64/1.96  % (1125447)CaDiCaL version: 2.1.3
% 6.64/1.96  % (1125447)Termination reason: Instruction limit
% 6.64/1.96  % (1125447)Termination phase: Saturation
% 6.64/1.96  % (1125447)Time elapsed: 0.160 s
% 6.64/1.96  % (1125447)Peak memory usage: 92 MB
% 6.64/1.96  % (1125447)Instructions burned: 248 (million)
% 6.64/1.96  % (1125451)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=721121405:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2993 on theBenchmark for (2993ds/294Mi)
% 6.64/1.96  % (1125451)Refutation not found, incomplete strategy
% 6.64/1.96  % (1125451)------------------------------
% 6.64/1.96  % (1125451)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.64/1.96  % (1125451)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.64/1.96  % (1125451)CaDiCaL version: 2.1.3
% 6.64/1.96  % (1125451)Termination reason: Refutation not found, incomplete strategy
% 6.64/1.96  % (1125451)Time elapsed: 0.0000 s
% 6.64/1.96  % (1125451)Peak memory usage: 86 MB
% 6.64/1.96  % (1125452)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=786901236:i=2350_2993 on theBenchmark for (2993ds/2350Mi)
% 6.64/1.96  % (1125446)------------------------------
% 6.64/1.96  % (1125446)------------------------------
% 6.64/1.96  % (1125445)------------------------------
% 6.64/1.96  % (1125445)------------------------------
% 6.64/1.96  % (1125429)First to succeed.
% 6.64/1.96  % (1125429)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1125424"
% 6.64/1.96  % (1125451)------------------------------
% 6.64/1.96  % (1125451)------------------------------
% 6.64/1.96  % (1125453)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=2020277280:cts=off:i=113:fsr=off:ss=included:sgt=4_2992 on theBenchmark for (2992ds/113Mi)
% 6.64/1.96  % (1125453)Refutation not found, incomplete strategy
% 6.64/1.96  % (1125453)------------------------------
% 6.64/1.96  % (1125453)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.64/1.96  % (1125453)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.64/1.96  % (1125453)CaDiCaL version: 2.1.3
% 6.64/1.96  % (1125453)Termination reason: Refutation not found, incomplete strategy
% 6.64/1.96  % (1125453)Time elapsed: 0.001 s
% 6.64/1.96  % (1125453)Peak memory usage: 88 MB
% 6.64/1.96  % (1125457)dis-1003_1024_sil=8000:sos=all:sac=on:random_seed=2881252237:cond=fast:i=114:sd=1:nm=0:fsr=off:gtg=exists_sym:ss=axioms_2991 on theBenchmark for (2991ds/114Mi)
% 6.64/1.96  % (1125456)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=1569979174:i=127:av=off:fsr=off:sup=off_2991 on theBenchmark for (2991ds/127Mi)
% 6.64/1.96  % (1125457)Refutation not found, incomplete strategy
% 6.64/1.96  % (1125457)------------------------------
% 6.64/1.96  % (1125457)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.64/1.96  % (1125457)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.64/1.96  % (1125457)CaDiCaL version: 2.1.3
% 6.64/1.96  % (1125457)Termination reason: Refutation not found, incomplete strategy
% 6.64/1.96  % (1125457)Time elapsed: 0.001 s
% 6.64/1.96  % (1125457)Peak memory usage: 87 MB
% 6.64/1.96  % (1125459)lrs+10_1_sil=8000:sp=occurrence:random_seed=514022932:st=1.2:i=907:sd=14:ss=axioms:sgt=12_2990 on theBenchmark for (2990ds/907Mi)
% 6.64/1.96  % (1125456)Instruction limit reached! 
% 6.64/1.96  % (1125456)------------------------------
% 6.64/1.96  % (1125456)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.64/1.96  % (1125456)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.64/1.96  % (1125456)CaDiCaL version: 2.1.3
% 6.64/1.96  % (1125456)Termination reason: Instruction limit
% 6.64/1.96  % (1125456)Termination phase: Saturation
% 6.64/1.96  % (1125456)Time elapsed: 0.069 s
% 6.64/1.96  % (1125456)Peak memory usage: 88 MB
% 6.64/1.96  % (1125456)Instructions burned: 128 (million)
% 6.64/1.96  % (1125429)Refutation found. Thanks to Tanya!
% 6.64/1.96  % SZS status Theorem for theBenchmark
% 6.64/1.96  % SZS output start Proof for theBenchmark
% See solution above
% 8.44/2.15  % (1125429)------------------------------
% 8.44/2.15  % (1125429)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.44/2.15  % (1125429)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.44/2.15  % (1125429)CaDiCaL version: 2.1.3
% 8.44/2.15  % (1125429)Termination reason: Refutation
% 8.44/2.15  % (1125429)Time elapsed: 0.679 s
% 8.44/2.15  % (1125429)Peak memory usage: 127 MB
% 8.44/2.15  % (1125429)Instructions burned: 997 (million)
% 8.44/2.15  % (1125429)------------------------------
% 8.44/2.15  % (1125429)------------------------------
% 8.44/2.15  % (1125424)Success in time 1.107 s
% 8.44/2.15  % Vampire exiting
%------------------------------------------------------------------------------