↑ 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  : GRP491-1 : TPTP v9.3.1. Released v2.6.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n017.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:17:57 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X2,X0,X1] : double_divide(double_divide(identity,X0),double_divide(identity,double_divide(double_divide(double_divide(X0,X1),identity),double_divide(X2,X1)))) = X2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).

fof(f2,axiom,
    ! [X0,X1] : multiply(X0,X1) = double_divide(double_divide(X1,X0),identity),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).

fof(f3,axiom,
    ! [X0] : inverse(X0) = double_divide(X0,identity),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inverse) ).

fof(f4,axiom,
    ! [X0] : identity = double_divide(X0,inverse(X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity) ).

fof(f5,negated_conjecture,
    multiply(identity,a2) != a2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_2) ).

fof(f6,plain,
    a2 != multiply(identity,a2),
    inference(reorient_equations,[],[f5]) ).

fof(f7,plain,
    ! [X0] : identity = double_divide(X0,double_divide(X0,identity)),
    inference(definition_unfolding,[],[f4,f3]) ).

fof(f8,plain,
    a2 != double_divide(double_divide(a2,identity),identity),
    inference(definition_unfolding,[],[f6,f2]) ).

fof(f9,plain,
    ! [X0,X1] : double_divide(identity,double_divide(identity,double_divide(double_divide(double_divide(double_divide(identity,identity),X0),identity),double_divide(X1,X0)))) = X1,
    inference(superposition,[],[f1,f7]) ).

fof(f12,plain,
    ! [X0,X1] : double_divide(double_divide(identity,X0),double_divide(identity,double_divide(double_divide(double_divide(X0,double_divide(X1,identity)),identity),identity))) = X1,
    inference(superposition,[],[f1,f7]) ).

fof(f14,plain,
    ! [X0] : double_divide(double_divide(X0,identity),identity) = double_divide(double_divide(identity,X0),double_divide(identity,identity)),
    inference(superposition,[],[f1,f7]) ).

fof(f30,plain,
    ! [X0] : double_divide(identity,X0) = double_divide(identity,double_divide(identity,double_divide(double_divide(double_divide(double_divide(identity,identity),double_divide(identity,identity)),identity),double_divide(double_divide(X0,identity),identity)))),
    inference(superposition,[],[f9,f14]) ).

fof(f40,plain,
    ! [X0] : double_divide(identity,X0) = double_divide(identity,double_divide(identity,double_divide(double_divide(double_divide(double_divide(identity,identity),identity),identity),double_divide(double_divide(X0,identity),identity)))),
    inference(forward_demodulation,[],[f30,f14]) ).

fof(f42,plain,
    ! [X0] : double_divide(identity,X0) = double_divide(X0,identity),
    inference(forward_demodulation,[],[f40,f9]) ).

fof(f55,plain,
    a2 != double_divide(double_divide(identity,a2),identity),
    inference(superposition,[],[f8,f42]) ).

fof(f64,plain,
    a2 != double_divide(identity,double_divide(identity,a2)),
    inference(forward_demodulation,[],[f55,f42]) ).

fof(f102,plain,
    ! [X0,X1] : double_divide(double_divide(identity,X0),double_divide(identity,double_divide(identity,double_divide(double_divide(X0,double_divide(X1,identity)),identity)))) = X1,
    inference(forward_demodulation,[],[f12,f42]) ).

fof(f103,plain,
    ! [X0,X1] : double_divide(double_divide(identity,X0),double_divide(identity,double_divide(identity,double_divide(identity,double_divide(X0,double_divide(X1,identity)))))) = X1,
    inference(forward_demodulation,[],[f102,f42]) ).

fof(f111,plain,
    ! [X0] : double_divide(double_divide(identity,double_divide(double_divide(double_divide(identity,identity),identity),identity)),double_divide(identity,X0)) = X0,
    inference(superposition,[],[f103,f9]) ).

fof(f118,plain,
    ! [X0] : double_divide(double_divide(identity,double_divide(identity,double_divide(double_divide(identity,identity),identity))),double_divide(identity,X0)) = X0,
    inference(forward_demodulation,[],[f111,f42]) ).

fof(f123,plain,
    ! [X0] : double_divide(double_divide(identity,double_divide(identity,double_divide(identity,double_divide(identity,identity)))),double_divide(identity,X0)) = X0,
    inference(forward_demodulation,[],[f118,f42]) ).

fof(f125,plain,
    ! [X0] : double_divide(double_divide(identity,double_divide(identity,identity)),double_divide(identity,X0)) = X0,
    inference(forward_demodulation,[],[f123,f7]) ).

fof(f126,plain,
    ! [X0] : double_divide(identity,double_divide(identity,X0)) = X0,
    inference(forward_demodulation,[],[f125,f7]) ).

fof(f250,plain,
    a2 != a2,
    inference(superposition,[],[f64,f126]) ).

fof(f264,plain,
    $false,
    inference(trivial_inequality_removal,[],[f250]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP491-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37  % Computer : n017.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:01:22 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.41  Running first-order model finding
% 0.11/0.41  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.45  % (2307746)Will run a generic schedule for satisfiability detection.
% 0.11/0.45  % (2307752)% WARNING: option uhcvi not known.
% 0.11/0.45  % (2307751)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1102390571_3000 on theBenchmark for (3000ds/0Mi)
% 0.11/0.45  % TRYING [1]
% 0.11/0.45  % TRYING [2]
% 0.11/0.45  % (2307754)dis+10_1_sil=32000:sp=arity:random_seed=3694367870:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 0.11/0.45  % (2307755)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4054848231:i=116_3000 on theBenchmark for (3000ds/116Mi)
% 0.11/0.45  % TRYING [3]
% 0.11/0.45  % (2307753)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2942427113:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 0.11/0.45  % (2307752)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2555056802:i=135531:add=off:rawr=on_3000 on theBenchmark for (3000ds/135531Mi)
% 0.11/0.45  % (2307756)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3977825921:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 0.11/0.45  % (2307757)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3372688372:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_3000 on theBenchmark for (3000ds/159Mi)
% 0.11/0.45  % TRYING [4]
% 0.11/0.45  % TRYING [5]
% 0.11/0.45  % (2307754) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2307746-2307754"...
% 0.11/0.45  % (2307754)...printing done.
% 0.11/0.45  % (2307755) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2307746-2307755"...
% 0.11/0.45  % (2307754)Refutation found. Thanks to Tanya!
% 0.11/0.45  % SZS status Unsatisfiable for theBenchmark
% 0.11/0.45  % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.45  % (2307754)------------------------------
% 0.11/0.45  % (2307754)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.45  % (2307754)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.45  % (2307754)CaDiCaL version: 2.1.3
% 0.11/0.45  % (2307754)Termination reason: Refutation
% 0.11/0.45  % (2307754)Time elapsed: 0.010 s
% 0.11/0.45  % (2307754)Peak memory usage: 11 MB
% 0.11/0.45  % (2307754)Instructions burned: 16 (million)
% 0.11/0.45  % (2307746)Success in time 0.034 s
% 0.11/0.45  % Vampire exiting
%------------------------------------------------------------------------------