↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : LCL077-1 : TPTP v9.3.1. Released v1.0.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:51:07 AM UTC 2026

% Result   : Unsatisfiable 3.67s 1.49s
% Output   : Refutation 3.67s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   25 (  14 unt;   1 def)
%            Number of atoms       :   39 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   38 (  24   ~;  13   |;   0   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    3 (   2 usr;   2 prp; 0-1 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-2 aty)
%            Number of variables   :   31 (   0 sgn  31   !;   0   ?)

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

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

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

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

fof(f5,negated_conjecture,
    ~ is_a_theorem(implies(not(not(a)),a)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_39) ).

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

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

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

fof(f24,plain,
    ! [X0,X1] :
      ( is_a_theorem(implies(implies(not(X0),not(X1)),X0))
      | ~ is_a_theorem(implies(implies(not(X0),not(X1)),X1)) ),
    inference(resolution,[],[f22,f4]) ).

fof(f28,plain,
    ! [X2,X0,X1] :
      ( is_a_theorem(implies(X0,X2))
      | ~ is_a_theorem(implies(X0,X1))
      | ~ is_a_theorem(implies(X1,X2)) ),
    inference(resolution,[],[f22,f6]) ).

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

fof(f35,plain,
    ( ! [X1] : ~ is_a_theorem(X1)
    | ~ spl0_3 ),
    inference(avatar_component_clause,[],[f34]) ).

fof(f43,plain,
    ( $false
    | ~ spl0_3 ),
    inference(resolution,[],[f35,f2]) ).

fof(f53,plain,
    ~ spl0_3,
    inference(avatar_contradiction_clause,[],[f43]) ).

fof(f54,plain,
    ! [X0] :
      ( ~ is_a_theorem(implies(not(not(a)),X0))
      | ~ is_a_theorem(implies(X0,a)) ),
    inference(resolution,[],[f28,f5]) ).

fof(f58,plain,
    ! [X0] : ~ is_a_theorem(implies(implies(X0,not(not(a))),a)),
    inference(resolution,[],[f54,f2]) ).

fof(f76,plain,
    ! [X0,X1] :
      ( ~ is_a_theorem(implies(implies(X0,not(not(a))),X1))
      | ~ is_a_theorem(implies(X1,a)) ),
    inference(resolution,[],[f58,f28]) ).

fof(f227,plain,
    ! [X0] : ~ is_a_theorem(implies(implies(not(a),X0),a)),
    inference(resolution,[],[f76,f4]) ).

fof(f241,plain,
    ! [X0] : ~ is_a_theorem(implies(implies(not(a),not(X0)),X0)),
    inference(resolution,[],[f227,f24]) ).

fof(f268,plain,
    ! [X0] : ~ is_a_theorem(X0),
    inference(resolution,[],[f241,f6]) ).

fof(f271,plain,
    spl0_3,
    inference(avatar_split_clause,[],[f268,f34]) ).

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

cnf(s10,plain,
    spl0_3,
    inference(sat_conversion,[],[f271]) ).

cnf(s12,plain,
    $false,
    inference(rat,[],[s5,s10]) ).

fof(f273,plain,
    $false,
    inference(avatar_sat_refutation,[],[s12]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL077-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37  % Computer : n010.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Sun Sep 27 15:21:16 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.40  Running first-order theorem proving
% 0.11/0.40  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
% 3.67/1.48  % (1083541)Input is clausal, will run a generic CNF schedule.
% 3.67/1.48  % (1083647)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=4284117249:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 3.67/1.48  % (1083653)dis-21_1_sil=8000:lcm=predicate:random_seed=2822774149: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.67/1.48  % (1083652)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1441585875:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 3.67/1.48  % (1083648)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=2223356506:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 3.67/1.48  % (1083651)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=2394472866:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 3.67/1.48  % (1083649)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=1414853088:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 3.67/1.48  % (1083651)First to succeed.
% 3.67/1.48  % (1083651)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1083541"
% 3.67/1.48  % (1083650)lrs+10_1_sil=8000:sp=occurrence:random_seed=738599503:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 3.67/1.48  % (1083650)Also succeeded, but the first one will report.
% 3.67/1.48  % (1083652)Also succeeded, but the first one will report.
% 3.67/1.48  % (1083653)Instruction limit reached! 
% 3.67/1.48  % (1083653)------------------------------
% 3.67/1.48  % (1083653)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.67/1.48  % (1083653)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.67/1.48  % (1083653)CaDiCaL version: 2.1.3
% 3.67/1.48  % (1083653)Termination reason: Instruction limit
% 3.67/1.48  % (1083653)Termination phase: Saturation
% 3.67/1.48  % (1083653)Time elapsed: 0.070 s
% 3.67/1.48  % (1083653)Peak memory usage: 88 MB
% 3.67/1.48  % (1083653)Instructions burned: 118 (million)
% 3.67/1.48  % (1083667)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=3790019494:i=143:sd=2:aac=none:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/143Mi)
% 3.67/1.49  % (1083667)Refutation not found, incomplete strategy
% 3.67/1.49  % (1083667)------------------------------
% 3.67/1.49  % (1083667)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.67/1.49  % (1083667)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.67/1.49  % (1083667)CaDiCaL version: 2.1.3
% 3.67/1.49  % (1083667)Termination reason: Refutation not found, incomplete strategy
% 3.67/1.49  % (1083667)Time elapsed: 0.001 s
% 3.67/1.49  % (1083667)Peak memory usage: 87 MB
% 3.67/1.49  % (1083651)Refutation found. Thanks to Tanya!
% 3.67/1.49  % SZS status Unsatisfiable for theBenchmark
% 3.67/1.49  % SZS output start Proof for theBenchmark
% See solution above
% 3.67/1.49  % (1083651)------------------------------
% 3.67/1.49  % (1083651)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.67/1.49  % (1083651)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.67/1.49  % (1083651)CaDiCaL version: 2.1.3
% 3.67/1.49  % (1083651)Termination reason: Refutation
% 3.67/1.49  % (1083651)Time elapsed: 0.008 s
% 3.67/1.49  % (1083651)Peak memory usage: 89 MB
% 3.67/1.49  % (1083651)Instructions burned: 10 (million)
% 3.67/1.49  % (1083651)------------------------------
% 3.67/1.49  % (1083651)------------------------------
% 3.67/1.49  % (1083541)Success in time 0.439 s
% 3.67/1.49  % Vampire exiting
%------------------------------------------------------------------------------