↑ 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  : LCL361-1 : 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 : n011.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:26 AM UTC 2026

% Result   : Unsatisfiable 0.24s 0.58s
% Output   : Refutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   11 (   6 unt;   0 def)
%            Number of atoms       :   18 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   19 (  12   ~;   7   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    6 (   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   :   15 (  15   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] :
      ( ~ is_a_theorem(implies(X0,X1))
      | ~ is_a_theorem(X0)
      | is_a_theorem(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).

fof(f2,axiom,
    ! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_1) ).

fof(f4,axiom,
    ! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_3) ).

fof(f5,negated_conjecture,
    ~ is_a_theorem(implies(x,implies(implies(implies(not(x),x),x),implies(implies(y,x),x)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_10) ).

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

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

fof(f31,plain,
    ! [X0] :
      ( ~ is_a_theorem(implies(X0,implies(implies(implies(not(x),x),x),implies(implies(y,x),x))))
      | ~ is_a_theorem(implies(x,X0)) ),
    inference(resolution,[],[f18,f5]) ).

fof(f36,plain,
    ~ is_a_theorem(implies(x,implies(implies(y,x),implies(not(x),x)))),
    inference(resolution,[],[f31,f2]) ).

fof(f52,plain,
    ! [X0] :
      ( ~ is_a_theorem(implies(X0,implies(implies(y,x),implies(not(x),x))))
      | ~ is_a_theorem(implies(x,X0)) ),
    inference(resolution,[],[f36,f18]) ).

fof(f120,plain,
    ~ is_a_theorem(implies(x,implies(not(x),y))),
    inference(resolution,[],[f52,f2]) ).

fof(f127,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f120,f4]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : LCL361-1 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.09  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.21/0.47  % Computer : n011.cluster.edu
% 0.21/0.47  % Model    : x86_64 x86_64
% 0.21/0.47  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.47  % Memory   : 8046.5625MB
% 0.21/0.47  % OS       : Linux 6.8.0-71-generic
% 0.21/0.47  % CPULimit : 300
% 0.21/0.47  % WCLimit  : 300
% 0.21/0.47  % DateTime : Sun Sep 27 15:36:30 UTC 2026
% 0.21/0.47  % CPUTime  : 
% 0.21/0.47  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.24/0.53  Running first-order model finding
% 0.24/0.53  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.24/0.58  % (2571526)Will run a generic schedule for satisfiability detection.
% 0.24/0.58  % (2571535)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4247328523:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.24/0.58  % (2571535) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2571526-2571535"...
% 0.24/0.58  % (2571535)...printing done.
% 0.24/0.58  % (2571535)Refutation found. Thanks to Tanya!
% 0.24/0.58  % SZS status Unsatisfiable for theBenchmark
% 0.24/0.58  % SZS output start Proof for theBenchmark
% See solution above
% 0.24/0.58  % (2571535)------------------------------
% 0.24/0.58  % (2571535)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.24/0.58  % (2571535)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.24/0.58  % (2571535)CaDiCaL version: 2.1.3
% 0.24/0.58  % (2571535)Termination reason: Refutation
% 0.24/0.58  % (2571535)Time elapsed: 0.003 s
% 0.24/0.58  % (2571535)Peak memory usage: 11 MB
% 0.24/0.58  % (2571535)Instructions burned: 4 (million)
% 0.24/0.58  % (2571526)Success in time 0.04 s
% 0.24/0.58  % Vampire exiting
%------------------------------------------------------------------------------