↑ 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  : GRP452-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 : 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:17:51 AM UTC 2026

% Result   : Unsatisfiable 0.18s 0.51s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   34 (  34 unt;   0 def)
%            Number of atoms       :   34 (  33 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    5 (   5   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    8 (   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   :   76 (  76   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X2,X0,X1] : divide(divide(divide(X0,X0),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,
    ! [X2,X0,X1] : multiply(X0,X1) = divide(X0,divide(divide(X2,X2),X1)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).

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

fof(f4,negated_conjecture,
    multiply(multiply(inverse(b2),b2),a2) != a2,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_2) ).

fof(f5,plain,
    a2 != multiply(multiply(inverse(b2),b2),a2),
    inference(reorient_equations,[],[f4]) ).

fof(f6,plain,
    ! [X0,X1] : multiply(X0,X1) = divide(X0,inverse(X1)),
    inference(forward_demodulation,[],[f2,f3]) ).

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

fof(f8,plain,
    ! [X2,X0,X1] : divide(inverse(divide(X0,divide(X1,divide(inverse(X0),X2)))),X2) = X1,
    inference(forward_demodulation,[],[f7,f3]) ).

fof(f9,plain,
    ! [X0,X1] : inverse(X1) = divide(inverse(divide(X0,X0)),X1),
    inference(superposition,[],[f3,f3]) ).

fof(f12,plain,
    ! [X0,X1] : multiply(divide(X0,X0),X1) = inverse(inverse(X1)),
    inference(superposition,[],[f3,f6]) ).

fof(f13,plain,
    ! [X2,X3,X0,X1] : divide(inverse(divide(divide(X1,divide(X0,divide(inverse(X1),X2))),divide(X3,X0))),X2) = X3,
    inference(superposition,[],[f8,f8]) ).

fof(f15,plain,
    ! [X2,X0,X1] : divide(X2,X2) = divide(inverse(divide(X0,inverse(divide(inverse(X0),X1)))),X1),
    inference(superposition,[],[f8,f3]) ).

fof(f17,plain,
    ! [X2,X0,X1] : divide(inverse(inverse(divide(X0,divide(inverse(divide(X1,X1)),X2)))),X2) = X0,
    inference(superposition,[],[f8,f3]) ).

fof(f22,plain,
    ! [X2,X0] : divide(inverse(inverse(divide(X0,inverse(X2)))),X2) = X0,
    inference(forward_demodulation,[],[f17,f9]) ).

fof(f23,plain,
    ! [X2,X0,X1] : divide(X2,X2) = divide(inverse(multiply(X0,divide(inverse(X0),X1))),X1),
    inference(forward_demodulation,[],[f15,f6]) ).

fof(f25,plain,
    ! [X2,X0] : divide(inverse(inverse(multiply(X0,X2))),X2) = X0,
    inference(forward_demodulation,[],[f22,f6]) ).

fof(f131,plain,
    ! [X0,X1] : divide(X0,X0) = divide(X1,X1),
    inference(superposition,[],[f23,f23]) ).

fof(f197,plain,
    ! [X2,X0,X1] : divide(inverse(X1),X2) = divide(inverse(divide(X1,divide(X0,X0))),X2),
    inference(superposition,[],[f8,f131]) ).

fof(f199,plain,
    ! [X0,X1] : divide(X0,X0) = multiply(inverse(X1),X1),
    inference(superposition,[],[f6,f131]) ).

fof(f200,plain,
    ! [X0,X1] : divide(X0,X0) = inverse(divide(X1,X1)),
    inference(superposition,[],[f3,f131]) ).

fof(f239,plain,
    ! [X2,X3,X0,X1] : divide(inverse(divide(divide(X2,divide(inverse(X1),divide(inverse(X2),X3))),multiply(X0,X1))),X3) = X0,
    inference(superposition,[],[f13,f6]) ).

fof(f248,plain,
    ! [X2,X3,X0,X1] : inverse(inverse(multiply(X0,X2))) = divide(inverse(divide(divide(X1,divide(X2,divide(inverse(X1),X3))),X0)),X3),
    inference(superposition,[],[f13,f25]) ).

fof(f251,plain,
    ! [X2,X3,X0,X1,X4] : divide(inverse(divide(divide(X1,divide(X2,divide(inverse(X1),X3))),divide(X0,X0))),X3) = inverse(multiply(X4,divide(inverse(X4),X2))),
    inference(superposition,[],[f13,f23]) ).

fof(f260,plain,
    ! [X2,X3,X1,X4] : inverse(multiply(X4,divide(inverse(X4),X2))) = divide(inverse(divide(X1,divide(X2,divide(inverse(X1),X3)))),X3),
    inference(forward_demodulation,[],[f251,f197]) ).

fof(f271,plain,
    ! [X0,X1] : inverse(inverse(multiply(multiply(X0,X1),inverse(X1)))) = X0,
    inference(forward_demodulation,[],[f239,f248]) ).

fof(f293,plain,
    ! [X2,X4] : inverse(multiply(X4,divide(inverse(X4),X2))) = X2,
    inference(forward_demodulation,[],[f260,f8]) ).

fof(f339,plain,
    ! [X0] : a2 != multiply(divide(X0,X0),a2),
    inference(superposition,[],[f5,f199]) ).

fof(f341,plain,
    a2 != inverse(inverse(a2)),
    inference(forward_demodulation,[],[f339,f12]) ).

fof(f464,plain,
    ! [X0,X1] : inverse(X1) = inverse(multiply(X1,divide(X0,X0))),
    inference(superposition,[],[f293,f131]) ).

fof(f903,plain,
    ! [X2,X0,X1] : inverse(inverse(multiply(multiply(X1,divide(X2,X2)),divide(X0,X0)))) = X1,
    inference(superposition,[],[f271,f200]) ).

fof(f946,plain,
    ! [X2,X1] : inverse(inverse(multiply(X1,divide(X2,X2)))) = X1,
    inference(forward_demodulation,[],[f903,f464]) ).

fof(f958,plain,
    ! [X1] : inverse(inverse(X1)) = X1,
    inference(forward_demodulation,[],[f946,f464]) ).

fof(f977,plain,
    a2 != a2,
    inference(superposition,[],[f341,f958]) ).

fof(f994,plain,
    $false,
    inference(trivial_inequality_removal,[],[f977]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP452-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.40  % Computer : n019.cluster.edu
% 0.13/0.40  % Model    : x86_64 x86_64
% 0.13/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.40  % Memory   : 8046.5625MB
% 0.13/0.40  % OS       : Linux 6.8.0-71-generic
% 0.13/0.40  % CPULimit : 300
% 0.13/0.40  % WCLimit  : 300
% 0.13/0.40  % DateTime : Sun Sep 27 10:05:04 UTC 2026
% 0.13/0.41  % CPUTime  : 
% 0.13/0.41  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.44  Running first-order model finding
% 0.13/0.44  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.18/0.51  % (2854838)Will run a generic schedule for satisfiability detection.
% 0.18/0.51  % (2854845)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2913840557:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.51  % (2854844)% WARNING: option uhcvi not known.
% 0.18/0.51  % (2854843)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2549985735_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.51  % (2854846)dis+10_1_sil=32000:sp=arity:random_seed=3780122786:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.51  % (2854844)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2761667292:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.51  % (2854847)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1553787587:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.51  % (2854848)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2337907772:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.51  % (2854849)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=321005736:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.51  % TRYING [1]
% 0.18/0.51  % TRYING [2]
% 0.18/0.51  % TRYING [3]
% 0.18/0.51  % TRYING [4]
% 0.18/0.51  % (2854847) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2854838-2854847"...
% 0.18/0.51  % (2854847)...printing done.
% 0.18/0.51  % (2854847)Refutation found. Thanks to Tanya!
% 0.18/0.51  % SZS status Unsatisfiable for theBenchmark
% 0.18/0.51  % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.51  % (2854847)------------------------------
% 0.18/0.51  % (2854847)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.51  % (2854847)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.51  % (2854847)CaDiCaL version: 2.1.3
% 0.18/0.51  % (2854847)Termination reason: Refutation
% 0.18/0.51  % (2854847)Time elapsed: 0.024 s
% 0.18/0.51  % (2854847)Peak memory usage: 12 MB
% 0.18/0.51  % (2854847)Instructions burned: 39 (million)
% 0.18/0.51  % (2854838)Success in time 0.065 s
% 0.18/0.51  % Vampire exiting
%------------------------------------------------------------------------------