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

% Computer : n015.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:58:00 AM UTC 2026

% Result   : Unsatisfiable 0.29s 0.62s
% Output   : Refutation 0.29s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   39 (  28 unt;   1 def)
%            Number of atoms       :   52 (   1 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   30 (  17   ~;  12   |;   0   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    5 (   3 usr;   2 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   58 (   0 sgn  58   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0] : axiom(implies(or(X0,X0),X0)),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).

fof(f2,axiom,
    ! [X0,X1] : axiom(implies(X0,or(X1,X0))),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).

fof(f3,axiom,
    ! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_4) ).

fof(f4,axiom,
    ! [X2,X0,X1] : axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_5) ).

fof(f5,axiom,
    ! [X2,X0,X1] : axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).

fof(f6,axiom,
    ! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',implies_definition) ).

fof(f7,axiom,
    ! [X0] :
      ( ~ axiom(X0)
      | theorem(X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_1) ).

fof(f8,axiom,
    ! [X0,X1] :
      ( theorem(X0)
      | ~ theorem(implies(X1,X0))
      | ~ theorem(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_2) ).

fof(f9,negated_conjecture,
    ~ theorem(implies(implies(not(p),q),or(p,q))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

fof(f10,plain,
    ! [X0] : axiom(or(not(or(X0,X0)),X0)),
    inference(definition_unfolding,[],[f1,f6]) ).

fof(f11,plain,
    ! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
    inference(definition_unfolding,[],[f2,f6]) ).

fof(f12,plain,
    ! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
    inference(definition_unfolding,[],[f3,f6]) ).

fof(f13,plain,
    ! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
    inference(definition_unfolding,[],[f4,f6]) ).

fof(f14,plain,
    ! [X2,X0,X1] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
    inference(definition_unfolding,[],[f5,f6,f6,f6]) ).

fof(f15,plain,
    ! [X0,X1] :
      ( ~ theorem(or(not(X1),X0))
      | theorem(X0)
      | ~ theorem(X1) ),
    inference(definition_unfolding,[],[f8,f6]) ).

fof(f16,plain,
    ~ theorem(or(not(or(not(not(p)),q)),or(p,q))),
    inference(definition_unfolding,[],[f9,f6,f6]) ).

fof(f17,plain,
    ! [X0] : theorem(or(not(or(X0,X0)),X0)),
    inference(resolution,[],[f10,f7]) ).

fof(f18,plain,
    ! [X0,X1] : theorem(or(not(X0),or(X1,X0))),
    inference(resolution,[],[f11,f7]) ).

fof(f19,plain,
    ! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
    inference(resolution,[],[f12,f7]) ).

fof(f20,plain,
    ! [X0] :
      ( ~ theorem(or(X0,X0))
      | theorem(X0) ),
    inference(resolution,[],[f15,f17]) ).

fof(f22,plain,
    ! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
    inference(resolution,[],[f13,f7]) ).

fof(f26,plain,
    ! [X2,X0,X1] : theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
    inference(resolution,[],[f14,f7]) ).

fof(f28,plain,
    ! [X0,X1] :
      ( ~ theorem(or(X1,X0))
      | theorem(or(X0,X1)) ),
    inference(resolution,[],[f19,f15]) ).

fof(f29,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(X1,or(X0,X2)))
      | theorem(or(X0,or(X1,X2))) ),
    inference(resolution,[],[f22,f15]) ).

fof(f52,plain,
    ! [X2,X0,X1] : theorem(or(not(or(X0,X1)),or(not(or(not(X1),X2)),or(X0,X2)))),
    inference(resolution,[],[f29,f26]) ).

fof(f53,plain,
    ! [X0,X1] : theorem(or(X0,or(not(X1),X1))),
    inference(resolution,[],[f29,f18]) ).

fof(f64,plain,
    ! [X0] : theorem(or(not(X0),X0)),
    inference(resolution,[],[f53,f20]) ).

fof(f70,definition,
    ( spl0_4
  <=> ! [X0] : theorem(or(not(X0),X0)) ),
    introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).

fof(f71,plain,
    ( ! [X0] : theorem(or(not(X0),X0))
    | ~ spl0_4 ),
    inference(avatar_component_clause,[],[f70]) ).

fof(f98,plain,
    spl0_4,
    inference(avatar_split_clause,[],[f64,f70]) ).

fof(f108,plain,
    ( ! [X0] : theorem(or(X0,not(X0)))
    | ~ spl0_4 ),
    inference(resolution,[],[f71,f28]) ).

fof(f155,plain,
    ! [X2,X0,X1] :
      ( theorem(or(not(or(not(X0),X1)),or(X2,X1)))
      | ~ theorem(or(X2,X0)) ),
    inference(resolution,[],[f52,f15]) ).

fof(f449,plain,
    ~ theorem(or(p,not(p))),
    inference(resolution,[],[f155,f16]) ).

fof(f458,plain,
    ( $false
    | ~ spl0_4 ),
    inference(forward_subsumption_resolution,[],[f449,f108]) ).

fof(f459,plain,
    ~ spl0_4,
    inference(avatar_contradiction_clause,[],[f458]) ).

cnf(s12,plain,
    spl0_4,
    inference(sat_conversion,[],[f98]) ).

cnf(s25,plain,
    ~ spl0_4,
    inference(sat_conversion,[],[f459]) ).

cnf(s31,plain,
    $false,
    inference(rat,[],[s12,s25]) ).

fof(f460,plain,
    $false,
    inference(avatar_sat_refutation,[],[s31]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : LCL209-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.09  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.21/0.48  % Computer : n015.cluster.edu
% 0.21/0.48  % Model    : x86_64 x86_64
% 0.21/0.48  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.48  % Memory   : 8046.5625MB
% 0.21/0.48  % OS       : Linux 6.8.0-71-generic
% 0.21/0.48  % CPULimit : 300
% 0.21/0.48  % WCLimit  : 300
% 0.21/0.48  % DateTime : Sun Sep 27 15:30:16 UTC 2026
% 0.21/0.48  % CPUTime  : 
% 0.21/0.49  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.25/0.54  Running first-order model finding
% 0.25/0.54  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.29/0.62  % (1786517)Will run a generic schedule for satisfiability detection.
% 0.29/0.62  % (1786526)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2565946450:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.29/0.62  % (1786523)% WARNING: option uhcvi not known.
% 0.29/0.62  % (1786523)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2361896671:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.29/0.62  % (1786525)dis+10_1_sil=32000:sp=arity:random_seed=1171657343:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.29/0.62  % (1786522)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3305239181_2999 on theBenchmark for (2999ds/0Mi)
% 0.29/0.62  % (1786528)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2928362359:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.29/0.62  % (1786527)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3084751379:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.29/0.62  % (1786524)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3502842258:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.29/0.62  % TRYING [1]
% 0.29/0.62  % TRYING [2]
% 0.29/0.62  % TRYING [3]
% 0.29/0.62  % (1786525) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1786517-1786525"...
% 0.29/0.62  % (1786525)...printing done.
% 0.29/0.62  % (1786525)Refutation found. Thanks to Tanya!
% 0.29/0.62  % SZS status Unsatisfiable for theBenchmark
% 0.29/0.62  % SZS output start Proof for theBenchmark
% See solution above
% 0.29/0.62  % (1786525)------------------------------
% 0.29/0.62  % (1786525)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.29/0.62  % (1786525)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.29/0.62  % (1786525)CaDiCaL version: 2.1.3
% 0.29/0.62  % (1786525)Termination reason: Refutation
% 0.29/0.62  % (1786525)Time elapsed: 0.014 s
% 0.29/0.62  % (1786525)Peak memory usage: 12 MB
% 0.29/0.62  % (1786525)Instructions burned: 12 (million)
% 0.29/0.62  % (1786517)Success in time 0.067 s
% 0.29/0.62  % Vampire exiting
%------------------------------------------------------------------------------