↑ Up

Vampire-SAT---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : LCL414+1 : TPTP v9.3.1. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT

% Computer : n019.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:35 AM UTC 2026

% Result   : Theorem 0.11s 0.45s
% Output   : Refutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   13 (   5 unt;   0 def)
%            Number of atoms       :   43 (   0 equ)
%            Maximal formula atoms :    7 (   3 avg)
%            Number of connectives :   55 (  25   ~;  14   |;  16   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   6 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-2 aty)
%            Number of variables   :   56 (  52   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ~ ( ! [X0,X1] :
          ( ~ a_truth(implies(X0,X1))
          | ~ a_truth(X0)
          | a_truth(X1) )
      & ! [X0,X1] : a_truth(implies(X0,implies(X1,X0)))
      & ! [X0,X1,X2] : a_truth(implies(implies(X0,implies(X1,X2)),implies(implies(X0,X1),implies(X0,X2))))
      & ! [X0,X1] : a_truth(implies(implies(not(X0),not(X1)),implies(X1,X0)))
      & ? [X3] : ~ a_truth(implies(X3,X3)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm147) ).

fof(f2,negated_conjecture,
    ~ ~ ( ! [X0,X1] :
            ( ~ a_truth(implies(X0,X1))
            | ~ a_truth(X0)
            | a_truth(X1) )
        & ! [X0,X1] : a_truth(implies(X0,implies(X1,X0)))
        & ! [X0,X1,X2] : a_truth(implies(implies(X0,implies(X1,X2)),implies(implies(X0,X1),implies(X0,X2))))
        & ! [X0,X1] : a_truth(implies(implies(not(X0),not(X1)),implies(X1,X0)))
        & ? [X3] : ~ a_truth(implies(X3,X3)) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

fof(f3,plain,
    ~ ~ ( ! [X0,X1] :
            ( ~ a_truth(implies(X0,X1))
            | ~ a_truth(X0)
            | a_truth(X1) )
        & ! [X2,X3] : a_truth(implies(X2,implies(X3,X2)))
        & ! [X4,X5,X6] : a_truth(implies(implies(X4,implies(X5,X6)),implies(implies(X4,X5),implies(X4,X6))))
        & ! [X7,X8] : a_truth(implies(implies(not(X7),not(X8)),implies(X8,X7)))
        & ? [X9] : ~ a_truth(implies(X9,X9)) ),
    inference(rectify,[],[f2]) ).

fof(f4,plain,
    ( ! [X0,X1] :
        ( ~ a_truth(implies(X0,X1))
        | ~ a_truth(X0)
        | a_truth(X1) )
    & ! [X2,X3] : a_truth(implies(X2,implies(X3,X2)))
    & ! [X4,X5,X6] : a_truth(implies(implies(X4,implies(X5,X6)),implies(implies(X4,X5),implies(X4,X6))))
    & ! [X7,X8] : a_truth(implies(implies(not(X7),not(X8)),implies(X8,X7)))
    & ? [X9] : ~ a_truth(implies(X9,X9)) ),
    inference(flattening,[],[f3]) ).

fof(f5,plain,
    ! [X0,X1] :
      ( ~ a_truth(implies(X0,X1))
      | ~ a_truth(X0)
      | a_truth(X1) ),
    inference(cnf_transformation,[],[f4]) ).

fof(f6,plain,
    ~ a_truth(implies(sK0,sK0)),
    inference(cnf_transformation,[],[f4]) ).

fof(f8,plain,
    ! [X6,X4,X5] : a_truth(implies(implies(X4,implies(X5,X6)),implies(implies(X4,X5),implies(X4,X6)))),
    inference(cnf_transformation,[],[f4]) ).

fof(f9,plain,
    ! [X2,X3] : a_truth(implies(X2,implies(X3,X2))),
    inference(cnf_transformation,[],[f4]) ).

fof(f14,plain,
    ! [X2,X0,X1] :
      ( a_truth(implies(implies(X0,X1),implies(X0,X2)))
      | ~ a_truth(implies(X0,implies(X1,X2))) ),
    inference(resolution,[],[f8,f5]) ).

fof(f26,plain,
    ! [X2,X0,X1] :
      ( ~ a_truth(implies(X0,implies(X1,X2)))
      | ~ a_truth(implies(X0,X1))
      | a_truth(implies(X0,X2)) ),
    inference(resolution,[],[f14,f5]) ).

fof(f27,plain,
    ! [X0,X1] :
      ( ~ a_truth(implies(X0,X1))
      | a_truth(implies(X0,X0)) ),
    inference(resolution,[],[f26,f9]) ).

fof(f59,plain,
    ! [X0] : ~ a_truth(implies(sK0,X0)),
    inference(resolution,[],[f27,f6]) ).

fof(f72,plain,
    $false,
    inference(resolution,[],[f59,f9]) ).

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