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

% Computer : n014.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:36 AM UTC 2026

% Result   : Unsatisfiable 0.11s 0.45s
% Output   : Refutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   32 (  12 unt;   3 def)
%            Number of atoms       :   56 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   49 (  25   ~;  21   |;   0   &)
%                                         (   3 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    5 (   4 usr;   4 prp; 0-1 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   58 (   0 sgn  58   !;   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(a,implies(b,a))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ic_2) ).

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

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

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

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

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

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

fof(f21,plain,
    ! [X2,X3,X0,X1,X4,X5] :
      ( ~ is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(implies(X3,X1),implies(X4,X1))))
      | is_a_theorem(implies(X5,implies(implies(X3,X1),implies(X4,X1)))) ),
    inference(resolution,[],[f6,f1]) ).

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

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

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

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

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

fof(f77,plain,
    ( ! [X2,X3,X1] : is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X3,X1)))
    | ~ spl0_5 ),
    inference(avatar_component_clause,[],[f76]) ).

fof(f78,plain,
    ( spl0_5
    | spl0_2 ),
    inference(avatar_split_clause,[],[f71,f16,f76]) ).

fof(f79,plain,
    ( ! [X2,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(X2,X1))))
    | ~ spl0_5 ),
    inference(resolution,[],[f77,f7]) ).

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

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

fof(f95,plain,
    ( ! [X2,X1] : is_a_theorem(implies(X1,implies(X2,X1)))
    | ~ spl0_6 ),
    inference(avatar_component_clause,[],[f94]) ).

fof(f96,plain,
    ( spl0_6
    | spl0_2
    | ~ spl0_5 ),
    inference(avatar_split_clause,[],[f90,f76,f16,f94]) ).

fof(f101,plain,
    ( $false
    | ~ spl0_6 ),
    inference(resolution,[],[f95,f3]) ).

fof(f102,plain,
    ~ spl0_6,
    inference(avatar_contradiction_clause,[],[f101]) ).

cnf(s5,plain,
    ~ spl0_2,
    inference(sat_conversion,[],[f29]) ).

cnf(s8,plain,
    ( spl0_2
    | spl0_5 ),
    inference(sat_conversion,[],[f78]) ).

cnf(s9,plain,
    ( spl0_2
    | ~ spl0_5
    | spl0_6 ),
    inference(sat_conversion,[],[f96]) ).

cnf(s10,plain,
    ~ spl0_6,
    inference(sat_conversion,[],[f102]) ).

cnf(s11,plain,
    ( spl0_2
    | ~ spl0_5 ),
    inference(rat,[],[s9,s10]) ).

cnf(s12,plain,
    ~ spl0_5,
    inference(rat,[],[s11,s5]) ).

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

fof(f103,plain,
    $false,
    inference(avatar_sat_refutation,[],[s15]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL082-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37  % Computer : n014.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:01 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.38  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41  Running first-order model finding
% 0.11/0.41  Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.45  % (929008)Will run a generic schedule for satisfiability detection.
% 0.11/0.45  % (929017)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2883951985:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.11/0.45  % (929014)% WARNING: option uhcvi not known.
% 0.11/0.45  % (929014)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2163206733:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.11/0.45  % (929016)dis+10_1_sil=32000:sp=arity:random_seed=1577562130:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.11/0.45  % (929015)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2146824385:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.11/0.45  % (929018)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3077365144:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.11/0.45  % (929019)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=376779095:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.11/0.45  % (929016) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-929008-929016"...
% 0.11/0.45  % (929018) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-929008-929018"...
% 0.11/0.45  % (929016)...printing done.
% 0.11/0.45  % (929018)...printing done.
% 0.11/0.45  % (929016)Refutation found. Thanks to Tanya!
% 0.11/0.45  % SZS status Unsatisfiable for theBenchmark
% 0.11/0.45  % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.45  % (929016)------------------------------
% 0.11/0.45  % (929016)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.45  % (929016)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.45  % (929016)CaDiCaL version: 2.1.3
% 0.11/0.45  % (929016)Termination reason: Refutation
% 0.11/0.45  % (929016)Time elapsed: 0.003 s
% 0.11/0.45  % (929016)Peak memory usage: 11 MB
% 0.11/0.45  % (929016)Instructions burned: 3 (million)
% 0.11/0.45  % (929008)Success in time 0.038 s
% 0.11/0.45  % Vampire exiting
%------------------------------------------------------------------------------