↑ 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  : GRP539-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 : n014.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:18:03 AM UTC 2026

% Result   : Unsatisfiable 1.15s 0.59s
% Output   : Refutation 1.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   44 (  44 unt;   0 def)
%            Number of atoms       :   44 (  43 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    3 (   3   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   84 (  84   !;   0   ?)

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

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

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

fof(f14,plain,
    ! [X0] : inverse(inverse(X0)) = multiply(identity,X0),
    inference(superposition,[],[f6,f8]) ).

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

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

fof(f21,plain,
    ! [X0,X1] : divide(divide(identity,X1),divide(inverse(X0),X1)) = X0,
    inference(superposition,[],[f1,f6]) ).

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

fof(f28,plain,
    ! [X0,X1] : divide(inverse(X1),divide(inverse(X0),X1)) = X0,
    inference(forward_demodulation,[],[f21,f6]) ).

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

fof(f32,plain,
    ! [X0,X1] : inverse(divide(divide(X0,X1),X0)) = X1,
    inference(forward_demodulation,[],[f16,f6]) ).

fof(f33,plain,
    ! [X0,X1] : multiply(divide(X0,X1),X1) = X0,
    inference(forward_demodulation,[],[f29,f8]) ).

fof(f37,plain,
    ! [X0] : multiply(identity,X0) = X0,
    inference(superposition,[],[f33,f4]) ).

fof(f39,plain,
    ! [X0,X1] : multiply(multiply(X0,X1),inverse(X1)) = X0,
    inference(superposition,[],[f33,f8]) ).

fof(f40,plain,
    ! [X2,X0,X1] : divide(X1,X2) = multiply(X0,divide(divide(X1,X0),X2)),
    inference(superposition,[],[f33,f1]) ).

fof(f41,plain,
    ! [X0] : inverse(inverse(X0)) = X0,
    inference(backward_demodulation,[],[f14,f37]) ).

fof(f44,plain,
    ! [X0,X1] : divide(X1,X0) = multiply(X1,inverse(X0)),
    inference(superposition,[],[f8,f41]) ).

fof(f45,plain,
    ! [X0,X1] : divide(multiply(X0,X1),X1) = X0,
    inference(backward_demodulation,[],[f39,f44]) ).

fof(f52,plain,
    ! [X0,X1] : inverse(X0) = divide(divide(X1,X0),X1),
    inference(superposition,[],[f41,f32]) ).

fof(f70,plain,
    ! [X0,X1] : inverse(X1) = divide(divide(X0,multiply(X0,X1)),identity),
    inference(superposition,[],[f24,f8]) ).

fof(f72,plain,
    ! [X0] : divide(X0,identity) = X0,
    inference(superposition,[],[f24,f1]) ).

fof(f83,plain,
    ! [X0,X1] : divide(X0,divide(X0,X1)) = X1,
    inference(backward_demodulation,[],[f24,f72]) ).

fof(f87,plain,
    ! [X0,X1] : inverse(X1) = divide(X0,multiply(X0,X1)),
    inference(forward_demodulation,[],[f70,f72]) ).

fof(f111,plain,
    ! [X0,X1] : multiply(X0,divide(X1,X0)) = X1,
    inference(superposition,[],[f33,f83]) ).

fof(f136,plain,
    ! [X0,X1] : divide(inverse(X0),X1) = divide(inverse(X1),X0),
    inference(superposition,[],[f83,f28]) ).

fof(f201,plain,
    ! [X0,X1] : multiply(X0,X1) = multiply(X1,X0),
    inference(superposition,[],[f111,f45]) ).

fof(f367,plain,
    multiply(a3,multiply(b3,c3)) != multiply(c3,multiply(a3,b3)),
    inference(superposition,[],[f5,f201]) ).

fof(f400,plain,
    ! [X0,X1] : divide(X0,X1) = inverse(divide(X1,X0)),
    inference(superposition,[],[f52,f83]) ).

fof(f424,plain,
    ! [X0,X1] : divide(inverse(X0),X1) = inverse(multiply(X1,X0)),
    inference(superposition,[],[f52,f87]) ).

fof(f429,plain,
    ! [X0,X1] : divide(inverse(X1),X0) = inverse(multiply(X1,X0)),
    inference(backward_demodulation,[],[f136,f424]) ).

fof(f495,plain,
    ! [X2,X0,X1] : multiply(X2,divide(X1,X0)) = divide(X2,divide(X0,X1)),
    inference(superposition,[],[f8,f400]) ).

fof(f496,plain,
    ! [X2,X0,X1] : divide(X1,X2) = divide(X0,divide(X2,divide(X1,X0))),
    inference(backward_demodulation,[],[f40,f495]) ).

fof(f651,plain,
    ! [X2,X0,X1] : divide(X1,divide(X0,X2)) = divide(X2,divide(X0,X1)),
    inference(superposition,[],[f83,f496]) ).

fof(f1351,plain,
    ! [X2,X0,X1] : divide(X2,inverse(multiply(X0,X1))) = divide(X1,divide(inverse(X0),X2)),
    inference(superposition,[],[f651,f429]) ).

fof(f1438,plain,
    ! [X2,X0,X1] : divide(X2,inverse(multiply(X0,X1))) = divide(X1,inverse(multiply(X2,X0))),
    inference(forward_demodulation,[],[f1351,f424]) ).

fof(f1488,plain,
    ! [X2,X0,X1] : multiply(X1,multiply(X2,X0)) = divide(X2,inverse(multiply(X0,X1))),
    inference(forward_demodulation,[],[f1438,f8]) ).

fof(f1521,plain,
    ! [X2,X0,X1] : multiply(X1,multiply(X2,X0)) = multiply(X2,multiply(X0,X1)),
    inference(forward_demodulation,[],[f1488,f8]) ).

fof(f3767,plain,
    multiply(a3,multiply(b3,c3)) != multiply(a3,multiply(b3,c3)),
    inference(superposition,[],[f367,f1521]) ).

fof(f3798,plain,
    $false,
    inference(trivial_inequality_removal,[],[f3767]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP539-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.11/0.37  % Computer : n014.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:06:16 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.37  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.39  Running first-order model finding
% 0.11/0.39  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
% 1.15/0.59  % (568949)Will run a generic schedule for satisfiability detection.
% 1.15/0.59  % (568955)% WARNING: option uhcvi not known.
% 1.15/0.59  % (568955)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3174646838:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.15/0.59  % (568954)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4185497995_2999 on theBenchmark for (2999ds/0Mi)
% 1.15/0.59  % (568957)dis+10_1_sil=32000:sp=arity:random_seed=4166037768:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.15/0.59  % (568958)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=575501773:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.15/0.59  % (568959)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=338527415:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.15/0.59  % (568956)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3715320892:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.15/0.59  % (568960)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2513461491:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.15/0.59  % TRYING [1]
% 1.15/0.59  % TRYING [2]
% 1.15/0.59  % TRYING [3]
% 1.15/0.59  % TRYING [4]
% 1.15/0.59  % TRYING [5]
% 1.15/0.59  % TRYING [6]
% 1.15/0.59  % (568957)Instruction limit reached! 
% 1.15/0.59  % (568957)------------------------------
% 1.15/0.59  % (568957)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.15/0.59  % (568957)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.15/0.59  % (568957)CaDiCaL version: 2.1.3
% 1.15/0.59  % (568957)Termination reason: Instruction limit
% 1.15/0.59  % (568957)Termination phase: Saturation
% 1.15/0.59  % (568957)Time elapsed: 0.058 s
% 1.15/0.59  % (568957)Peak memory usage: 12 MB
% 1.15/0.59  % (568957)Instructions burned: 103 (million)
% 1.15/0.59  % (568958)Instruction limit reached! 
% 1.15/0.59  % (568958)------------------------------
% 1.15/0.59  % (568958)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.15/0.59  % (568958)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.15/0.59  % (568958)CaDiCaL version: 2.1.3
% 1.15/0.59  % (568958)Termination reason: Instruction limit
% 1.15/0.59  % (568958)Termination phase: Saturation
% 1.15/0.59  % (568958)Time elapsed: 0.067 s
% 1.15/0.59  % (568958)Peak memory usage: 12 MB
% 1.15/0.59  % (568958)Instructions burned: 116 (million)
% 1.15/0.59  % (568959)Instruction limit reached! 
% 1.15/0.59  % (568959)------------------------------
% 1.15/0.59  % (568959)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.15/0.59  % (568959)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.15/0.59  % (568959)CaDiCaL version: 2.1.3
% 1.15/0.59  % (568959)Termination reason: Instruction limit
% 1.15/0.59  % (568959)Termination phase: Saturation
% 1.15/0.59  % (568959)Time elapsed: 0.076 s
% 1.15/0.59  % (568959)Peak memory usage: 12 MB
% 1.15/0.59  % (568959)Instructions burned: 132 (million)
% 1.15/0.59  % (568989)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2821433639:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.15/0.59  % TRYING [1]
% 1.15/0.59  % TRYING [2]
% 1.15/0.59  % TRYING [3]
% 1.15/0.59  % TRYING [4]
% 1.15/0.59  % (568994)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2065602102:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 1.15/0.59  % TRYING [5]
% 1.15/0.59  % (568960)Instruction limit reached! 
% 1.15/0.59  % (568960)------------------------------
% 1.15/0.59  % (568960)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.15/0.59  % (568960)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.15/0.59  % (568960)CaDiCaL version: 2.1.3
% 1.15/0.59  % (568960)Termination reason: Instruction limit
% 1.15/0.59  % (568960)Termination phase: Saturation
% 1.15/0.59  % (568960)Time elapsed: 0.092 s
% 1.15/0.59  % (568960)Peak memory usage: 12 MB
% 1.15/0.59  % (568960)Instructions burned: 159 (million)
% 1.15/0.59  % (568999)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=3039844982:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.15/0.59  % (569010)ott-21_1_sil=16000:fs=off:random_seed=2221164563:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.15/0.59  % TRYING [6]
% 1.15/0.59  % TRYING [7]
% 1.15/0.59  % (568994) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-568949-568994"...
% 1.15/0.59  % (568994)...printing done.
% 1.15/0.59  % (568994)Refutation found. Thanks to Tanya!
% 1.15/0.59  % SZS status Unsatisfiable for theBenchmark
% 1.15/0.59  % SZS output start Proof for theBenchmark
% See solution above
% 1.15/0.59  % (568994)------------------------------
% 1.15/0.59  % (568994)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.15/0.59  % (568994)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.15/0.59  % (568994)CaDiCaL version: 2.1.3
% 1.15/0.59  % (568994)Termination reason: Refutation
% 1.15/0.59  % (568994)Time elapsed: 0.065 s
% 1.15/0.59  % (568994)Peak memory usage: 12 MB
% 1.15/0.59  % (568994)Instructions burned: 114 (million)
% 1.15/0.59  % (568949)Success in time 0.187 s
% 1.15/0.59  % Vampire exiting
%------------------------------------------------------------------------------