↑ 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  : GRP456-1 : TPTP v9.3.1. Released v2.6.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:17:52 AM UTC 2026

% Result   : Unsatisfiable 0.15s 0.48s
% Output   : Refutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   30 (  30 unt;   0 def)
%            Number of atoms       :   30 (  29 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    :    8 (   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   :   52 (  52   !;   0   ?)

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

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

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

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

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

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

fof(f8,plain,
    ! [X0,X1] : divide(divide(identity,divide(identity,divide(X0,divide(identity,X1)))),X1) = X0,
    inference(superposition,[],[f7,f4]) ).

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

fof(f13,plain,
    ! [X0] : divide(divide(identity,divide(identity,divide(X0,identity))),identity) = X0,
    inference(superposition,[],[f8,f4]) ).

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

fof(f39,plain,
    ! [X0] : divide(identity,divide(identity,divide(X0,identity))) = X0,
    inference(forward_demodulation,[],[f32,f4]) ).

fof(f44,plain,
    ! [X0] : divide(identity,divide(identity,divide(X0,identity))) = divide(identity,divide(identity,X0)),
    inference(superposition,[],[f39,f13]) ).

fof(f45,plain,
    ! [X0] : divide(X0,identity) = X0,
    inference(superposition,[],[f13,f39]) ).

fof(f56,plain,
    ! [X0] : divide(identity,divide(identity,X0)) = X0,
    inference(forward_demodulation,[],[f44,f39]) ).

fof(f84,plain,
    ! [X0,X1] : divide(divide(X0,divide(identity,X1)),X1) = X0,
    inference(superposition,[],[f8,f56]) ).

fof(f93,plain,
    ! [X0,X1] : divide(divide(identity,divide(identity,divide(X1,X0))),divide(identity,X0)) = X1,
    inference(superposition,[],[f8,f56]) ).

fof(f100,plain,
    ! [X0,X1] : divide(divide(X1,X0),divide(identity,X0)) = X1,
    inference(forward_demodulation,[],[f93,f56]) ).

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

fof(f137,plain,
    ! [X0,X1] : divide(identity,divide(X1,X0)) = divide(X0,X1),
    inference(forward_demodulation,[],[f115,f45]) ).

fof(f176,plain,
    ! [X0,X1] : divide(identity,X0) = divide(X1,divide(X0,divide(identity,X1))),
    inference(superposition,[],[f137,f84]) ).

fof(f192,plain,
    ! [X2,X0,X1] : divide(divide(X2,divide(X1,X0)),divide(X0,X1)) = X2,
    inference(superposition,[],[f100,f137]) ).

fof(f274,plain,
    ! [X2,X0,X1] : divide(divide(identity,divide(X1,divide(X2,divide(identity,X0)))),divide(X0,divide(identity,divide(identity,X1)))) = X2,
    inference(superposition,[],[f7,f176]) ).

fof(f275,plain,
    ! [X2,X0,X1] : divide(divide(identity,divide(X1,divide(X2,divide(identity,X0)))),divide(X0,X1)) = X2,
    inference(forward_demodulation,[],[f274,f56]) ).

fof(f299,plain,
    ! [X2,X0,X1] : divide(divide(divide(X2,divide(identity,X0)),X1),divide(X0,X1)) = X2,
    inference(forward_demodulation,[],[f275,f137]) ).

fof(f411,plain,
    ! [X2,X0,X1] : divide(divide(identity,divide(X1,X0)),X2) = divide(X0,divide(X2,divide(identity,X1))),
    inference(superposition,[],[f7,f192]) ).

fof(f423,plain,
    ! [X2,X0,X1] : divide(X0,divide(X2,divide(identity,X1))) = divide(divide(X0,X1),X2),
    inference(forward_demodulation,[],[f411,f137]) ).

fof(f758,plain,
    ! [X2,X0,X1] : divide(X0,divide(X2,X1)) = divide(divide(X0,divide(identity,X1)),X2),
    inference(superposition,[],[f192,f299]) ).

fof(f1385,plain,
    divide(a3,divide(identity,divide(b3,divide(identity,c3)))) != divide(a3,divide(divide(identity,c3),b3)),
    inference(superposition,[],[f6,f758]) ).

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

fof(f1454,plain,
    $false,
    inference(trivial_inequality_removal,[],[f1453]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GRP456-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.37  % Computer : n003.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Sun Sep 27 10:06:55 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.40  Running first-order model finding
% 0.10/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.15/0.48  % (269788)Will run a generic schedule for satisfiability detection.
% 0.15/0.48  % (269798)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3305604485:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.15/0.48  % (269794)% WARNING: option uhcvi not known.
% 0.15/0.48  % (269793)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1986848879_2999 on theBenchmark for (2999ds/0Mi)
% 0.15/0.48  % (269794)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1795055383:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.15/0.48  % (269795)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4126477036:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.15/0.48  % (269796)dis+10_1_sil=32000:sp=arity:random_seed=2455548349:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.15/0.48  % (269797)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3402101048:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.15/0.48  % (269799)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1078228562:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.15/0.48  % TRYING [1]
% 0.15/0.48  % TRYING [2]
% 0.15/0.48  % TRYING [3]
% 0.15/0.48  % TRYING [4]
% 0.15/0.48  % TRYING [5]
% 0.15/0.48  % (269795) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-269788-269795"...
% 0.15/0.48  % (269795)...printing done.
% 0.15/0.48  % (269795)Refutation found. Thanks to Tanya!
% 0.15/0.48  % SZS status Unsatisfiable for theBenchmark
% 0.15/0.48  % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.48  % (269795)------------------------------
% 0.15/0.48  % (269795)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.15/0.48  % (269795)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/0.48  % (269795)CaDiCaL version: 2.1.3
% 0.15/0.48  % (269795)Termination reason: Refutation
% 0.15/0.48  % (269795)Time elapsed: 0.029 s
% 0.15/0.48  % (269795)Peak memory usage: 12 MB
% 0.15/0.48  % (269795)Instructions burned: 48 (million)
% 0.15/0.48  % (269788)Success in time 0.071 s
% 0.15/0.49  % Vampire exiting
%------------------------------------------------------------------------------