↑ 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  : KLE071+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 : n005.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:48 AM UTC 2026

% Result   : Theorem 0.17s 0.50s
% Output   : Refutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   41 (  41 unt;   0 def)
%            Number of atoms       :   41 (  40 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :   10 (  10   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   62 (  59   !;   3   ?)

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

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

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

fof(f7,axiom,
    ! [X0] : multiplication(one,X0) = X0,
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_left_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(f9,axiom,
    ! [X0,X1,X2] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',left_distributivity) ).

fof(f13,axiom,
    ! [X0] : addition(X0,multiplication(domain(X0),X0)) = multiplication(domain(X0),X0),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+5.ax',domain1) ).

fof(f14,axiom,
    ! [X0,X1] : domain(multiplication(X0,X1)) = domain(multiplication(X0,domain(X1))),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+5.ax',domain2) ).

fof(f15,axiom,
    ! [X0] : addition(domain(X0),one) = one,
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+5.ax',domain3) ).

fof(f18,conjecture,
    ! [X0,X1,X2] : addition(domain(X0),multiplication(domain(X1),domain(X2))) = multiplication(addition(domain(X0),domain(X1)),addition(domain(X0),domain(X2))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).

fof(f19,negated_conjecture,
    ~ ! [X0,X1,X2] : addition(domain(X0),multiplication(domain(X1),domain(X2))) = multiplication(addition(domain(X0),domain(X1)),addition(domain(X0),domain(X2))),
    inference(negated_conjecture,[status(cth)],[f18]) ).

fof(f20,plain,
    ? [X0,X1,X2] : addition(domain(X0),multiplication(domain(X1),domain(X2))) != multiplication(addition(domain(X0),domain(X1)),addition(domain(X0),domain(X2))),
    inference(ennf_transformation,[],[f19]) ).

fof(f21,plain,
    addition(domain(sK0),multiplication(domain(sK1),domain(sK2))) != multiplication(addition(domain(sK0),domain(sK1)),addition(domain(sK0),domain(sK2))),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f20]) ).

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

fof(f23,plain,
    ! [X2,X0,X1] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
    inference(cnf_transformation,[],[f2]) ).

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

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

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

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

fof(f33,plain,
    ! [X0] : multiplication(domain(X0),X0) = addition(X0,multiplication(domain(X0),X0)),
    inference(cnf_transformation,[],[f13]) ).

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

fof(f35,plain,
    ! [X0] : one = addition(domain(X0),one),
    inference(cnf_transformation,[],[f15]) ).

fof(f38,plain,
    addition(domain(sK0),multiplication(domain(sK1),domain(sK2))) != multiplication(addition(domain(sK0),domain(sK1)),addition(domain(sK0),domain(sK2))),
    inference(cnf_transformation,[],[f21]) ).

fof(f47,plain,
    ! [X0] : one = addition(one,domain(X0)),
    inference(superposition,[],[f35,f22]) ).

fof(f49,plain,
    ! [X0] : domain(multiplication(one,X0)) = domain(domain(X0)),
    inference(superposition,[],[f34,f28]) ).

fof(f52,plain,
    ! [X0] : domain(X0) = domain(domain(X0)),
    inference(forward_demodulation,[],[f49,f28]) ).

fof(f195,plain,
    ! [X0,X1] : multiplication(X0,one) = addition(multiplication(X0,one),multiplication(X0,domain(X1))),
    inference(superposition,[],[f29,f47]) ).

fof(f202,plain,
    addition(domain(sK0),multiplication(domain(sK1),domain(sK2))) != addition(multiplication(addition(domain(sK0),domain(sK1)),domain(sK0)),multiplication(addition(domain(sK0),domain(sK1)),domain(sK2))),
    inference(superposition,[],[f38,f29]) ).

fof(f211,plain,
    addition(domain(sK0),multiplication(domain(sK1),domain(sK2))) != addition(multiplication(addition(domain(sK0),domain(sK1)),domain(sK0)),addition(multiplication(domain(sK0),domain(sK2)),multiplication(domain(sK1),domain(sK2)))),
    inference(forward_demodulation,[],[f202,f30]) ).

fof(f218,plain,
    ! [X0,X1] : addition(X0,multiplication(X0,domain(X1))) = X0,
    inference(forward_demodulation,[],[f195,f27]) ).

fof(f226,plain,
    addition(domain(sK0),multiplication(domain(sK1),domain(sK2))) != addition(addition(multiplication(domain(sK0),domain(sK0)),multiplication(domain(sK1),domain(sK0))),addition(multiplication(domain(sK0),domain(sK2)),multiplication(domain(sK1),domain(sK2)))),
    inference(forward_demodulation,[],[f211,f30]) ).

fof(f236,plain,
    addition(domain(sK0),multiplication(domain(sK1),domain(sK2))) != addition(multiplication(domain(sK0),domain(sK0)),addition(multiplication(domain(sK1),domain(sK0)),addition(multiplication(domain(sK0),domain(sK2)),multiplication(domain(sK1),domain(sK2))))),
    inference(forward_demodulation,[],[f226,f23]) ).

fof(f255,plain,
    ! [X0,X1] : multiplication(one,X1) = addition(multiplication(one,X1),multiplication(domain(X0),X1)),
    inference(superposition,[],[f30,f47]) ).

fof(f278,plain,
    ! [X0,X1] : addition(X1,multiplication(domain(X0),X1)) = X1,
    inference(forward_demodulation,[],[f255,f28]) ).

fof(f425,plain,
    ! [X2,X0,X1] : addition(X0,X2) = addition(X0,addition(multiplication(X0,domain(X1)),X2)),
    inference(superposition,[],[f23,f218]) ).

fof(f500,plain,
    ! [X0] : multiplication(domain(X0),X0) = X0,
    inference(superposition,[],[f33,f278]) ).

fof(f503,plain,
    ! [X2,X0,X1] : addition(X0,X2) = addition(X0,addition(multiplication(domain(X1),X0),X2)),
    inference(superposition,[],[f23,f278]) ).

fof(f575,plain,
    ! [X0] : domain(X0) = multiplication(domain(X0),domain(X0)),
    inference(superposition,[],[f500,f52]) ).

fof(f753,plain,
    addition(domain(sK0),multiplication(domain(sK1),domain(sK2))) != addition(domain(sK0),addition(multiplication(domain(sK1),domain(sK0)),addition(multiplication(domain(sK0),domain(sK2)),multiplication(domain(sK1),domain(sK2))))),
    inference(superposition,[],[f236,f575]) ).

fof(f760,plain,
    addition(domain(sK0),multiplication(domain(sK1),domain(sK2))) != addition(domain(sK0),addition(multiplication(domain(sK0),domain(sK2)),multiplication(domain(sK1),domain(sK2)))),
    inference(forward_demodulation,[],[f753,f503]) ).

fof(f764,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f760,f425]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : KLE071+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.12/0.40  % Computer : n005.cluster.edu
% 0.12/0.40  % Model    : x86_64 x86_64
% 0.12/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.40  % Memory   : 8046.5625MB
% 0.12/0.40  % OS       : Linux 6.8.0-71-generic
% 0.12/0.40  % CPULimit : 300
% 0.12/0.40  % WCLimit  : 300
% 0.12/0.40  % DateTime : Sun Sep 27 13:08:47 UTC 2026
% 0.12/0.40  % CPUTime  : 
% 0.12/0.40  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.43  Running first-order model finding
% 0.12/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.17/0.50  % (3977184)Will run a generic schedule for satisfiability detection.
% 0.17/0.50  % (3977193)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2687663927:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.50  % (3977190)% WARNING: option uhcvi not known.
% 0.17/0.50  % (3977191)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4214523800:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.50  % (3977192)dis+10_1_sil=32000:sp=arity:random_seed=2692812974:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.50  % (3977189)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1378161106_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.50  % (3977190)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2583300313:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.50  % (3977195)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2062524433:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.50  % (3977194)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1753391704:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.50  % TRYING [1]
% 0.17/0.50  % TRYING [2]
% 0.17/0.50  % TRYING [3]
% 0.17/0.50  % TRYING [4]
% 0.17/0.50  % (3977194) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3977184-3977194"...
% 0.17/0.50  % (3977194)...printing done.
% 0.17/0.50  % (3977194)Refutation found. Thanks to Tanya!
% 0.17/0.50  % SZS status Theorem for theBenchmark
% 0.17/0.50  % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.50  % (3977194)------------------------------
% 0.17/0.50  % (3977194)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.50  % (3977194)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.50  % (3977194)CaDiCaL version: 2.1.3
% 0.17/0.50  % (3977194)Termination reason: Refutation
% 0.17/0.50  % (3977194)Time elapsed: 0.016 s
% 0.17/0.50  % (3977194)Peak memory usage: 12 MB
% 0.17/0.50  % (3977194)Instructions burned: 26 (million)
% 0.17/0.50  % (3977184)Success in time 0.054 s
% 0.17/0.50  % Vampire exiting
%------------------------------------------------------------------------------