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

% Computer : n017.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:53 AM UTC 2026

% Result   : Unsatisfiable 0.18s 0.46s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   23 (  12 unt;   0 def)
%            Number of atoms       :   44 (   1 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   49 (  28   ~;  21   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   37 (  37   !;   0   ?)

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

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

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

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

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

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

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

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(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(X0)
      | ~ theorem(or(not(X1),X0))
      | ~ theorem(X1) ),
    inference(definition_unfolding,[],[f8,f6]) ).

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

fof(f17,plain,
    ! [X0] :
      ( ~ theorem(X0)
      | ~ axiom(X0) ),
    inference(consistent_polarity_flipping,[],[f7]) ).

fof(f18,plain,
    ! [X0,X1] :
      ( theorem(or(not(X1),X0))
      | ~ theorem(X0)
      | theorem(X1) ),
    inference(consistent_polarity_flipping,[],[f15]) ).

fof(f19,plain,
    theorem(or(not(p),or(p,q))),
    inference(consistent_polarity_flipping,[],[f16]) ).

fof(f21,plain,
    ! [X0,X1] :
      ( theorem(X1)
      | ~ theorem(X0)
      | ~ axiom(or(not(X1),X0)) ),
    inference(resolution,[],[f18,f17]) ).

fof(f22,plain,
    ! [X0,X1] :
      ( ~ theorem(X0)
      | ~ axiom(or(not(X1),X0))
      | ~ axiom(X1) ),
    inference(resolution,[],[f21,f17]) ).

fof(f24,plain,
    ! [X2,X0,X1] :
      ( theorem(X1)
      | ~ axiom(X0)
      | ~ theorem(X2)
      | ~ axiom(or(not(X0),or(not(X1),X2))) ),
    inference(resolution,[],[f22,f18]) ).

fof(f31,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(X1)
      | ~ axiom(X0)
      | ~ axiom(or(not(X0),or(not(X2),X1)))
      | ~ axiom(X2) ),
    inference(resolution,[],[f24,f17]) ).

fof(f68,plain,
    ! [X0,X1] :
      ( ~ axiom(or(not(X0),or(not(X1),or(not(p),or(p,q)))))
      | ~ axiom(X0)
      | ~ axiom(X1) ),
    inference(resolution,[],[f31,f19]) ).

fof(f75,plain,
    ! [X0] :
      ( ~ axiom(or(not(X0),or(p,q)))
      | ~ axiom(or(not(p),X0)) ),
    inference(resolution,[],[f68,f14]) ).

fof(f77,plain,
    ~ axiom(or(not(p),or(q,p))),
    inference(resolution,[],[f75,f12]) ).

fof(f80,plain,
    $false,
    inference(resolution,[],[f77,f11]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL185-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.39  % Computer : n017.cluster.edu
% 0.12/0.39  % Model    : x86_64 x86_64
% 0.12/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39  % Memory   : 8046.5625MB
% 0.12/0.39  % OS       : Linux 6.8.0-71-generic
% 0.12/0.39  % CPULimit : 300
% 0.12/0.39  % WCLimit  : 300
% 0.12/0.39  % DateTime : Sun Sep 27 15:20:50 UTC 2026
% 0.12/0.39  % CPUTime  : 
% 0.12/0.39  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.42  Running first-order model finding
% 0.12/0.42  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
% 0.18/0.46  % (2724172)Will run a generic schedule for satisfiability detection.
% 0.18/0.46  % (2724177)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3152271580_3000 on theBenchmark for (3000ds/0Mi)
% 0.18/0.46  % TRYING [1]
% 0.18/0.46  % TRYING [2]
% 0.18/0.46  % TRYING [3]
% 0.18/0.46  % (2724178)% WARNING: option uhcvi not known.
% 0.18/0.46  % TRYING [4]
% 0.18/0.46  % (2724178)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3046031987:i=135531:add=off:rawr=on_3000 on theBenchmark for (3000ds/135531Mi)
% 0.18/0.46  % (2724180)dis+10_1_sil=32000:sp=arity:random_seed=2102856027:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 0.18/0.46  % (2724179)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2150444106:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 0.18/0.46  % (2724181)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3584415091:i=116_3000 on theBenchmark for (3000ds/116Mi)
% 0.18/0.46  % (2724182)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=128393255:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 0.18/0.46  % (2724183)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2090763230:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_3000 on theBenchmark for (3000ds/159Mi)
% 0.18/0.46  % (2724183) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2724172-2724183"...
% 0.18/0.46  % (2724183)...printing done.
% 0.18/0.46  % (2724183)Refutation found. Thanks to Tanya!
% 0.18/0.46  % SZS status Unsatisfiable for theBenchmark
% 0.18/0.46  % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.46  % (2724183)------------------------------
% 0.18/0.46  % (2724183)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.46  % (2724183)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.46  % (2724183)CaDiCaL version: 2.1.3
% 0.18/0.46  % (2724183)Termination reason: Refutation
% 0.18/0.46  % (2724183)Time elapsed: 0.003 s
% 0.18/0.46  % (2724183)Peak memory usage: 11 MB
% 0.18/0.46  % (2724183)Instructions burned: 3 (million)
% 0.18/0.46  % (2724172)Success in time 0.028 s
% 0.18/0.46  % Vampire exiting
%------------------------------------------------------------------------------