↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : LCL083-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 : 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:08 AM UTC 2026

% Result   : Unsatisfiable 3.69s 1.54s
% Output   : Refutation 3.69s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   47 (  12 unt;   5 def)
%            Number of atoms       :   95 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   93 (  45   ~;  43   |;   0   &)
%                                         (   5 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    7 (   6 usr;   6 prp; 0-1 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   89 (   0 sgn  89   !;   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,
    ! [X2,X3,X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),X2),implies(implies(X2,X0),implies(X3,X0)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ic_JLukasiewicz) ).

fof(f3,negated_conjecture,
    ~ is_a_theorem(implies(implies(implies(a,b),a),a)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ic_3) ).

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

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

fof(f7,plain,
    ! [X2,X3,X0,X1,X4] :
      ( ~ is_a_theorem(implies(implies(X1,X4),X2))
      | is_a_theorem(implies(X3,X2))
      | ~ is_a_theorem(implies(implies(X0,X1),X2)) ),
    inference(resolution,[],[f5,f4]) ).

fof(f10,plain,
    ! [X2,X0,X1] :
      ( ~ is_a_theorem(implies(implies(X0,X0),X1))
      | is_a_theorem(implies(X2,X1)) ),
    inference(factoring,[],[f7]) ).

fof(f11,plain,
    ! [X2,X3,X0,X1] : is_a_theorem(implies(X0,implies(implies(implies(X1,X2),X1),implies(X3,X1)))),
    inference(resolution,[],[f10,f2]) ).

fof(f17,plain,
    ! [X2,X3,X0,X1,X4] :
      ( ~ is_a_theorem(implies(implies(implies(implies(X0,X1),X0),implies(X2,X0)),X3))
      | is_a_theorem(implies(X4,X3)) ),
    inference(resolution,[],[f11,f5]) ).

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

fof(f20,definition,
    ( spl0_1
  <=> ! [X2,X1,X3] : is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X3,X1))) ),
    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).

fof(f21,plain,
    ( ! [X2,X3,X1] : is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X3,X1)))
    | ~ spl0_1 ),
    inference(avatar_component_clause,[],[f20]) ).

fof(f23,definition,
    ( spl0_2
  <=> ! [X0] : ~ is_a_theorem(X0) ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

fof(f24,plain,
    ( ! [X0] : ~ is_a_theorem(X0)
    | ~ spl0_2 ),
    inference(avatar_component_clause,[],[f23]) ).

fof(f25,plain,
    ( spl0_1
    | spl0_2 ),
    inference(avatar_split_clause,[],[f18,f23,f20]) ).

fof(f29,plain,
    ( $false
    | ~ spl0_2 ),
    inference(resolution,[],[f24,f2]) ).

fof(f33,plain,
    ~ spl0_2,
    inference(avatar_contradiction_clause,[],[f29]) ).

fof(f41,plain,
    ( ! [X2,X3,X0,X1,X4] :
        ( ~ is_a_theorem(implies(implies(X3,implies(X2,X4)),implies(X1,X2)))
        | is_a_theorem(implies(X0,implies(X1,X2))) )
    | ~ spl0_1 ),
    inference(resolution,[],[f21,f7]) ).

fof(f148,plain,
    ! [X2,X3,X0,X1,X4,X5] :
      ( ~ is_a_theorem(implies(implies(implies(X2,X3),X4),implies(implies(X3,X5),X3)))
      | is_a_theorem(implies(X0,implies(X1,implies(X2,X3)))) ),
    inference(resolution,[],[f17,f4]) ).

fof(f317,plain,
    ( ! [X2,X3,X0,X1] : is_a_theorem(implies(X0,implies(implies(implies(implies(X1,X2),X3),X2),implies(X1,X2))))
    | ~ spl0_1 ),
    inference(resolution,[],[f41,f2]) ).

fof(f859,plain,
    ( ! [X2,X3,X0,X1] :
        ( ~ is_a_theorem(X0)
        | is_a_theorem(implies(implies(implies(implies(X1,X2),X3),X2),implies(X1,X2))) )
    | ~ spl0_1 ),
    inference(resolution,[],[f317,f1]) ).

fof(f861,definition,
    ( spl0_12
  <=> ! [X2,X1,X3] : is_a_theorem(implies(implies(implies(implies(X1,X2),X3),X2),implies(X1,X2))) ),
    introduced(definition,[new_symbols(definition,[spl0_12])],[avatar_definition]) ).

fof(f862,plain,
    ( ! [X2,X3,X1] : is_a_theorem(implies(implies(implies(implies(X1,X2),X3),X2),implies(X1,X2)))
    | ~ spl0_12 ),
    inference(avatar_component_clause,[],[f861]) ).

fof(f863,plain,
    ( spl0_12
    | spl0_2
    | ~ spl0_1 ),
    inference(avatar_split_clause,[],[f859,f20,f23,f861]) ).

fof(f867,plain,
    ( ! [X2,X3,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(implies(implies(X2,X3),X2),X2))))
    | ~ spl0_12 ),
    inference(resolution,[],[f862,f148]) ).

fof(f1135,plain,
    ( ! [X2,X3,X0,X1] :
        ( ~ is_a_theorem(X0)
        | is_a_theorem(implies(X1,implies(implies(implies(X2,X3),X2),X2))) )
    | ~ spl0_12 ),
    inference(resolution,[],[f867,f1]) ).

fof(f1137,definition,
    ( spl0_14
  <=> ! [X2,X1,X3] : is_a_theorem(implies(X1,implies(implies(implies(X2,X3),X2),X2))) ),
    introduced(definition,[new_symbols(definition,[spl0_14])],[avatar_definition]) ).

fof(f1138,plain,
    ( ! [X2,X3,X1] : is_a_theorem(implies(X1,implies(implies(implies(X2,X3),X2),X2)))
    | ~ spl0_14 ),
    inference(avatar_component_clause,[],[f1137]) ).

fof(f1139,plain,
    ( spl0_14
    | spl0_2
    | ~ spl0_12 ),
    inference(avatar_split_clause,[],[f1135,f861,f23,f1137]) ).

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

fof(f1203,definition,
    ( spl0_15
  <=> ! [X2,X1] : is_a_theorem(implies(implies(implies(X1,X2),X1),X1)) ),
    introduced(definition,[new_symbols(definition,[spl0_15])],[avatar_definition]) ).

fof(f1204,plain,
    ( ! [X2,X1] : is_a_theorem(implies(implies(implies(X1,X2),X1),X1))
    | ~ spl0_15 ),
    inference(avatar_component_clause,[],[f1203]) ).

fof(f1205,plain,
    ( spl0_15
    | spl0_2
    | ~ spl0_14 ),
    inference(avatar_split_clause,[],[f1201,f1137,f23,f1203]) ).

fof(f1258,plain,
    ( $false
    | ~ spl0_15 ),
    inference(resolution,[],[f1204,f3]) ).

fof(f1261,plain,
    ~ spl0_15,
    inference(avatar_contradiction_clause,[],[f1258]) ).

cnf(s1,plain,
    ( spl0_1
    | spl0_2 ),
    inference(sat_conversion,[],[f25]) ).

cnf(s3,plain,
    ~ spl0_2,
    inference(sat_conversion,[],[f33]) ).

cnf(s14,plain,
    ( ~ spl0_1
    | spl0_2
    | spl0_12 ),
    inference(sat_conversion,[],[f863]) ).

cnf(s16,plain,
    ( spl0_2
    | ~ spl0_12
    | spl0_14 ),
    inference(sat_conversion,[],[f1139]) ).

cnf(s17,plain,
    ( spl0_2
    | ~ spl0_14
    | spl0_15 ),
    inference(sat_conversion,[],[f1205]) ).

cnf(s18,plain,
    ~ spl0_15,
    inference(sat_conversion,[],[f1261]) ).

cnf(s19,plain,
    ( spl0_2
    | ~ spl0_14 ),
    inference(rat,[],[s17,s18]) ).

cnf(s20,plain,
    ~ spl0_14,
    inference(rat,[],[s19,s3]) ).

cnf(s21,plain,
    ~ spl0_12,
    inference(rat,[],[s16,s20,s3]) ).

cnf(s22,plain,
    ~ spl0_1,
    inference(rat,[],[s14,s21,s3]) ).

cnf(s28,plain,
    $false,
    inference(rat,[],[s1,s3,s22]) ).

fof(f1262,plain,
    $false,
    inference(avatar_sat_refutation,[],[s28]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL083-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.10/0.36  % Computer : n003.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:22:56 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.36  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.42  Running first-order theorem proving
% 0.14/0.42  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.69/1.54  % (693851)Input is clausal, will run a generic CNF schedule.
% 3.69/1.54  % (693868)lrs+10_1_sil=8000:sp=occurrence:random_seed=2953737437:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 3.69/1.54  % (693868)Instruction limit reached! 
% 3.69/1.54  % (693868)------------------------------
% 3.69/1.54  % (693868)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.69/1.54  % (693868)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.69/1.54  % (693868)CaDiCaL version: 2.1.3
% 3.69/1.54  % (693868)Termination reason: Instruction limit
% 3.69/1.54  % (693868)Termination phase: Saturation
% 3.69/1.54  % (693868)Time elapsed: 0.037 s
% 3.69/1.54  % (693868)Peak memory usage: 89 MB
% 3.69/1.54  % (693868)Instructions burned: 110 (million)
% 3.69/1.54  % (693867)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=2081010725:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 3.69/1.54  % (693865)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=691284106:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 3.69/1.54  % (693869)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=1246066911:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 3.69/1.54  % (693866)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=3310191328:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 3.69/1.54  % (693869)First to succeed.
% 3.69/1.54  % (693869)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-693851"
% 3.69/1.54  % (693871)dis-21_1_sil=8000:lcm=predicate:random_seed=4036406827: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.69/1.54  % (693870)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3220210516:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 3.69/1.54  % (693870)Also succeeded, but the first one will report.
% 3.69/1.54  % (693877)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=2669110352:i=143:sd=2:aac=none:ss=axioms:sgt=16_2998 on theBenchmark for (2998ds/143Mi)
% 3.69/1.54  % (693877)Refutation not found, incomplete strategy
% 3.69/1.54  % (693877)------------------------------
% 3.69/1.54  % (693877)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.69/1.54  % (693877)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.69/1.54  % (693877)CaDiCaL version: 2.1.3
% 3.69/1.54  % (693877)Termination reason: Refutation not found, incomplete strategy
% 3.69/1.54  % (693877)Time elapsed: 0.0000 s
% 3.69/1.54  % (693877)Peak memory usage: 87 MB
% 3.69/1.54  % (693871)Instruction limit reached! 
% 3.69/1.54  % (693871)------------------------------
% 3.69/1.54  % (693871)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.69/1.54  % (693871)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.69/1.54  % (693871)CaDiCaL version: 2.1.3
% 3.69/1.54  % (693871)Termination reason: Instruction limit
% 3.69/1.54  % (693871)Termination phase: Saturation
% 3.69/1.54  % (693871)Time elapsed: 0.070 s
% 3.69/1.54  % (693871)Peak memory usage: 88 MB
% 3.69/1.54  % (693871)Instructions burned: 117 (million)
% 3.69/1.54  % (693877)------------------------------
% 3.69/1.54  % (693877)------------------------------
% 3.69/1.54  % (693869)Refutation found. Thanks to Tanya!
% 3.69/1.54  % SZS status Unsatisfiable for theBenchmark
% 3.69/1.54  % SZS output start Proof for theBenchmark
% See solution above
% 3.69/1.55  % (693869)------------------------------
% 3.69/1.55  % (693869)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.69/1.55  % (693869)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.69/1.55  % (693869)CaDiCaL version: 2.1.3
% 3.69/1.55  % (693869)Termination reason: Refutation
% 3.69/1.55  % (693869)Time elapsed: 0.023 s
% 3.69/1.55  % (693869)Peak memory usage: 89 MB
% 3.69/1.55  % (693869)Instructions burned: 35 (million)
% 3.69/1.55  % (693869)------------------------------
% 3.69/1.55  % (693869)------------------------------
% 3.69/1.55  % (693851)Success in time 0.446 s
% 3.69/1.55  % Vampire exiting
%------------------------------------------------------------------------------