↑ 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  : KLE037+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 : n016.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:43 AM UTC 2026

% Result   : Theorem 0.11s 0.47s
% Output   : Refutation 0.49s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   33 (  28 unt;   0 def)
%            Number of atoms       :   40 (  24 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   16 (   9   ~;   5   |;   1   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   50 (  49   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] : addition(X0,X1) = addition(X1,X0),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+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/KLE002+0.ax',additive_associativity) ).

fof(f4,axiom,
    ! [X0] : addition(X0,X0) = X0,
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',additive_idempotence) ).

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

fof(f12,axiom,
    ! [X0,X1] :
      ( leq(X0,X1)
    <=> addition(X0,X1) = X1 ),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',order) ).

fof(f13,axiom,
    ! [X0] : leq(addition(one,multiplication(X0,star(X0))),star(X0)),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',star_unfold_right) ).

fof(f17,conjecture,
    ! [X0] : leq(one,star(X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).

fof(f18,negated_conjecture,
    ~ ! [X0] : leq(one,star(X0)),
    inference(negated_conjecture,[status(cth)],[f17]) ).

fof(f21,plain,
    ? [X0] : ~ leq(one,star(X0)),
    inference(ennf_transformation,[],[f18]) ).

fof(f22,plain,
    ! [X0,X1] :
      ( ( leq(X0,X1)
        | addition(X0,X1) != X1 )
      & ( addition(X0,X1) = X1
        | ~ leq(X0,X1) ) ),
    inference(nnf_transformation,[],[f12]) ).

fof(f23,plain,
    ~ leq(one,star(sK0)),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f21]) ).

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

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

fof(f27,plain,
    ! [X0] : addition(X0,X0) = X0,
    inference(cnf_transformation,[],[f4]) ).

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

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

fof(f35,plain,
    ! [X0,X1] :
      ( ~ leq(X0,X1)
      | addition(X0,X1) = X1 ),
    inference(cnf_transformation,[],[f22]) ).

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

fof(f37,plain,
    ! [X0] : leq(addition(one,multiplication(X0,star(X0))),star(X0)),
    inference(cnf_transformation,[],[f13]) ).

fof(f41,plain,
    ~ leq(one,star(sK0)),
    inference(cnf_transformation,[],[f23]) ).

fof(f58,plain,
    ! [X0] : star(X0) = addition(addition(one,multiplication(X0,star(X0))),star(X0)),
    inference(resolution,[],[f37,f35]) ).

fof(f62,plain,
    ! [X0] : star(X0) = addition(star(X0),addition(one,multiplication(X0,star(X0)))),
    inference(forward_demodulation,[],[f58,f24]) ).

fof(f71,plain,
    ! [X0,X1] : addition(X0,X1) = addition(X0,addition(X0,X1)),
    inference(superposition,[],[f25,f27]) ).

fof(f78,plain,
    ! [X2,X0,X1] : addition(X0,addition(X1,X2)) = addition(X1,addition(X2,X0)),
    inference(superposition,[],[f25,f24]) ).

fof(f140,plain,
    ! [X0,X1] : multiplication(addition(one,X1),X0) = addition(X0,multiplication(X1,X0)),
    inference(superposition,[],[f32,f30]) ).

fof(f237,plain,
    ! [X0,X1] :
      ( addition(X0,X1) != addition(X0,X1)
      | leq(X0,addition(X0,X1)) ),
    inference(superposition,[],[f36,f71]) ).

fof(f241,plain,
    ! [X0,X1] : leq(X0,addition(X0,X1)),
    inference(trivial_inequality_removal,[],[f237]) ).

fof(f1075,plain,
    ! [X0] : star(X0) = addition(one,addition(multiplication(X0,star(X0)),star(X0))),
    inference(forward_demodulation,[],[f62,f78]) ).

fof(f1076,plain,
    ! [X0] : star(X0) = addition(one,addition(star(X0),multiplication(X0,star(X0)))),
    inference(forward_demodulation,[],[f1075,f24]) ).

fof(f1077,plain,
    ! [X0] : star(X0) = addition(one,multiplication(addition(one,X0),star(X0))),
    inference(forward_demodulation,[],[f1076,f140]) ).

fof(f1104,plain,
    ! [X0] : leq(one,star(X0)),
    inference(superposition,[],[f241,f1077]) ).

fof(f1117,plain,
    $false,
    inference(resolution,[],[f1104,f41]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : KLE037+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37  % Computer : n016.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Sun Sep 27 13:09:47 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.37  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.40  Running first-order model finding
% 0.11/0.40  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.11/0.47  % (2624297)Will run a generic schedule for satisfiability detection.
% 0.11/0.47  % (2624304)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4287546972:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.11/0.47  % (2624303)% WARNING: option uhcvi not known.
% 0.11/0.47  % (2624302)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=607254047_2999 on theBenchmark for (2999ds/0Mi)
% 0.11/0.47  % (2624305)dis+10_1_sil=32000:sp=arity:random_seed=3123142802:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.11/0.47  % (2624308)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2629090019:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.11/0.47  % (2624306)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2588066962:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.11/0.47  % (2624307)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1008452119:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.11/0.47  % (2624303)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2644730933:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.11/0.47  % TRYING [1]
% 0.11/0.47  % TRYING [2]
% 0.11/0.47  % TRYING [3]
% 0.11/0.47  % TRYING [4]
% 0.11/0.47  % (2624305) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2624297-2624305"...
% 0.11/0.47  % TRYING [5]
% 0.11/0.47  % (2624305)...printing done.
% 0.11/0.47  % (2624305)Refutation found. Thanks to Tanya!
% 0.11/0.47  % SZS status Theorem for theBenchmark
% 0.11/0.47  % SZS output start Proof for theBenchmark
% See solution above
% 0.49/0.47  % (2624305)------------------------------
% 0.49/0.47  % (2624305)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.49/0.47  % (2624305)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.49/0.47  % (2624305)CaDiCaL version: 2.1.3
% 0.49/0.47  % (2624305)Termination reason: Refutation
% 0.49/0.47  % (2624305)Time elapsed: 0.027 s
% 0.49/0.47  % (2624305)Peak memory usage: 12 MB
% 0.49/0.47  % (2624305)Instructions burned: 40 (million)
% 0.49/0.47  % (2624297)Success in time 0.064 s
% 0.49/0.47  % Vampire exiting
%------------------------------------------------------------------------------