↑ 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  : GRP459-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 : 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 10:17:52 AM UTC 2026

% Result   : Unsatisfiable 0.16s 0.49s
% Output   : Refutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   31 (  31 unt;   0 def)
%            Number of atoms       :   31 (  30 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    :    7 (   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   :   53 (  53   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X2,X0,X1] : divide(divide(divide(X0,X0),divide(X0,divide(X1,divide(divide(identity,X0),X2)))),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(divide(identity,divide(X0,divide(X1,divide(divide(identity,X0),X2)))),X2) = X1,
    inference(forward_demodulation,[],[f1,f6]) ).

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

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

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

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

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

fof(f46,plain,
    ! [X0] : divide(identity,divide(identity,divide(X0,identity))) = divide(identity,divide(identity,X0)),
    inference(superposition,[],[f41,f15]) ).

fof(f47,plain,
    ! [X0] : divide(X0,identity) = X0,
    inference(superposition,[],[f15,f41]) ).

fof(f58,plain,
    ! [X0] : divide(identity,divide(identity,X0)) = X0,
    inference(forward_demodulation,[],[f46,f41]) ).

fof(f86,plain,
    ! [X0,X1] : divide(divide(X0,divide(identity,X1)),X1) = X0,
    inference(superposition,[],[f10,f58]) ).

fof(f95,plain,
    ! [X0,X1] : divide(divide(identity,divide(identity,divide(X1,X0))),divide(identity,X0)) = X1,
    inference(superposition,[],[f10,f58]) ).

fof(f102,plain,
    ! [X0,X1] : divide(divide(X1,X0),divide(identity,X0)) = X1,
    inference(forward_demodulation,[],[f95,f58]) ).

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

fof(f139,plain,
    ! [X0,X1] : divide(identity,divide(X1,X0)) = divide(X0,X1),
    inference(forward_demodulation,[],[f117,f47]) ).

fof(f178,plain,
    ! [X0,X1] : divide(identity,X0) = divide(X1,divide(X0,divide(identity,X1))),
    inference(superposition,[],[f139,f86]) ).

fof(f194,plain,
    ! [X2,X0,X1] : divide(divide(X2,divide(X1,X0)),divide(X0,X1)) = X2,
    inference(superposition,[],[f102,f139]) ).

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

fof(f285,plain,
    ! [X2,X0,X1] : divide(divide(identity,divide(X1,divide(X2,divide(identity,X0)))),divide(X0,X1)) = X2,
    inference(forward_demodulation,[],[f265,f58]) ).

fof(f307,plain,
    ! [X2,X0,X1] : divide(divide(divide(X2,divide(identity,X0)),X1),divide(X0,X1)) = X2,
    inference(forward_demodulation,[],[f285,f139]) ).

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

fof(f425,plain,
    ! [X2,X0,X1] : divide(X0,divide(X2,divide(identity,X1))) = divide(divide(X0,X1),X2),
    inference(forward_demodulation,[],[f413,f139]) ).

fof(f760,plain,
    ! [X2,X0,X1] : divide(X0,divide(X2,X1)) = divide(divide(X0,divide(identity,X1)),X2),
    inference(superposition,[],[f194,f307]) ).

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

fof(f1455,plain,
    divide(a3,divide(divide(identity,c3),b3)) != divide(a3,divide(divide(identity,c3),b3)),
    inference(forward_demodulation,[],[f1386,f425]) ).

fof(f1456,plain,
    $false,
    inference(trivial_inequality_removal,[],[f1455]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GRP459-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.12/0.38  % Computer : n016.cluster.edu
% 0.12/0.38  % Model    : x86_64 x86_64
% 0.12/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38  % Memory   : 8046.5625MB
% 0.12/0.38  % OS       : Linux 6.8.0-71-generic
% 0.12/0.38  % CPULimit : 300
% 0.12/0.38  % WCLimit  : 300
% 0.12/0.38  % DateTime : Sun Sep 27 10:10:02 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.38  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.40  Running first-order model finding
% 0.12/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.16/0.49  % (2394910)Will run a generic schedule for satisfiability detection.
% 0.16/0.49  % (2394915)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4006484188_2999 on theBenchmark for (2999ds/0Mi)
% 0.16/0.49  % TRYING [1]
% 0.16/0.49  % TRYING [2]
% 0.16/0.49  % TRYING [3]
% 0.16/0.49  % TRYING [4]
% 0.16/0.49  % (2394916)% WARNING: option uhcvi not known.
% 0.16/0.49  % TRYING [5]
% 0.16/0.49  % (2394916)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=460282853:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.16/0.49  % (2394917)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1682740357:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.16/0.49  % (2394918)dis+10_1_sil=32000:sp=arity:random_seed=74525477:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/0.49  % (2394919)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=873325480:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.16/0.49  % (2394921)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2562581400:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.16/0.49  % (2394920)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1865433346:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.16/0.49  % TRYING [6]
% 0.16/0.49  % (2394917) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2394910-2394917"...
% 0.16/0.49  % (2394917)...printing done.
% 0.16/0.49  % (2394917)Refutation found. Thanks to Tanya!
% 0.16/0.49  % SZS status Unsatisfiable for theBenchmark
% 0.16/0.49  % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.49  % (2394917)------------------------------
% 0.16/0.49  % (2394917)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.49  % (2394917)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.49  % (2394917)CaDiCaL version: 2.1.3
% 0.16/0.49  % (2394917)Termination reason: Refutation
% 0.16/0.49  % (2394917)Time elapsed: 0.028 s
% 0.16/0.49  % (2394917)Peak memory usage: 12 MB
% 0.16/0.49  % (2394917)Instructions burned: 48 (million)
% 0.16/0.49  % (2394910)Success in time 0.07 s
% 0.16/0.49  % Vampire exiting
%------------------------------------------------------------------------------