↑ 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  : GRP657+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 : n003.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 10:18:27 AM UTC 2026

% Result   : Theorem 0.12s 0.46s
% Output   : Refutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   24 (  18 unt;   0 def)
%            Number of atoms       :   30 (  29 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   16 (  10   ~;   4   |;   2   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   4 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   0 con; 1-2 aty)
%            Number of variables   :   48 (  45   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] : mult(X1,ld(X1,X0)) = X0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f01) ).

fof(f2,axiom,
    ! [X0,X1] : ld(X1,mult(X1,X0)) = X0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f02) ).

fof(f4,axiom,
    ! [X0,X1] : rd(mult(X1,X0),X0) = X1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f04) ).

fof(f5,axiom,
    ! [X0,X1,X2] : mult(mult(X2,X1),mult(X0,X2)) = mult(X2,mult(mult(X1,X0),X2)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f05) ).

fof(f6,conjecture,
    ? [X0] :
    ! [X1] :
      ( mult(X1,X0) = X1
      & mult(X0,X1) = X1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

fof(f7,negated_conjecture,
    ~ ? [X0] :
      ! [X1] :
        ( mult(X1,X0) = X1
        & mult(X0,X1) = X1 ),
    inference(negated_conjecture,[status(cth)],[f6]) ).

fof(f8,plain,
    ! [X0] :
    ? [X1] :
      ( mult(X1,X0) != X1
      | mult(X0,X1) != X1 ),
    inference(ennf_transformation,[],[f7]) ).

fof(f9,plain,
    ! [X0] :
      ( sK0(X0) != mult(sK0(X0),X0)
      | sK0(X0) != mult(X0,sK0(X0)) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X1,sK0(X0))],[f8]) ).

fof(f10,plain,
    ! [X0,X1] : mult(X1,ld(X1,X0)) = X0,
    inference(cnf_transformation,[],[f1]) ).

fof(f11,plain,
    ! [X0,X1] : ld(X1,mult(X1,X0)) = X0,
    inference(cnf_transformation,[],[f2]) ).

fof(f13,plain,
    ! [X0,X1] : rd(mult(X1,X0),X0) = X1,
    inference(cnf_transformation,[],[f4]) ).

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

fof(f15,plain,
    ! [X0] :
      ( sK0(X0) != mult(sK0(X0),X0)
      | sK0(X0) != mult(X0,sK0(X0)) ),
    inference(cnf_transformation,[],[f9]) ).

fof(f28,plain,
    ! [X2,X0,X1] : mult(X1,mult(mult(ld(X1,X0),X2),X1)) = mult(X0,mult(X2,X1)),
    inference(superposition,[],[f14,f10]) ).

fof(f34,plain,
    ! [X2,X0,X1] : mult(X0,X1) = rd(mult(X0,mult(mult(X1,X2),X0)),mult(X2,X0)),
    inference(superposition,[],[f13,f14]) ).

fof(f43,plain,
    ! [X2,X0,X1] : mult(mult(ld(X2,X0),X1),X2) = ld(X2,mult(X0,mult(X1,X2))),
    inference(superposition,[],[f11,f28]) ).

fof(f157,plain,
    ! [X0,X1] : mult(X0,X1) = mult(mult(ld(X1,X1),X0),X1),
    inference(superposition,[],[f43,f11]) ).

fof(f177,plain,
    ! [X0,X1] : rd(mult(X0,X1),X1) = mult(ld(X1,X1),X0),
    inference(superposition,[],[f13,f157]) ).

fof(f194,plain,
    ! [X0,X1] : mult(ld(X1,X1),X0) = X0,
    inference(forward_demodulation,[],[f177,f13]) ).

fof(f209,plain,
    ! [X2,X0,X1] : mult(X1,ld(X2,X2)) = rd(mult(X1,mult(X0,X1)),mult(X0,X1)),
    inference(superposition,[],[f34,f194]) ).

fof(f231,plain,
    ! [X2,X1] : mult(X1,ld(X2,X2)) = X1,
    inference(forward_demodulation,[],[f209,f13]) ).

fof(f294,plain,
    ! [X0] :
      ( sK0(ld(X0,X0)) != sK0(ld(X0,X0))
      | sK0(ld(X0,X0)) != mult(ld(X0,X0),sK0(ld(X0,X0))) ),
    inference(superposition,[],[f15,f231]) ).

fof(f295,plain,
    ! [X0] : sK0(ld(X0,X0)) != mult(ld(X0,X0),sK0(ld(X0,X0))),
    inference(trivial_inequality_removal,[],[f294]) ).

fof(f298,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f295,f194]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GRP657+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.12/0.37  % Computer : n003.cluster.edu
% 0.12/0.37  % Model    : x86_64 x86_64
% 0.12/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37  % Memory   : 8046.5625MB
% 0.12/0.37  % OS       : Linux 6.8.0-71-generic
% 0.12/0.37  % CPULimit : 300
% 0.12/0.37  % WCLimit  : 300
% 0.12/0.37  % DateTime : Sun Sep 27 10:34:26 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.38  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.41  Running first-order model finding
% 0.12/0.41  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.12/0.46  % (318846)Will run a generic schedule for satisfiability detection.
% 0.12/0.46  % (318853)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3679700650:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.12/0.46  % (318852)% WARNING: option uhcvi not known.
% 0.12/0.46  % (318853) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-318846-318853"...
% 0.12/0.46  % (318851)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3967769137_2999 on theBenchmark for (2999ds/0Mi)
% 0.12/0.46  % (318853)...printing done.
% 0.12/0.46  % (318852)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3562912421:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.12/0.46  % (318854)dis+10_1_sil=32000:sp=arity:random_seed=162230922:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.12/0.46  % (318853)Refutation found. Thanks to Tanya!
% 0.12/0.46  % SZS status Theorem for theBenchmark
% 0.12/0.46  % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.46  % (318853)------------------------------
% 0.12/0.46  % (318853)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.12/0.46  % (318853)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.12/0.46  % (318853)CaDiCaL version: 2.1.3
% 0.12/0.46  % (318853)Termination reason: Refutation
% 0.12/0.46  % (318853)Time elapsed: 0.006 s
% 0.12/0.46  % (318853)Peak memory usage: 11 MB
% 0.12/0.46  % (318853)Instructions burned: 17 (million)
% 0.12/0.46  % (318846)Success in time 0.039 s
% 0.12/0.46  % Vampire exiting
%------------------------------------------------------------------------------