↑ 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  : LCL079-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 : n026.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:35 AM UTC 2026

% Result   : Unsatisfiable 0.10s 0.45s
% Output   : Refutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   13 (   7 unt;   0 def)
%            Number of atoms       :   22 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   21 (  12   ~;   9   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   19 (  19   !;   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(X1,X0))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_18) ).

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

fof(f5,axiom,
    is_a_theorem(implies(a,b)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_implies_b) ).

fof(f6,axiom,
    is_a_theorem(implies(b,c)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_implies_c) ).

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

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

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

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

fof(f62,plain,
    ! [X2,X0,X1] :
      ( ~ is_a_theorem(implies(X0,X1))
      | is_a_theorem(implies(X0,X2))
      | ~ is_a_theorem(implies(X1,X2)) ),
    inference(resolution,[],[f60,f10]) ).

fof(f120,plain,
    ! [X0] :
      ( ~ is_a_theorem(implies(a,X0))
      | ~ is_a_theorem(implies(X0,c)) ),
    inference(resolution,[],[f62,f7]) ).

fof(f145,plain,
    ~ is_a_theorem(implies(a,b)),
    inference(resolution,[],[f120,f6]) ).

fof(f146,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f145,f5]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL079-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.37  % Computer : n026.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Sun Sep 27 15:23:41 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.41  Running first-order model finding
% 0.10/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.10/0.45  % (2985281)Will run a generic schedule for satisfiability detection.
% 0.10/0.45  % (2985299)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1504565365:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.10/0.45  % (2985299) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2985281-2985299"...
% 0.10/0.45  % (2985299)...printing done.
% 0.10/0.45  % (2985296)% WARNING: option uhcvi not known.
% 0.10/0.45  % (2985299)Refutation found. Thanks to Tanya!
% 0.10/0.45  % SZS status Unsatisfiable for theBenchmark
% 0.10/0.45  % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.45  % (2985299)------------------------------
% 0.10/0.45  % (2985299)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.45  % (2985299)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.45  % (2985299)CaDiCaL version: 2.1.3
% 0.10/0.45  % (2985299)Termination reason: Refutation
% 0.10/0.45  % (2985299)Time elapsed: 0.002 s
% 0.10/0.45  % (2985299)Peak memory usage: 11 MB
% 0.10/0.45  % (2985299)Instructions burned: 4 (million)
% 0.10/0.45  % (2985281)Success in time 0.035 s
% 0.10/0.45  % Vampire exiting
%------------------------------------------------------------------------------