↑ 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  : KLE021+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/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:40:39 AM UTC 2026

% Result   : Theorem 0.16s 0.47s
% Output   : Refutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   27 (  12 unt;   0 def)
%            Number of atoms       :   62 (  37 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   59 (  24   ~;  18   |;  11   &)
%                                         (   3 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   37 (  35   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] : addition(X0,X1) = addition(X1,X0),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_commutativity) ).

fof(f7,axiom,
    ! [X0] : multiplication(one,X0) = X0,
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',multiplicative_left_identity) ).

fof(f9,axiom,
    ! [X0,X1,X2] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',left_distributivity) ).

fof(f14,axiom,
    ! [X0,X1] :
      ( complement(X1,X0)
    <=> ( multiplication(X0,X1) = zero
        & multiplication(X1,X0) = zero
        & addition(X0,X1) = one ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+1.ax',test_2) ).

fof(f15,axiom,
    ! [X0,X1] :
      ( test(X0)
     => ( c(X0) = X1
      <=> complement(X0,X1) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+1.ax',test_3) ).

fof(f17,conjecture,
    ! [X0,X1] :
      ( test(X1)
     => X0 = addition(multiplication(X1,X0),multiplication(c(X1),X0)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

fof(f18,negated_conjecture,
    ~ ! [X0,X1] :
        ( test(X1)
       => X0 = addition(multiplication(X1,X0),multiplication(c(X1),X0)) ),
    inference(negated_conjecture,[status(cth)],[f17]) ).

fof(f19,plain,
    ! [X0,X1] :
      ( ( c(X0) = X1
      <=> complement(X0,X1) )
      | ~ test(X0) ),
    inference(ennf_transformation,[],[f15]) ).

fof(f21,plain,
    ? [X0,X1] :
      ( addition(multiplication(X1,X0),multiplication(c(X1),X0)) != X0
      & test(X1) ),
    inference(ennf_transformation,[],[f18]) ).

fof(f25,plain,
    ! [X0,X1] :
      ( ( complement(X1,X0)
        | zero != multiplication(X0,X1)
        | zero != multiplication(X1,X0)
        | addition(X0,X1) != one )
      & ( ( multiplication(X0,X1) = zero
          & multiplication(X1,X0) = zero
          & addition(X0,X1) = one )
        | ~ complement(X1,X0) ) ),
    inference(nnf_transformation,[],[f14]) ).

fof(f26,plain,
    ! [X0,X1] :
      ( ( complement(X1,X0)
        | zero != multiplication(X0,X1)
        | zero != multiplication(X1,X0)
        | addition(X0,X1) != one )
      & ( ( multiplication(X0,X1) = zero
          & multiplication(X1,X0) = zero
          & addition(X0,X1) = one )
        | ~ complement(X1,X0) ) ),
    inference(flattening,[],[f25]) ).

fof(f27,plain,
    ! [X0,X1] :
      ( ( ( c(X0) = X1
          | ~ complement(X0,X1) )
        & ( complement(X0,X1)
          | c(X0) != X1 ) )
      | ~ test(X0) ),
    inference(nnf_transformation,[],[f19]) ).

fof(f28,plain,
    ( sK1 != addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1))
    & test(sK2) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2]),skolemize(X0,sK1),skolemize(X1,sK2)],[f21]) ).

fof(f29,plain,
    ! [X0,X1] : addition(X0,X1) = addition(X1,X0),
    inference(cnf_transformation,[],[f1]) ).

fof(f35,plain,
    ! [X0] : multiplication(one,X0) = X0,
    inference(cnf_transformation,[],[f7]) ).

fof(f37,plain,
    ! [X2,X0,X1] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
    inference(cnf_transformation,[],[f9]) ).

fof(f42,plain,
    ! [X0,X1] :
      ( ~ complement(X1,X0)
      | addition(X0,X1) = one ),
    inference(cnf_transformation,[],[f26]) ).

fof(f46,plain,
    ! [X0,X1] :
      ( complement(X0,X1)
      | c(X0) != X1
      | ~ test(X0) ),
    inference(cnf_transformation,[],[f27]) ).

fof(f49,plain,
    test(sK2),
    inference(cnf_transformation,[],[f28]) ).

fof(f50,plain,
    sK1 != addition(multiplication(sK2,sK1),multiplication(c(sK2),sK1)),
    inference(cnf_transformation,[],[f28]) ).

fof(f51,plain,
    ! [X0] :
      ( complement(X0,c(X0))
      | ~ test(X0) ),
    inference(equality_resolution,[],[f46]) ).

fof(f63,plain,
    ! [X0] :
      ( one = addition(c(X0),X0)
      | ~ test(X0) ),
    inference(resolution,[],[f42,f51]) ).

fof(f64,plain,
    ! [X0] :
      ( ~ test(X0)
      | one = addition(X0,c(X0)) ),
    inference(forward_demodulation,[],[f63,f29]) ).

fof(f163,plain,
    sK1 != multiplication(addition(sK2,c(sK2)),sK1),
    inference(superposition,[],[f50,f37]) ).

fof(f223,plain,
    one = addition(sK2,c(sK2)),
    inference(resolution,[],[f64,f49]) ).

fof(f226,plain,
    sK1 != multiplication(one,sK1),
    inference(superposition,[],[f163,f223]) ).

fof(f230,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f226,f35]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : KLE021+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.39  % Computer : n011.cluster.edu
% 0.10/0.39  % Model    : x86_64 x86_64
% 0.10/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.39  % Memory   : 8046.5625MB
% 0.10/0.39  % OS       : Linux 6.8.0-71-generic
% 0.10/0.39  % CPULimit : 300
% 0.10/0.39  % WCLimit  : 300
% 0.10/0.39  % DateTime : Sun Sep 27 12:59:00 UTC 2026
% 0.10/0.39  % CPUTime  : 
% 0.10/0.39  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.42  Running first-order model finding
% 0.10/0.42  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.16/0.47  % (2382796)Will run a generic schedule for satisfiability detection.
% 0.16/0.47  % (2382804)dis+10_1_sil=32000:sp=arity:random_seed=448012588:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/0.47  % (2382802)% WARNING: option uhcvi not known.
% 0.16/0.47  % (2382804) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2382796-2382804"...
% 0.16/0.47  % (2382804)...printing done.
% 0.16/0.47  % (2382804)Refutation found. Thanks to Tanya!
% 0.16/0.47  % SZS status Theorem for theBenchmark
% 0.16/0.47  % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.47  % (2382804)------------------------------
% 0.16/0.47  % (2382804)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.47  % (2382804)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.47  % (2382804)CaDiCaL version: 2.1.3
% 0.16/0.47  % (2382804)Termination reason: Refutation
% 0.16/0.47  % (2382804)Time elapsed: 0.004 s
% 0.16/0.47  % (2382804)Peak memory usage: 12 MB
% 0.16/0.47  % (2382804)Instructions burned: 9 (million)
% 0.16/0.47  % (2382796)Success in time 0.038 s
% 0.16/0.47  % Vampire exiting
%------------------------------------------------------------------------------