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

% Computer : n004.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:57:42 AM UTC 2026

% Result   : Unsatisfiable 1.41s 0.75s
% Output   : Refutation 1.41s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   36 (  14 unt;   2 def)
%            Number of atoms       :   63 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   57 (  30   ~;  25   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    4 (   3 usr;   3 prp; 0-1 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   48 (   0 sgn  48   !;   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(implies(a,b)),not(b))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_mv_39) ).

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

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

fof(f36,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(f37,plain,
    ! [X0,X1] :
      ( ~ is_a_theorem(implies(implies(X0,X1),X1))
      | is_a_theorem(implies(implies(X1,X0),X0)) ),
    inference(resolution,[],[f4,f1]) ).

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

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

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

fof(f53,plain,
    ! [X2,X0,X1] :
      ( ~ is_a_theorem(implies(X0,implies(X1,X2)))
      | is_a_theorem(implies(X0,X2))
      | ~ is_a_theorem(X1) ),
    inference(resolution,[],[f38,f40]) ).

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

fof(f154,plain,
    ( ! [X1] : ~ is_a_theorem(X1)
    | ~ spl0_6 ),
    inference(avatar_component_clause,[],[f153]) ).

fof(f159,plain,
    ( $false
    | ~ spl0_6 ),
    inference(resolution,[],[f154,f2]) ).

fof(f166,plain,
    ~ spl0_6,
    inference(avatar_contradiction_clause,[],[f159]) ).

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

fof(f886,plain,
    ! [X0,X1] : is_a_theorem(implies(not(not(X0)),implies(X1,X0))),
    inference(resolution,[],[f859,f48]) ).

fof(f914,plain,
    ! [X0,X1] :
      ( is_a_theorem(implies(not(not(X0)),X0))
      | ~ is_a_theorem(X1) ),
    inference(resolution,[],[f886,f53]) ).

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

fof(f926,plain,
    ( ! [X0] : is_a_theorem(implies(not(not(X0)),X0))
    | ~ spl0_34 ),
    inference(avatar_component_clause,[],[f925]) ).

fof(f927,plain,
    ( spl0_6
    | spl0_34 ),
    inference(avatar_split_clause,[],[f914,f925,f153]) ).

fof(f931,plain,
    ( ! [X0] : is_a_theorem(implies(X0,not(not(X0))))
    | ~ spl0_34 ),
    inference(resolution,[],[f926,f10]) ).

fof(f950,plain,
    ( ! [X0,X1] :
        ( is_a_theorem(implies(X0,not(not(X1))))
        | ~ is_a_theorem(implies(X0,X1)) )
    | ~ spl0_34 ),
    inference(resolution,[],[f931,f38]) ).

fof(f1544,plain,
    ( ! [X0,X1] :
        ( ~ is_a_theorem(implies(not(X0),X1))
        | is_a_theorem(implies(not(X1),X0)) )
    | ~ spl0_34 ),
    inference(resolution,[],[f950,f10]) ).

fof(f2913,plain,
    ( ! [X0,X1] : is_a_theorem(implies(not(implies(X0,X1)),not(X1)))
    | ~ spl0_34 ),
    inference(resolution,[],[f1544,f886]) ).

fof(f3016,plain,
    ( $false
    | ~ spl0_34 ),
    inference(resolution,[],[f2913,f6]) ).

fof(f3038,plain,
    ~ spl0_34,
    inference(avatar_contradiction_clause,[],[f3016]) ).

cnf(s12,plain,
    ~ spl0_6,
    inference(sat_conversion,[],[f166]) ).

cnf(s45,plain,
    ( spl0_6
    | spl0_34 ),
    inference(sat_conversion,[],[f927]) ).

cnf(s136,plain,
    ~ spl0_34,
    inference(sat_conversion,[],[f3038]) ).

cnf(s137,plain,
    spl0_6,
    inference(rat,[],[s45,s136]) ).

cnf(s138,plain,
    $false,
    inference(rat,[],[s12,s137]) ).

fof(f3039,plain,
    $false,
    inference(avatar_sat_refutation,[],[s138]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : LCL115-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.08  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.17/0.43  % Computer : n004.cluster.edu
% 0.17/0.43  % Model    : x86_64 x86_64
% 0.17/0.43  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43  % Memory   : 8046.5625MB
% 0.17/0.43  % OS       : Linux 6.8.0-71-generic
% 0.17/0.43  % CPULimit : 300
% 0.17/0.43  % WCLimit  : 300
% 0.17/0.43  % DateTime : Sun Sep 27 15:22:07 UTC 2026
% 0.17/0.43  % CPUTime  : 
% 0.17/0.43  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.21/0.48  Running first-order model finding
% 0.21/0.48  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.41/0.75  % (3657694)Will run a generic schedule for satisfiability detection.
% 1.41/0.75  % (3657702)dis+10_1_sil=32000:sp=arity:random_seed=1333957379:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 1.41/0.75  % (3657700)% WARNING: option uhcvi not known.
% 1.41/0.75  % (3657700)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2878652947:i=135531:add=off:rawr=on_3000 on theBenchmark for (3000ds/135531Mi)
% 1.41/0.75  % (3657699)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2115576651_3000 on theBenchmark for (3000ds/0Mi)
% 1.41/0.75  % (3657703)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=83185674:i=116_3000 on theBenchmark for (3000ds/116Mi)
% 1.41/0.75  % (3657701)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3770490864:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 1.41/0.75  % (3657705)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3166169523:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_3000 on theBenchmark for (3000ds/159Mi)
% 1.41/0.75  % (3657704)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=605845978:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 1.41/0.75  % TRYING [1]
% 1.41/0.75  % TRYING [2]
% 1.41/0.75  % TRYING [3]
% 1.41/0.75  % TRYING [4]
% 1.41/0.75  % (3657702)Instruction limit reached! 
% 1.41/0.75  % (3657702)------------------------------
% 1.41/0.75  % (3657702)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.41/0.75  % (3657702)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.41/0.75  % (3657702)CaDiCaL version: 2.1.3
% 1.41/0.75  % (3657702)Termination reason: Instruction limit
% 1.41/0.75  % (3657702)Termination phase: Saturation
% 1.41/0.75  % (3657702)Time elapsed: 0.066 s
% 1.41/0.75  % (3657702)Peak memory usage: 12 MB
% 1.41/0.75  % (3657702)Instructions burned: 104 (million)
% 1.41/0.75  % (3657713)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2054031056:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.41/0.75  % TRYING [1]
% 1.41/0.75  % TRYING [2]
% 1.41/0.75  % TRYING [3]
% 1.41/0.75  % TRYING [4]
% 1.41/0.75  % (3657703)Instruction limit reached! 
% 1.41/0.75  % (3657703)------------------------------
% 1.41/0.75  % (3657703)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.41/0.75  % (3657703)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.41/0.75  % (3657703)CaDiCaL version: 2.1.3
% 1.41/0.75  % (3657703)Termination reason: Instruction limit
% 1.41/0.75  % (3657703)Termination phase: Saturation
% 1.41/0.75  % (3657703)Time elapsed: 0.114 s
% 1.41/0.75  % (3657703)Peak memory usage: 11 MB
% 1.41/0.75  % (3657703)Instructions burned: 116 (million)
% 1.41/0.75  % (3657704)Instruction limit reached! 
% 1.41/0.75  % (3657704)------------------------------
% 1.41/0.75  % (3657704)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.41/0.75  % (3657704)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.41/0.75  % (3657704)CaDiCaL version: 2.1.3
% 1.41/0.75  % (3657704)Termination reason: Instruction limit
% 1.41/0.75  % (3657704)Termination phase: Saturation
% 1.41/0.75  % (3657704)Time elapsed: 0.128 s
% 1.41/0.75  % (3657704)Peak memory usage: 13 MB
% 1.41/0.75  % (3657704)Instructions burned: 132 (million)
% 1.41/0.75  % (3657715)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=825392978:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 1.41/0.75  % (3657716)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=399142141:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.41/0.75  % TRYING [5]
% 1.41/0.75  % (3657705)Instruction limit reached! 
% 1.41/0.75  % (3657705)------------------------------
% 1.41/0.75  % (3657705)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.41/0.75  % (3657705)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.41/0.75  % (3657705)CaDiCaL version: 2.1.3
% 1.41/0.75  % (3657705)Termination reason: Instruction limit
% 1.41/0.75  % (3657705)Termination phase: Saturation
% 1.41/0.75  % (3657705)Time elapsed: 0.159 s
% 1.41/0.75  % (3657705)Peak memory usage: 12 MB
% 1.41/0.75  % (3657705)Instructions burned: 159 (million)
% 1.41/0.75  % TRYING [5]
% 1.41/0.75  % (3657719)ott-21_1_sil=16000:fs=off:random_seed=534538857:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.41/0.75  % (3657716) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3657694-3657716"...
% 1.41/0.75  % (3657716)...printing done.
% 1.41/0.75  % (3657716)Refutation found. Thanks to Tanya!
% 1.41/0.75  % SZS status Unsatisfiable for theBenchmark
% 1.41/0.75  % SZS output start Proof for theBenchmark
% See solution above
% 1.41/0.75  % (3657716)------------------------------
% 1.41/0.75  % (3657716)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.41/0.75  % (3657716)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.41/0.75  % (3657716)CaDiCaL version: 2.1.3
% 1.41/0.75  % (3657716)Termination reason: Refutation
% 1.41/0.75  % (3657716)Time elapsed: 0.073 s
% 1.41/0.75  % (3657716)Peak memory usage: 13 MB
% 1.41/0.75  % (3657716)Instructions burned: 82 (million)
% 1.41/0.75  % (3657694)Success in time 0.263 s
% 1.41/0.75  % Vampire exiting
%------------------------------------------------------------------------------