↑ 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  : LCL312-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n007.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:20 AM UTC 2026

% Result   : Unsatisfiable 1.85s 0.76s
% Output   : Refutation 1.85s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   51 (  33 unt;   0 def)
%            Number of atoms       :   75 (   4 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   52 (  28   ~;  24   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    9 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   1 con; 0-2 aty)
%            Number of variables   :   94 (  94   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0] : axiom(implies(or(X0,X0),X0)),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).

fof(f2,axiom,
    ! [X0,X1] : axiom(implies(X0,or(X1,X0))),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).

fof(f3,axiom,
    ! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_4) ).

fof(f4,axiom,
    ! [X2,X0,X1] : axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_5) ).

fof(f5,axiom,
    ! [X2,X0,X1] : axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).

fof(f6,axiom,
    ! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',implies_definition) ).

fof(f7,axiom,
    ! [X0] :
      ( ~ axiom(X0)
      | theorem(X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_1) ).

fof(f8,axiom,
    ! [X0,X1] :
      ( theorem(X0)
      | ~ theorem(implies(X1,X0))
      | ~ theorem(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_2) ).

fof(f9,axiom,
    ! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-1.ax',and_defn) ).

fof(f10,axiom,
    ! [X0,X1] : equivalent(X0,X1) = and(implies(X0,X1),implies(X1,X0)),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-2.ax',equivalent_defn) ).

fof(f11,negated_conjecture,
    ~ theorem(equivalent(implies(not(p),p),p)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

fof(f12,plain,
    ! [X0,X1] : equivalent(X0,X1) = not(or(not(or(not(X0),X1)),not(or(not(X1),X0)))),
    inference(definition_unfolding,[],[f10,f9,f6,f6]) ).

fof(f13,plain,
    ! [X0] : axiom(or(not(or(X0,X0)),X0)),
    inference(definition_unfolding,[],[f1,f6]) ).

fof(f14,plain,
    ! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
    inference(definition_unfolding,[],[f2,f6]) ).

fof(f15,plain,
    ! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
    inference(definition_unfolding,[],[f3,f6]) ).

fof(f16,plain,
    ! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
    inference(definition_unfolding,[],[f4,f6]) ).

fof(f17,plain,
    ! [X2,X0,X1] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
    inference(definition_unfolding,[],[f5,f6,f6,f6]) ).

fof(f18,plain,
    ! [X0,X1] :
      ( ~ theorem(or(not(X1),X0))
      | theorem(X0)
      | ~ theorem(X1) ),
    inference(definition_unfolding,[],[f8,f6]) ).

fof(f19,plain,
    ~ theorem(not(or(not(or(not(or(not(not(p)),p)),p)),not(or(not(p),or(not(not(p)),p)))))),
    inference(definition_unfolding,[],[f11,f12,f6]) ).

fof(f20,plain,
    ! [X0] : theorem(or(not(or(X0,X0)),X0)),
    inference(resolution,[],[f13,f7]) ).

fof(f21,plain,
    ! [X0,X1] : theorem(or(not(X0),or(X1,X0))),
    inference(resolution,[],[f14,f7]) ).

fof(f22,plain,
    ! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
    inference(resolution,[],[f15,f7]) ).

fof(f23,plain,
    ! [X0] :
      ( ~ theorem(or(X0,X0))
      | theorem(X0) ),
    inference(resolution,[],[f18,f20]) ).

fof(f27,plain,
    ! [X0,X1] :
      ( ~ theorem(or(X1,X0))
      | theorem(or(X0,X1)) ),
    inference(resolution,[],[f22,f18]) ).

fof(f66,plain,
    ! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
    inference(resolution,[],[f16,f7]) ).

fof(f67,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(X1,or(X0,X2)))
      | theorem(or(X0,or(X1,X2))) ),
    inference(resolution,[],[f66,f18]) ).

fof(f71,plain,
    ! [X0,X1] : theorem(or(X0,or(not(X1),X1))),
    inference(resolution,[],[f67,f21]) ).

fof(f72,plain,
    ! [X0,X1] : theorem(or(X0,or(not(or(X1,X0)),X1))),
    inference(resolution,[],[f67,f22]) ).

fof(f76,plain,
    ! [X0] : theorem(or(not(X0),X0)),
    inference(resolution,[],[f71,f23]) ).

fof(f111,plain,
    ! [X0] : theorem(or(X0,not(X0))),
    inference(resolution,[],[f27,f76]) ).

fof(f136,plain,
    ! [X0,X1] :
      ( theorem(or(not(or(X0,not(X1))),X0))
      | ~ theorem(X1) ),
    inference(resolution,[],[f72,f18]) ).

fof(f141,plain,
    ! [X2,X0,X1] : theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
    inference(resolution,[],[f17,f7]) ).

fof(f145,plain,
    ! [X0,X1] :
      ( ~ theorem(or(X1,not(X0)))
      | theorem(X1)
      | ~ theorem(X0) ),
    inference(resolution,[],[f136,f18]) ).

fof(f152,plain,
    ! [X0,X1] :
      ( theorem(not(or(not(X0),not(X1))))
      | ~ theorem(X0)
      | ~ theorem(X1) ),
    inference(resolution,[],[f145,f136]) ).

fof(f198,plain,
    ! [X2,X0,X1] :
      ( theorem(or(not(or(X0,X1)),or(X0,X2)))
      | ~ theorem(or(not(X1),X2)) ),
    inference(resolution,[],[f141,f18]) ).

fof(f264,plain,
    ( ~ theorem(or(not(or(not(not(p)),p)),p))
    | ~ theorem(or(not(p),or(not(not(p)),p))) ),
    inference(resolution,[],[f152,f19]) ).

fof(f266,plain,
    ~ theorem(or(not(or(not(not(p)),p)),p)),
    inference(forward_subsumption_resolution,[],[f264,f21]) ).

fof(f300,plain,
    ! [X2,X0,X1] : theorem(or(not(or(X0,X1)),or(not(or(not(X1),X2)),or(X0,X2)))),
    inference(resolution,[],[f67,f141]) ).

fof(f621,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(not(X0),X1))
      | theorem(or(X2,X1))
      | ~ theorem(or(X2,X0)) ),
    inference(resolution,[],[f198,f18]) ).

fof(f1590,plain,
    ! [X0,X1] :
      ( ~ theorem(or(X0,or(X1,X1)))
      | theorem(or(X0,X1)) ),
    inference(resolution,[],[f621,f20]) ).

fof(f1596,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(X0,or(X2,X1)))
      | theorem(or(X0,or(X1,X2))) ),
    inference(resolution,[],[f621,f22]) ).

fof(f1651,plain,
    ! [X0,X1] :
      ( theorem(or(X0,not(not(X1))))
      | ~ theorem(or(X0,X1)) ),
    inference(resolution,[],[f621,f111]) ).

fof(f1744,plain,
    ! [X0,X1] :
      ( ~ theorem(not(X1))
      | theorem(X0)
      | ~ theorem(or(X0,X1)) ),
    inference(resolution,[],[f1651,f145]) ).

fof(f1747,plain,
    ! [X0] :
      ( ~ theorem(or(not(not(X0)),X0))
      | theorem(not(not(X0))) ),
    inference(resolution,[],[f1651,f23]) ).

fof(f3744,plain,
    ! [X2,X0,X1] : theorem(or(or(not(or(not(X0),X1)),or(X2,X1)),not(or(X2,X0)))),
    inference(resolution,[],[f300,f27]) ).

fof(f3885,plain,
    ! [X0,X1] : theorem(or(X0,or(X1,not(X1)))),
    inference(resolution,[],[f1596,f71]) ).

fof(f4019,plain,
    ! [X0] : theorem(not(not(or(X0,not(X0))))),
    inference(resolution,[],[f3885,f1747]) ).

fof(f4148,plain,
    ! [X0,X1] :
      ( ~ theorem(or(X0,not(or(X1,not(X1)))))
      | theorem(X0) ),
    inference(resolution,[],[f4019,f1744]) ).

fof(f7443,plain,
    ! [X0,X1] : theorem(or(not(or(not(not(X0)),X1)),or(X0,X1))),
    inference(resolution,[],[f3744,f4148]) ).

fof(f13947,plain,
    ! [X0] : theorem(or(not(or(not(not(X0)),X0)),X0)),
    inference(resolution,[],[f7443,f1590]) ).

fof(f13975,plain,
    $false,
    inference(resolution,[],[f13947,f266]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL312-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.37  % Computer : n007.cluster.edu
% 0.12/0.37  % Model    : x86_64 x86_64
% 0.12/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37  % Memory   : 8046.5625MB
% 0.12/0.37  % OS       : Linux 6.8.0-71-generic
% 0.12/0.37  % CPULimit : 300
% 0.12/0.37  % WCLimit  : 300
% 0.12/0.37  % DateTime : Sun Sep 27 15:32:11 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.38  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.40  Running first-order model finding
% 0.12/0.40  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
% 1.85/0.76  % (1595898)Will run a generic schedule for satisfiability detection.
% 1.85/0.76  % (1595907)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=113871566:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.85/0.76  % (1595903)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2317182853_2999 on theBenchmark for (2999ds/0Mi)
% 1.85/0.76  % (1595908)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4015950064:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.85/0.76  % (1595906)dis+10_1_sil=32000:sp=arity:random_seed=2333588273:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.85/0.76  % (1595905)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=879797801:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.85/0.76  % (1595909)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1666256710:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.85/0.76  % TRYING [1]
% 1.85/0.76  % TRYING [2]
% 1.85/0.76  % (1595904)% WARNING: option uhcvi not known.
% 1.85/0.76  % TRYING [3]
% 1.85/0.76  % (1595904)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3343668952:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.85/0.76  % TRYING [4]
% 1.85/0.76  % (1595907)Instruction limit reached! 
% 1.85/0.76  % (1595907)------------------------------
% 1.85/0.76  % (1595907)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.85/0.76  % (1595907)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.85/0.76  % (1595907)CaDiCaL version: 2.1.3
% 1.85/0.76  % (1595907)Termination reason: Instruction limit
% 1.85/0.76  % (1595907)Termination phase: Saturation
% 1.85/0.76  % (1595907)Time elapsed: 0.029 s
% 1.85/0.76  % (1595907)Peak memory usage: 11 MB
% 1.85/0.76  % (1595907)Instructions burned: 118 (million)
% 1.85/0.76  % (1595917)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=475171802:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.85/0.76  % TRYING [1]
% 1.85/0.76  % TRYING [2]
% 1.85/0.76  % TRYING [3]
% 1.85/0.76  % TRYING [4]
% 1.85/0.76  % (1595906)Instruction limit reached! 
% 1.85/0.76  % (1595906)------------------------------
% 1.85/0.76  % (1595906)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.85/0.76  % (1595906)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.85/0.76  % (1595906)CaDiCaL version: 2.1.3
% 1.85/0.76  % (1595906)Termination reason: Instruction limit
% 1.85/0.76  % (1595906)Termination phase: Saturation
% 1.85/0.76  % (1595906)Time elapsed: 0.065 s
% 1.85/0.76  % (1595906)Peak memory usage: 12 MB
% 1.85/0.76  % (1595906)Instructions burned: 105 (million)
% 1.85/0.76  % (1595908)Instruction limit reached! 
% 1.85/0.76  % (1595908)------------------------------
% 1.85/0.76  % (1595908)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.85/0.76  % (1595908)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.85/0.76  % (1595908)CaDiCaL version: 2.1.3
% 1.85/0.76  % (1595908)Termination reason: Instruction limit
% 1.85/0.76  % (1595908)Termination phase: Saturation
% 1.85/0.76  % (1595908)Time elapsed: 0.081 s
% 1.85/0.76  % (1595908)Peak memory usage: 14 MB
% 1.85/0.76  % (1595908)Instructions burned: 131 (million)
% 1.85/0.76  % (1595919)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3000718888:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 1.85/0.76  % (1595909)Instruction limit reached! 
% 1.85/0.76  % (1595909)------------------------------
% 1.85/0.76  % (1595909)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.85/0.76  % (1595909)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.85/0.76  % (1595909)CaDiCaL version: 2.1.3
% 1.85/0.76  % (1595909)Termination reason: Instruction limit
% 1.85/0.76  % (1595909)Termination phase: Saturation
% 1.85/0.76  % (1595909)Time elapsed: 0.097 s
% 1.85/0.76  % (1595909)Peak memory usage: 13 MB
% 1.85/0.76  % (1595909)Instructions burned: 160 (million)
% 1.85/0.76  % (1595920)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=2110233835:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.85/0.76  % TRYING [5]
% 1.85/0.76  % (1595922)ott-21_1_sil=16000:fs=off:random_seed=3188585932:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.85/0.76  % TRYING [5]
% 1.85/0.76  % (1595919)Instruction limit reached! 
% 1.85/0.76  % (1595919)------------------------------
% 1.85/0.76  % (1595919)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.85/0.76  % (1595919)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.85/0.76  % (1595919)CaDiCaL version: 2.1.3
% 1.85/0.76  % (1595919)Termination reason: Instruction limit
% 1.85/0.76  % (1595919)Termination phase: Saturation
% 1.85/0.76  % (1595919)Time elapsed: 0.079 s
% 1.85/0.76  % (1595919)Peak memory usage: 13 MB
% 1.85/0.76  % (1595919)Instructions burned: 133 (million)
% 1.85/0.76  % (1595925)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2601743181:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 1.85/0.76  % (1595922)Instruction limit reached! 
% 1.85/0.76  % (1595922)------------------------------
% 1.85/0.76  % (1595922)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.85/0.76  % (1595922)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.85/0.76  % (1595922)CaDiCaL version: 2.1.3
% 1.85/0.76  % (1595922)Termination reason: Instruction limit
% 1.85/0.76  % (1595922)Termination phase: Saturation
% 1.85/0.76  % (1595922)Time elapsed: 0.089 s
% 1.85/0.76  % (1595922)Peak memory usage: 13 MB
% 1.85/0.76  % (1595922)Instructions burned: 180 (million)
% 1.85/0.76  % (1595927)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=4106426965:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 1.85/0.76  % TRYING [1]
% 1.85/0.76  % TRYING [2]
% 1.85/0.76  % TRYING [3]
% 1.85/0.76  % TRYING [4]
% 1.85/0.76  % TRYING [5]
% 1.85/0.76  % (1595917)Instruction limit reached! 
% 1.85/0.76  % (1595917)------------------------------
% 1.85/0.76  % (1595917)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.85/0.76  % (1595917)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.85/0.76  % (1595917)CaDiCaL version: 2.1.3
% 1.85/0.76  % (1595917)Termination reason: Instruction limit
% 1.85/0.76  % (1595917)Termination phase: Finite model building SAT solving
% 1.85/0.76  % (1595917)Time elapsed: 0.248 s
% 1.85/0.76  % (1595917)Peak memory usage: 17 MB
% 1.85/0.76  % (1595917)Instructions burned: 719 (million)
% 1.85/0.76  % (1595929)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=2442895963:i=1179_2996 on theBenchmark for (2996ds/1179Mi)
% 1.85/0.76  % (1595920) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1595898-1595920"...
% 1.85/0.76  % (1595920)...printing done.
% 1.85/0.76  % (1595920)Refutation found. Thanks to Tanya!
% 1.85/0.76  % SZS status Unsatisfiable for theBenchmark
% 1.85/0.76  % SZS output start Proof for theBenchmark
% See solution above
% 1.85/0.76  % (1595920)------------------------------
% 1.85/0.76  % (1595920)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.85/0.76  % (1595920)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.85/0.76  % (1595920)CaDiCaL version: 2.1.3
% 1.85/0.76  % (1595920)Termination reason: Refutation
% 1.85/0.76  % (1595920)Time elapsed: 0.209 s
% 1.85/0.76  % (1595920)Peak memory usage: 14 MB
% 1.85/0.76  % (1595920)Instructions burned: 372 (million)
% 1.85/0.76  % (1595898)Success in time 0.35 s
% 1.85/0.76  % Vampire exiting
%------------------------------------------------------------------------------