↑ Up

Vampire-SAT---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : GRP710-10 : TPTP v9.3.1. Released v8.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT

% Computer : n019.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:37 AM UTC 2026

% Result   : Unsatisfiable 0.11s 0.46s
% Output   : Refutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   36 (  36 unt;   0 def)
%            Number of atoms       :   36 (  35 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    3 (   3   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   50 (  50   !;   0   ?)

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

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

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

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

fof(f5,plain,
    ! [X0] : unit = mult(X0,i(X0)),
    inference(reorient_equations,[],[f4]) ).

fof(f6,axiom,
    ! [X0] : mult(i(X0),X0) = unit,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f05) ).

fof(f7,plain,
    ! [X0] : unit = mult(i(X0),X0),
    inference(reorient_equations,[],[f6]) ).

fof(f8,negated_conjecture,
    ! [X0] : mult(x0,X0) != x1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal) ).

fof(f18,plain,
    ! [X0,X1] : mult(X0,mult(i(X0),mult(i(X0),X1))) = mult(mult(unit,i(X0)),X1),
    inference(superposition,[],[f3,f5]) ).

fof(f21,plain,
    ! [X0,X1] : mult(i(X0),mult(X0,mult(X0,X1))) = mult(mult(unit,X0),X1),
    inference(superposition,[],[f3,f7]) ).

fof(f26,plain,
    ! [X0,X1] : mult(mult(X0,X1),X1) = mult(X0,mult(X1,mult(X1,unit))),
    inference(superposition,[],[f1,f3]) ).

fof(f28,plain,
    ! [X0,X1] : mult(mult(X0,X1),X1) = mult(X0,mult(X1,X1)),
    inference(forward_demodulation,[],[f26,f1]) ).

fof(f31,plain,
    ! [X0,X1] : mult(X0,X1) = mult(i(X0),mult(X0,mult(X0,X1))),
    inference(forward_demodulation,[],[f21,f2]) ).

fof(f34,plain,
    ! [X0,X1] : mult(i(X0),X1) = mult(X0,mult(i(X0),mult(i(X0),X1))),
    inference(forward_demodulation,[],[f18,f2]) ).

fof(f42,plain,
    ! [X0,X1] : mult(mult(X0,X1),mult(X1,X1)) = mult(mult(X0,mult(X1,X1)),X1),
    inference(superposition,[],[f28,f28]) ).

fof(f43,plain,
    ! [X0] : mult(unit,X0) = mult(i(X0),mult(X0,X0)),
    inference(superposition,[],[f28,f7]) ).

fof(f50,plain,
    ! [X0] : mult(i(X0),mult(X0,X0)) = X0,
    inference(forward_demodulation,[],[f43,f2]) ).

fof(f149,plain,
    ! [X0] : mult(i(i(X0)),mult(i(X0),X0)) = X0,
    inference(superposition,[],[f31,f50]) ).

fof(f161,plain,
    ! [X0] : mult(i(i(X0)),unit) = X0,
    inference(forward_demodulation,[],[f149,f7]) ).

fof(f172,plain,
    ! [X0] : i(i(X0)) = X0,
    inference(forward_demodulation,[],[f161,f1]) ).

fof(f223,plain,
    ! [X0,X1] : mult(i(X0),X1) = mult(i(X0),mult(X0,mult(i(X0),X1))),
    inference(superposition,[],[f31,f34]) ).

fof(f229,plain,
    ! [X0] : x1 != mult(i(x0),X0),
    inference(superposition,[],[f8,f34]) ).

fof(f582,plain,
    ! [X0] : mult(unit,X0) = mult(mult(i(mult(X0,X0)),X0),mult(X0,X0)),
    inference(superposition,[],[f42,f7]) ).

fof(f603,plain,
    ! [X0] : mult(mult(i(mult(X0,X0)),X0),mult(X0,X0)) = X0,
    inference(forward_demodulation,[],[f582,f2]) ).

fof(f636,plain,
    ! [X0] : mult(i(mult(i(mult(X0,X0)),X0)),mult(mult(i(mult(X0,X0)),X0),X0)) = X0,
    inference(superposition,[],[f31,f603]) ).

fof(f641,plain,
    ! [X0] : mult(i(mult(i(mult(X0,X0)),X0)),mult(i(mult(X0,X0)),mult(X0,X0))) = X0,
    inference(forward_demodulation,[],[f636,f28]) ).

fof(f648,plain,
    ! [X0] : mult(i(mult(i(mult(X0,X0)),X0)),unit) = X0,
    inference(forward_demodulation,[],[f641,f7]) ).

fof(f650,plain,
    ! [X0] : i(mult(i(mult(X0,X0)),X0)) = X0,
    inference(forward_demodulation,[],[f648,f1]) ).

fof(f664,plain,
    ! [X0] : i(X0) = mult(i(mult(X0,X0)),X0),
    inference(superposition,[],[f172,f650]) ).

fof(f685,plain,
    ! [X0,X1] : mult(i(mult(X0,X0)),mult(X0,mult(X0,X1))) = mult(mult(i(X0),X0),X1),
    inference(superposition,[],[f3,f664]) ).

fof(f691,plain,
    ! [X0,X1] : mult(unit,X1) = mult(i(mult(X0,X0)),mult(X0,mult(X0,X1))),
    inference(forward_demodulation,[],[f685,f7]) ).

fof(f700,plain,
    ! [X0,X1] : mult(i(mult(X0,X0)),mult(X0,mult(X0,X1))) = X1,
    inference(forward_demodulation,[],[f691,f2]) ).

fof(f731,plain,
    ! [X0,X1] : mult(X0,mult(i(X0),X1)) = mult(i(mult(i(X0),i(X0))),mult(i(X0),mult(i(X0),X1))),
    inference(superposition,[],[f700,f223]) ).

fof(f758,plain,
    ! [X0,X1] : mult(X0,mult(i(X0),X1)) = X1,
    inference(forward_demodulation,[],[f731,f700]) ).

fof(f835,plain,
    ! [X0] : x1 != X0,
    inference(superposition,[],[f229,f758]) ).

fof(f857,plain,
    $false,
    inference(equality_resolution,[],[f835]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP710-10 : TPTP v9.3.1. Released v8.1.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37  % Computer : n019.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 10:37:03 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.37  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.40  Running first-order model finding
% 0.11/0.40  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.11/0.46  % (2899746)Will run a generic schedule for satisfiability detection.
% 0.11/0.46  % (2899753)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3399285318:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.11/0.46  % (2899752)% WARNING: option uhcvi not known.
% 0.11/0.46  % (2899752)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3379927678:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.11/0.46  % (2899754)dis+10_1_sil=32000:sp=arity:random_seed=1950697859:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.11/0.46  % (2899751)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3461637076_2999 on theBenchmark for (2999ds/0Mi)
% 0.11/0.46  % (2899755)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3839785809:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.11/0.46  % TRYING [1]
% 0.11/0.46  % TRYING [2]
% 0.11/0.46  % TRYING [3]
% 0.11/0.46  % TRYING [4]
% 0.11/0.46  % (2899753) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2899746-2899753"...
% 0.11/0.46  % (2899753)...printing done.
% 0.11/0.46  % (2899753)Refutation found. Thanks to Tanya!
% 0.11/0.46  % SZS status Unsatisfiable for theBenchmark
% 0.11/0.46  % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.46  % (2899753)------------------------------
% 0.11/0.46  % (2899753)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.46  % (2899753)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.46  % (2899753)CaDiCaL version: 2.1.3
% 0.11/0.46  % (2899753)Termination reason: Refutation
% 0.11/0.46  % (2899753)Time elapsed: 0.011 s
% 0.11/0.46  % (2899753)Peak memory usage: 11 MB
% 0.11/0.46  % (2899753)Instructions burned: 34 (million)
% 0.11/0.46  % (2899746)Success in time 0.046 s
% 0.11/0.46  % Vampire exiting
%------------------------------------------------------------------------------