↑ 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  : KLE025+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n013.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:41 AM UTC 2026

% Result   : Theorem 0.18s 0.48s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   38 (  22 unt;   0 def)
%            Number of atoms       :   84 (  53 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   70 (  24   ~;  18   |;  20   &)
%                                         (   3 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-2 aty)
%            Number of variables   :   55 (  49   !;   6   ?)

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

fof(f3,axiom,
    ! [X0] : addition(X0,zero) = X0,
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_identity) ).

fof(f5,axiom,
    ! [X0,X1,X2] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_associativity) ).

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

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

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

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

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

fof(f18,negated_conjecture,
    ~ ! [X0,X1,X2] :
        ( ( test(X1)
          & test(X2) )
       => ( multiplication(multiplication(X1,X0),c(X2)) = zero
         => multiplication(X1,X0) = multiplication(multiplication(X1,X0),X2) ) ),
    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,X2] :
      ( multiplication(X1,X0) != multiplication(multiplication(X1,X0),X2)
      & multiplication(multiplication(X1,X0),c(X2)) = zero
      & test(X1)
      & test(X2) ),
    inference(ennf_transformation,[],[f18]) ).

fof(f22,plain,
    ? [X0,X1,X2] :
      ( multiplication(X1,X0) != multiplication(multiplication(X1,X0),X2)
      & multiplication(multiplication(X1,X0),c(X2)) = zero
      & test(X1)
      & test(X2) ),
    inference(flattening,[],[f21]) ).

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(nnf_transformation,[],[f14]) ).

fof(f27,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,[],[f26]) ).

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

fof(f29,plain,
    ( multiplication(sK2,sK1) != multiplication(multiplication(sK2,sK1),sK3)
    & zero = multiplication(multiplication(sK2,sK1),c(sK3))
    & test(sK2)
    & test(sK3) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3]),skolemize(X0,sK1),skolemize(X1,sK2),skolemize(X2,sK3)],[f22]) ).

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

fof(f32,plain,
    ! [X0] : addition(X0,zero) = X0,
    inference(cnf_transformation,[],[f3]) ).

fof(f34,plain,
    ! [X2,X0,X1] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
    inference(cnf_transformation,[],[f5]) ).

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

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

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

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

fof(f50,plain,
    test(sK3),
    inference(cnf_transformation,[],[f29]) ).

fof(f52,plain,
    zero = multiplication(multiplication(sK2,sK1),c(sK3)),
    inference(cnf_transformation,[],[f29]) ).

fof(f53,plain,
    multiplication(sK2,sK1) != multiplication(multiplication(sK2,sK1),sK3),
    inference(cnf_transformation,[],[f29]) ).

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

fof(f66,plain,
    ! [X0] :
      ( one = addition(c(X0),X0)
      | ~ test(X0) ),
    inference(resolution,[],[f43,f54]) ).

fof(f67,plain,
    ! [X0] :
      ( ~ test(X0)
      | one = addition(X0,c(X0)) ),
    inference(forward_demodulation,[],[f66,f30]) ).

fof(f106,plain,
    multiplication(sK2,sK1) != multiplication(sK2,multiplication(sK1,sK3)),
    inference(superposition,[],[f53,f34]) ).

fof(f127,plain,
    ! [X0] : multiplication(multiplication(sK2,sK1),addition(X0,c(sK3))) = addition(multiplication(multiplication(sK2,sK1),X0),zero),
    inference(superposition,[],[f37,f52]) ).

fof(f139,plain,
    ! [X0] : multiplication(multiplication(sK2,sK1),X0) = multiplication(multiplication(sK2,sK1),addition(X0,c(sK3))),
    inference(forward_demodulation,[],[f127,f32]) ).

fof(f149,plain,
    ! [X0] : multiplication(multiplication(sK2,sK1),X0) = multiplication(sK2,multiplication(sK1,addition(X0,c(sK3)))),
    inference(forward_demodulation,[],[f139,f34]) ).

fof(f155,plain,
    ! [X0] : multiplication(sK2,multiplication(sK1,addition(X0,c(sK3)))) = multiplication(sK2,multiplication(sK1,X0)),
    inference(forward_demodulation,[],[f149,f34]) ).

fof(f392,plain,
    one = addition(sK3,c(sK3)),
    inference(resolution,[],[f67,f50]) ).

fof(f398,plain,
    multiplication(sK2,multiplication(sK1,sK3)) = multiplication(sK2,multiplication(sK1,one)),
    inference(superposition,[],[f155,f392]) ).

fof(f400,plain,
    multiplication(sK2,sK1) = multiplication(sK2,multiplication(sK1,sK3)),
    inference(forward_demodulation,[],[f398,f35]) ).

fof(f401,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f400,f106]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : KLE025+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.39  % Computer : n013.cluster.edu
% 0.13/0.39  % Model    : x86_64 x86_64
% 0.13/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39  % Memory   : 8046.5625MB
% 0.13/0.39  % OS       : Linux 6.8.0-71-generic
% 0.13/0.39  % CPULimit : 300
% 0.13/0.39  % WCLimit  : 300
% 0.13/0.39  % DateTime : Sun Sep 27 13:02:51 UTC 2026
% 0.13/0.40  % CPUTime  : 
% 0.13/0.40  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.43  Running first-order model finding
% 0.13/0.43  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.18/0.48  % (206907)Will run a generic schedule for satisfiability detection.
% 0.18/0.48  % (206917)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3691745263:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.48  % (206913)% WARNING: option uhcvi not known.
% 0.18/0.48  % (206913)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1334458760:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.48  % (206914)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1507418223:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.48  % (206912)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3403385624_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.48  % (206915)dis+10_1_sil=32000:sp=arity:random_seed=3067664613:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.48  % (206916)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=418102235:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.48  % (206918)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=970118469:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.48  % TRYING [1]
% 0.18/0.48  % TRYING [2]
% 0.18/0.48  % TRYING [3]
% 0.18/0.48  % TRYING [4]
% 0.18/0.48  % (206915) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-206907-206915"...
% 0.18/0.48  % (206916) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-206907-206916"...
% 0.18/0.48  % (206915)...printing done.
% 0.18/0.48  % (206916)...printing done.
% 0.18/0.48  % (206915)Refutation found. Thanks to Tanya!
% 0.18/0.48  % SZS status Theorem for theBenchmark
% 0.18/0.48  % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.48  % (206915)------------------------------
% 0.18/0.48  % (206915)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.48  % (206915)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.48  % (206915)CaDiCaL version: 2.1.3
% 0.18/0.48  % (206915)Termination reason: Refutation
% 0.18/0.48  % (206915)Time elapsed: 0.011 s
% 0.18/0.48  % (206915)Peak memory usage: 11 MB
% 0.18/0.48  % (206915)Instructions burned: 17 (million)
% 0.18/0.48  % (206907)Success in time 0.045 s
% 0.18/0.48  % Vampire exiting
%------------------------------------------------------------------------------