↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : LCL110-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n003.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:51:14 AM UTC 2026

% Result   : Unsatisfiable 3.43s 1.35s
% Output   : Refutation 3.43s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   31 (  14 unt;   2 def)
%            Number of atoms       :   51 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   43 (  23   ~;  18   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    4 (   3 usr;   3 prp; 0-1 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-2 aty)
%            Number of variables   :   39 (   0 sgn  39   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] :
      ( ~ is_a_theorem(implies(X0,X1))
      | ~ is_a_theorem(X0)
      | is_a_theorem(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).

fof(f2,axiom,
    ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mv_1) ).

fof(f3,axiom,
    ! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mv_2) ).

fof(f4,axiom,
    ! [X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),X1),implies(implies(X1,X0),X0))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mv_3) ).

fof(f5,axiom,
    ! [X0,X1] : is_a_theorem(implies(implies(not(X0),not(X1)),implies(X1,X0))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mv_5) ).

fof(f6,negated_conjecture,
    ~ is_a_theorem(implies(not(not(a)),a)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_mv_24) ).

fof(f7,plain,
    ! [X0,X1] :
      ( is_a_theorem(implies(X1,X0))
      | ~ is_a_theorem(X0) ),
    inference(resolution,[],[f1,f2]) ).

fof(f11,plain,
    ! [X2,X0,X1] :
      ( is_a_theorem(implies(implies(X1,X2),implies(X0,X2)))
      | ~ is_a_theorem(implies(X0,X1)) ),
    inference(resolution,[],[f3,f1]) ).

fof(f12,plain,
    ! [X0,X1] :
      ( ~ is_a_theorem(implies(implies(X0,X1),X1))
      | is_a_theorem(implies(implies(X1,X0),X0)) ),
    inference(resolution,[],[f4,f1]) ).

fof(f14,plain,
    ! [X2,X0,X1] :
      ( ~ is_a_theorem(implies(X1,X2))
      | ~ is_a_theorem(implies(X0,X1))
      | is_a_theorem(implies(X0,X2)) ),
    inference(resolution,[],[f11,f1]) ).

fof(f26,plain,
    ! [X0,X1] :
      ( is_a_theorem(implies(implies(X0,X1),X1))
      | ~ is_a_theorem(X0) ),
    inference(resolution,[],[f12,f7]) ).

fof(f30,plain,
    ! [X2,X0,X1] :
      ( ~ is_a_theorem(implies(X0,implies(not(X1),not(X2))))
      | is_a_theorem(implies(X0,implies(X2,X1))) ),
    inference(resolution,[],[f14,f5]) ).

fof(f36,plain,
    ! [X2,X0,X1] :
      ( ~ is_a_theorem(implies(X0,implies(X1,X2)))
      | is_a_theorem(implies(X0,X2))
      | ~ is_a_theorem(X1) ),
    inference(resolution,[],[f14,f26]) ).

fof(f87,definition,
    ( spl0_5
  <=> ! [X1] : ~ is_a_theorem(X1) ),
    introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).

fof(f88,plain,
    ( ! [X1] : ~ is_a_theorem(X1)
    | ~ spl0_5 ),
    inference(avatar_component_clause,[],[f87]) ).

fof(f93,plain,
    ( $false
    | ~ spl0_5 ),
    inference(resolution,[],[f88,f2]) ).

fof(f107,plain,
    ~ spl0_5,
    inference(avatar_contradiction_clause,[],[f93]) ).

fof(f108,plain,
    ! [X0,X1] : is_a_theorem(implies(not(X0),implies(X0,X1))),
    inference(resolution,[],[f30,f2]) ).

fof(f131,plain,
    ! [X0,X1] : is_a_theorem(implies(not(not(X0)),implies(X1,X0))),
    inference(resolution,[],[f108,f30]) ).

fof(f180,plain,
    ! [X0,X1] :
      ( is_a_theorem(implies(not(not(X0)),X0))
      | ~ is_a_theorem(X1) ),
    inference(resolution,[],[f131,f36]) ).

fof(f188,definition,
    ( spl0_7
  <=> ! [X0] : is_a_theorem(implies(not(not(X0)),X0)) ),
    introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).

fof(f189,plain,
    ( ! [X0] : is_a_theorem(implies(not(not(X0)),X0))
    | ~ spl0_7 ),
    inference(avatar_component_clause,[],[f188]) ).

fof(f190,plain,
    ( spl0_5
    | spl0_7 ),
    inference(avatar_split_clause,[],[f180,f188,f87]) ).

fof(f191,plain,
    ( $false
    | ~ spl0_7 ),
    inference(resolution,[],[f189,f6]) ).

fof(f201,plain,
    ~ spl0_7,
    inference(avatar_contradiction_clause,[],[f191]) ).

cnf(s7,plain,
    ~ spl0_5,
    inference(sat_conversion,[],[f107]) ).

cnf(s8,plain,
    ( spl0_5
    | spl0_7 ),
    inference(sat_conversion,[],[f190]) ).

cnf(s9,plain,
    ~ spl0_7,
    inference(sat_conversion,[],[f201]) ).

cnf(s10,plain,
    spl0_5,
    inference(rat,[],[s8,s9]) ).

cnf(s11,plain,
    $false,
    inference(rat,[],[s7,s10]) ).

fof(f202,plain,
    $false,
    inference(avatar_sat_refutation,[],[s11]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL110-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37  % Computer : n003.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:24:26 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.40  Running first-order theorem proving
% 0.10/0.40  Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.43/1.35  % (697788)Input is clausal, will run a generic CNF schedule.
% 3.43/1.35  % (697841)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=2794731259:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 3.43/1.35  % (697846)dis-21_1_sil=8000:lcm=predicate:random_seed=3248476036:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/117Mi)
% 3.43/1.35  % (697842)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=3350656247:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 3.43/1.35  % (697845)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3518161163:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 3.43/1.35  % (697843)lrs+10_1_sil=8000:sp=occurrence:random_seed=3501060705:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 3.43/1.35  % (697844)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=4223859053:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 3.43/1.35  % (697840)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=1335930977:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 3.43/1.35  % (697843)First to succeed.
% 3.43/1.35  % (697843)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-697788"
% 3.43/1.35  % (697844)Also succeeded, but the first one will report.
% 3.43/1.35  % (697846)Instruction limit reached! 
% 3.43/1.35  % (697846)------------------------------
% 3.43/1.35  % (697846)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.43/1.35  % (697846)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.43/1.35  % (697846)CaDiCaL version: 2.1.3
% 3.43/1.35  % (697846)Termination reason: Instruction limit
% 3.43/1.35  % (697846)Termination phase: Saturation
% 3.43/1.35  % (697846)Time elapsed: 0.074 s
% 3.43/1.35  % (697846)Peak memory usage: 88 MB
% 3.43/1.35  % (697846)Instructions burned: 118 (million)
% 3.43/1.35  % (697845)Instruction limit reached! 
% 3.43/1.35  % (697845)------------------------------
% 3.43/1.35  % (697845)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.43/1.35  % (697845)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.43/1.35  % (697845)CaDiCaL version: 2.1.3
% 3.43/1.35  % (697845)Termination reason: Instruction limit
% 3.43/1.35  % (697845)Termination phase: Saturation
% 3.43/1.35  % (697845)Time elapsed: 0.124 s
% 3.43/1.35  % (697845)Peak memory usage: 89 MB
% 3.43/1.35  % (697845)Instructions burned: 181 (million)
% 3.43/1.35  % (697854)dis+1010_3_sil=8000:plsq=on:drc=off:fde=none:plsqc=1:bsd=on:plsqr=7,2:sos=on:spb=goal_then_units:random_seed=1173460414:i=143:sd=2:aac=none:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/143Mi)
% 3.43/1.35  % (697854)Refutation not found, incomplete strategy
% 3.43/1.35  % (697854)------------------------------
% 3.43/1.35  % (697854)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.43/1.35  % (697854)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.43/1.35  % (697854)CaDiCaL version: 2.1.3
% 3.43/1.35  % (697854)Termination reason: Refutation not found, incomplete strategy
% 3.43/1.35  % (697854)Time elapsed: 0.001 s
% 3.43/1.35  % (697854)Peak memory usage: 87 MB
% 3.43/1.35  % (697843)Refutation found. Thanks to Tanya!
% 3.43/1.35  % SZS status Unsatisfiable for theBenchmark
% 3.43/1.35  % SZS output start Proof for theBenchmark
% See solution above
% 3.43/1.35  % (697843)------------------------------
% 3.43/1.35  % (697843)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.43/1.35  % (697843)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.43/1.35  % (697843)CaDiCaL version: 2.1.3
% 3.43/1.35  % (697843)Termination reason: Refutation
% 3.43/1.35  % (697843)Time elapsed: 0.006 s
% 3.43/1.35  % (697843)Peak memory usage: 89 MB
% 3.43/1.35  % (697843)Instructions burned: 6 (million)
% 3.43/1.35  % (697843)------------------------------
% 3.43/1.35  % (697843)------------------------------
% 3.43/1.35  % (697788)Success in time 0.409 s
% 3.43/1.35  % Vampire exiting
%------------------------------------------------------------------------------