↑ 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  : LCL041-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 : n001.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:29 AM UTC 2026

% Result   : Unsatisfiable 0.14s 0.42s
% Output   : Refutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   11 (   8 unt;   0 def)
%            Number of atoms       :   15 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   10 (   6   ~;   4   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   18 (  18   !;   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,
    ! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_3) ).

fof(f4,axiom,
    ! [X2,X0,X1] : is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(X1,implies(X0,X2)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_21) ).

fof(f6,axiom,
    ! [X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(not(X0),X1),X1))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_54) ).

fof(f7,negated_conjecture,
    ~ is_a_theorem(implies(implies(a,implies(a,b)),implies(a,b))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_30) ).

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

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

fof(f28,plain,
    ! [X0,X1] : is_a_theorem(implies(implies(not(X0),X1),implies(implies(X0,X1),X1))),
    inference(resolution,[],[f14,f6]) ).

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

fof(f213,plain,
    ~ is_a_theorem(implies(not(a),implies(a,b))),
    inference(resolution,[],[f71,f7]) ).

fof(f221,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f213,f26]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL041-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.09/0.34  % Computer : n001.cluster.edu
% 0.09/0.34  % Model    : x86_64 x86_64
% 0.09/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.34  % Memory   : 8046.5625MB
% 0.09/0.34  % OS       : Linux 6.8.0-71-generic
% 0.09/0.34  % CPULimit : 300
% 0.09/0.34  % WCLimit  : 300
% 0.09/0.34  % DateTime : Sun Sep 27 15:24:31 UTC 2026
% 0.09/0.34  % CPUTime  : 
% 0.09/0.34  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.14/0.37  Running first-order model finding
% 0.14/0.38  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.14/0.42  % (3700263)Will run a generic schedule for satisfiability detection.
% 0.14/0.42  % (3700271)dis+10_1_sil=32000:sp=arity:random_seed=96595807:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.14/0.42  % (3700271) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3700263-3700271"...
% 0.14/0.42  % (3700269)% WARNING: option uhcvi not known.
% 0.14/0.42  % (3700271)...printing done.
% 0.14/0.42  % (3700271)Refutation found. Thanks to Tanya!
% 0.14/0.42  % SZS status Unsatisfiable for theBenchmark
% 0.14/0.42  % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.42  % (3700271)------------------------------
% 0.14/0.42  % (3700271)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.14/0.42  % (3700271)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.14/0.42  % (3700271)CaDiCaL version: 2.1.3
% 0.14/0.42  % (3700271)Termination reason: Refutation
% 0.14/0.42  % (3700271)Time elapsed: 0.003 s
% 0.14/0.42  % (3700271)Peak memory usage: 11 MB
% 0.14/0.42  % (3700271)Instructions burned: 6 (million)
% 0.14/0.42  % (3700263)Success in time 0.035 s
% 0.14/0.42  % Vampire exiting
%------------------------------------------------------------------------------