↑ 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  : KLE114+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 : n008.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:54 AM UTC 2026

% Result   : Theorem 0.25s 0.58s
% Output   : Refutation 0.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   40 (  40 unt;   0 def)
%            Number of atoms       :   40 (  39 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :   14 (  14   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Maximal term depth    :   12 (   3 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   3 con; 0-2 aty)
%            Number of variables   :   30 (  29   !;   1   ?)

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

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

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

fof(f13,axiom,
    ! [X0] : multiplication(antidomain(X0),X0) = zero,
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+4.ax',domain1) ).

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

fof(f16,axiom,
    ! [X0] : domain(X0) = antidomain(antidomain(X0)),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+4.ax',domain4) ).

fof(f21,axiom,
    ! [X0] : c(X0) = antidomain(domain(X0)),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+6.ax',complement) ).

fof(f23,axiom,
    ! [X0,X1] : forward_diamond(X0,X1) = domain(multiplication(X0,domain(X1))),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+6.ax',forward_diamond) ).

fof(f25,axiom,
    ! [X0,X1] : forward_box(X0,X1) = c(forward_diamond(X0,c(X1))),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+6.ax',forward_box) ).

fof(f27,conjecture,
    ! [X0] : forward_box(X0,one) = one,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

fof(f28,negated_conjecture,
    ~ ! [X0] : forward_box(X0,one) = one,
    inference(negated_conjecture,[status(cth)],[f27]) ).

fof(f29,plain,
    ? [X0] : one != forward_box(X0,one),
    inference(ennf_transformation,[],[f28]) ).

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

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

fof(f39,plain,
    ! [X0] : zero = multiplication(X0,zero),
    inference(cnf_transformation,[],[f10]) ).

fof(f41,plain,
    ! [X0] : zero = multiplication(antidomain(X0),X0),
    inference(cnf_transformation,[],[f13]) ).

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

fof(f44,plain,
    ! [X0] : antidomain(antidomain(X0)) = domain(X0),
    inference(cnf_transformation,[],[f16]) ).

fof(f49,plain,
    ! [X0] : c(X0) = antidomain(domain(X0)),
    inference(cnf_transformation,[],[f21]) ).

fof(f51,plain,
    ! [X0,X1] : forward_diamond(X0,X1) = domain(multiplication(X0,domain(X1))),
    inference(cnf_transformation,[],[f23]) ).

fof(f53,plain,
    ! [X0,X1] : forward_box(X0,X1) = c(forward_diamond(X0,c(X1))),
    inference(cnf_transformation,[],[f25]) ).

fof(f55,plain,
    one != forward_box(sK0,one),
    inference(cnf_transformation,[],[f29]) ).

fof(f56,plain,
    ! [X0] : c(X0) = antidomain(antidomain(antidomain(X0))),
    inference(definition_unfolding,[],[f49,f44]) ).

fof(f60,plain,
    ! [X0,X1] : forward_diamond(X0,X1) = antidomain(antidomain(multiplication(X0,antidomain(antidomain(X1))))),
    inference(definition_unfolding,[],[f51,f44,f44]) ).

fof(f61,plain,
    ! [X0,X1] : forward_box(X0,X1) = antidomain(antidomain(antidomain(antidomain(antidomain(multiplication(X0,antidomain(antidomain(antidomain(antidomain(antidomain(X1))))))))))),
    inference(definition_unfolding,[],[f53,f56,f60,f56]) ).

fof(f62,plain,
    one != antidomain(antidomain(antidomain(antidomain(antidomain(multiplication(sK0,antidomain(antidomain(antidomain(antidomain(antidomain(one))))))))))),
    inference(definition_unfolding,[],[f55,f61]) ).

fof(f64,plain,
    zero = antidomain(one),
    inference(superposition,[],[f35,f41]) ).

fof(f65,plain,
    one != antidomain(antidomain(antidomain(antidomain(antidomain(multiplication(sK0,antidomain(antidomain(antidomain(antidomain(zero)))))))))),
    inference(superposition,[],[f62,f64]) ).

fof(f74,plain,
    one = addition(antidomain(zero),zero),
    inference(superposition,[],[f43,f64]) ).

fof(f79,plain,
    one = antidomain(zero),
    inference(forward_demodulation,[],[f74,f32]) ).

fof(f80,plain,
    one != antidomain(antidomain(antidomain(antidomain(antidomain(multiplication(sK0,antidomain(antidomain(antidomain(one))))))))),
    inference(superposition,[],[f65,f79]) ).

fof(f84,plain,
    one != antidomain(antidomain(antidomain(antidomain(antidomain(multiplication(sK0,antidomain(antidomain(zero)))))))),
    inference(forward_demodulation,[],[f80,f64]) ).

fof(f86,plain,
    one != antidomain(antidomain(antidomain(antidomain(antidomain(multiplication(sK0,antidomain(one))))))),
    inference(forward_demodulation,[],[f84,f79]) ).

fof(f87,plain,
    one != antidomain(antidomain(antidomain(antidomain(antidomain(multiplication(sK0,zero)))))),
    inference(forward_demodulation,[],[f86,f64]) ).

fof(f88,plain,
    one != antidomain(antidomain(antidomain(antidomain(antidomain(zero))))),
    inference(forward_demodulation,[],[f87,f39]) ).

fof(f89,plain,
    one != antidomain(antidomain(antidomain(antidomain(one)))),
    inference(forward_demodulation,[],[f88,f79]) ).

fof(f90,plain,
    one != antidomain(antidomain(antidomain(zero))),
    inference(forward_demodulation,[],[f89,f64]) ).

fof(f91,plain,
    one != antidomain(antidomain(one)),
    inference(forward_demodulation,[],[f90,f79]) ).

fof(f92,plain,
    one != antidomain(zero),
    inference(forward_demodulation,[],[f91,f64]) ).

fof(f93,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f92,f79]) ).

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