↑ 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  : GRP465-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 : n026.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:53 AM UTC 2026

% Result   : Unsatisfiable 0.20s 0.55s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   19
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   29 (  29 unt;   0 def)
%            Number of atoms       :   29 (  28 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    4 (   4   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :   51 (  51   !;   0   ?)

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

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

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

fof(f6,plain,
    ! [X0] : divide(X0,X0) = identity,
    inference(reorient_equations,[],[f5]) ).

fof(f7,negated_conjecture,
    multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_3) ).

fof(f8,plain,
    divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != divide(a3,divide(identity,divide(b3,divide(identity,c3)))),
    inference(definition_unfolding,[],[f7,f2,f2,f2,f2]) ).

fof(f9,plain,
    ! [X2,X0,X1] : divide(X0,divide(divide(divide(identity,X1),X2),divide(divide(identity,X0),X2))) = X1,
    inference(forward_demodulation,[],[f1,f6]) ).

fof(f12,plain,
    ! [X0,X1] : divide(X0,divide(identity,divide(divide(identity,X0),divide(identity,X1)))) = X1,
    inference(superposition,[],[f9,f6]) ).

fof(f18,plain,
    ! [X0] : divide(X0,identity) = X0,
    inference(superposition,[],[f9,f6]) ).

fof(f22,plain,
    ! [X0,X1] : divide(X1,divide(divide(identity,X0),divide(divide(identity,X1),identity))) = X0,
    inference(superposition,[],[f9,f18]) ).

fof(f25,plain,
    ! [X0,X1] : divide(X1,divide(divide(identity,X0),divide(identity,X1))) = X0,
    inference(forward_demodulation,[],[f22,f18]) ).

fof(f29,plain,
    ! [X0,X1] : divide(X1,divide(X0,divide(identity,X1))) = divide(divide(identity,X0),divide(identity,identity)),
    inference(superposition,[],[f25,f25]) ).

fof(f34,plain,
    ! [X0] : divide(identity,divide(divide(identity,X0),identity)) = X0,
    inference(superposition,[],[f25,f18]) ).

fof(f42,plain,
    ! [X0] : divide(identity,divide(identity,X0)) = X0,
    inference(forward_demodulation,[],[f34,f18]) ).

fof(f46,plain,
    ! [X0,X1] : divide(divide(identity,X0),identity) = divide(X1,divide(X0,divide(identity,X1))),
    inference(forward_demodulation,[],[f29,f6]) ).

fof(f51,plain,
    ! [X0,X1] : divide(identity,X0) = divide(X1,divide(X0,divide(identity,X1))),
    inference(forward_demodulation,[],[f46,f18]) ).

fof(f281,plain,
    ! [X0,X1] : divide(divide(divide(identity,divide(identity,X1)),divide(identity,X0)),X0) = X1,
    inference(superposition,[],[f25,f12]) ).

fof(f316,plain,
    ! [X0,X1] : divide(divide(X1,divide(identity,X0)),X0) = X1,
    inference(forward_demodulation,[],[f281,f42]) ).

fof(f382,plain,
    ! [X0,X1] : divide(X1,X0) = divide(identity,divide(X0,divide(identity,divide(identity,X1)))),
    inference(superposition,[],[f51,f316]) ).

fof(f385,plain,
    ! [X0,X1] : divide(X1,X0) = divide(identity,divide(X0,X1)),
    inference(forward_demodulation,[],[f382,f42]) ).

fof(f475,plain,
    ! [X2,X0,X1] : divide(divide(X1,X0),divide(divide(identity,X2),divide(X0,X1))) = X2,
    inference(superposition,[],[f25,f385]) ).

fof(f680,plain,
    ! [X2,X0,X1] : divide(divide(divide(divide(identity,divide(identity,X1)),X2),divide(divide(identity,X0),X2)),X0) = X1,
    inference(superposition,[],[f475,f9]) ).

fof(f708,plain,
    ! [X2,X0,X1] : divide(divide(divide(X1,X2),divide(divide(identity,X0),X2)),X0) = X1,
    inference(forward_demodulation,[],[f680,f42]) ).

fof(f943,plain,
    ! [X2,X0,X1] : divide(X0,X2) = divide(divide(X0,X1),divide(divide(identity,divide(identity,X2)),X1)),
    inference(superposition,[],[f316,f708]) ).

fof(f952,plain,
    ! [X2,X0,X1] : divide(X0,X2) = divide(divide(X0,X1),divide(X2,X1)),
    inference(forward_demodulation,[],[f943,f42]) ).

fof(f999,plain,
    ! [X2,X0,X1] : divide(X0,divide(X2,X1)) = divide(divide(X0,divide(identity,X1)),X2),
    inference(superposition,[],[f952,f316]) ).

fof(f1453,plain,
    divide(a3,divide(identity,divide(b3,divide(identity,c3)))) != divide(a3,divide(divide(identity,c3),b3)),
    inference(superposition,[],[f8,f999]) ).

fof(f1492,plain,
    divide(a3,divide(divide(identity,c3),b3)) != divide(a3,divide(divide(identity,c3),b3)),
    inference(forward_demodulation,[],[f1453,f385]) ).

fof(f1493,plain,
    $false,
    inference(trivial_inequality_removal,[],[f1492]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP465-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.39  % Computer : n026.cluster.edu
% 0.12/0.39  % Model    : x86_64 x86_64
% 0.12/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39  % Memory   : 8046.5625MB
% 0.12/0.39  % OS       : Linux 6.8.0-71-generic
% 0.12/0.39  % CPULimit : 300
% 0.12/0.39  % WCLimit  : 300
% 0.12/0.39  % DateTime : Sun Sep 27 10:08:12 UTC 2026
% 0.12/0.40  % CPUTime  : 
% 0.12/0.40  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.44  Running first-order model finding
% 0.12/0.45  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.20/0.55  % (2596502)Will run a generic schedule for satisfiability detection.
% 0.20/0.55  % (2596510)dis+10_1_sil=32000:sp=arity:random_seed=4088053234:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.55  % (2596508)% WARNING: option uhcvi not known.
% 0.20/0.55  % (2596509)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=378900851:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.55  % (2596507)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1690884629_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.55  % (2596512)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1576085179:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.55  % (2596511)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1738891179:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.55  % (2596508)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2902758795:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.55  % (2596513)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=557387758:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.55  % TRYING [1]
% 0.20/0.55  % TRYING [2]
% 0.20/0.55  % TRYING [3]
% 0.20/0.55  % TRYING [4]
% 0.20/0.55  % TRYING [5]
% 0.20/0.55  % (2596510)Instruction limit reached! 
% 0.20/0.55  % (2596510)------------------------------
% 0.20/0.55  % (2596510)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.55  % (2596510)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.55  % (2596510)CaDiCaL version: 2.1.3
% 0.20/0.55  % (2596510)Termination reason: Instruction limit
% 0.20/0.55  % (2596510)Termination phase: Saturation
% 0.20/0.55  % (2596510)Time elapsed: 0.049 s
% 0.20/0.55  % (2596510)Peak memory usage: 12 MB
% 0.20/0.55  % (2596510)Instructions burned: 104 (million)
% 0.20/0.55  % (2596509) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2596502-2596509"...
% 0.20/0.55  % (2596522)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2831639973:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.20/0.55  % (2596509)...printing done.
% 0.20/0.55  % TRYING [1]
% 0.20/0.55  % TRYING [2]
% 0.20/0.55  % (2596509)Refutation found. Thanks to Tanya!
% 0.20/0.55  % SZS status Unsatisfiable for theBenchmark
% 0.20/0.55  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.55  % (2596509)------------------------------
% 0.20/0.55  % (2596509)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.55  % (2596509)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.55  % (2596509)CaDiCaL version: 2.1.3
% 0.20/0.55  % (2596509)Termination reason: Refutation
% 0.20/0.55  % (2596509)Time elapsed: 0.052 s
% 0.20/0.55  % (2596509)Peak memory usage: 12 MB
% 0.20/0.55  % (2596509)Instructions burned: 53 (million)
% 0.20/0.55  % (2596502)Success in time 0.092 s
% 0.20/0.55  % Vampire exiting
%------------------------------------------------------------------------------