↑ 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  : LCL321-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 : 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:58:21 AM UTC 2026

% Result   : Unsatisfiable 0.23s 0.53s
% Output   : Refutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   22 (  15 unt;   0 def)
%            Number of atoms       :   31 (   1 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   21 (  12   ~;   9   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   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   :   40 (  40   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
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(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(or(implies(p,q),implies(p,not(q)))),
    file('/export/starexec/sandbox/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(f13,plain,
    ! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
    inference(definition_unfolding,[],[f4,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(or(not(p),q),or(not(p),not(q)))),
    inference(definition_unfolding,[],[f9,f6,f6]) ).

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(f21,plain,
    ! [X0,X1] :
      ( theorem(or(X0,X1))
      | ~ theorem(X1) ),
    inference(resolution,[],[f15,f18]) ).

fof(f22,plain,
    ! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
    inference(resolution,[],[f13,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(f33,plain,
    ! [X0,X1] : theorem(or(or(X0,X1),not(X1))),
    inference(resolution,[],[f28,f18]) ).

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

fof(f102,plain,
    ~ theorem(or(or(not(p),q),not(q))),
    inference(resolution,[],[f55,f16]) ).

fof(f107,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f102,f33]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : LCL321-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.08  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.18/0.42  % Computer : n003.cluster.edu
% 0.18/0.42  % Model    : x86_64 x86_64
% 0.18/0.42  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.42  % Memory   : 8046.5625MB
% 0.18/0.42  % OS       : Linux 6.8.0-71-generic
% 0.18/0.42  % CPULimit : 300
% 0.18/0.42  % WCLimit  : 300
% 0.18/0.42  % DateTime : Sun Sep 27 15:36:11 UTC 2026
% 0.18/0.42  % CPUTime  : 
% 0.18/0.42  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.23/0.47  Running first-order model finding
% 0.23/0.47  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.23/0.53  % (718554)Will run a generic schedule for satisfiability detection.
% 0.23/0.53  % (718559)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=891806128_2999 on theBenchmark for (2999ds/0Mi)
% 0.23/0.53  % TRYING [1]
% 0.23/0.53  % TRYING [2]
% 0.23/0.53  % TRYING [3]
% 0.23/0.53  % (718560)% WARNING: option uhcvi not known.
% 0.23/0.53  % (718560)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3119096375:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.23/0.53  % (718562)dis+10_1_sil=32000:sp=arity:random_seed=2832271954:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.23/0.53  % (718563)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3056509289:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.23/0.53  % (718565)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1309735107:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.23/0.53  % (718561)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3266169495:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.23/0.53  % (718564)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=406269179:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.23/0.53  % (718562) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-718554-718562"...
% 0.23/0.53  % (718565) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-718554-718565"...
% 0.23/0.53  % (718562)...printing done.
% 0.23/0.53  % TRYING [4]
% 0.23/0.53  % (718565)...printing done.
% 0.23/0.53  % (718562)Refutation found. Thanks to Tanya!
% 0.23/0.53  % SZS status Unsatisfiable for theBenchmark
% 0.23/0.53  % SZS output start Proof for theBenchmark
% See solution above
% 0.23/0.53  % (718562)------------------------------
% 0.23/0.53  % (718562)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.23/0.53  % (718562)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.23/0.53  % (718562)CaDiCaL version: 2.1.3
% 0.23/0.53  % (718562)Termination reason: Refutation
% 0.23/0.53  % (718562)Time elapsed: 0.004 s
% 0.23/0.53  % (718562)Peak memory usage: 11 MB
% 0.23/0.53  % (718562)Instructions burned: 2 (million)
% 0.23/0.53  % (718554)Success in time 0.041 s
% 0.23/0.53  % Vampire exiting
%------------------------------------------------------------------------------