↑ 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  : GRP590-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 : n012.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:10 AM UTC 2026

% Result   : Unsatisfiable 0.30s 0.43s
% Output   : Refutation 0.30s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    3
% 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 :    8 (   4 avg)
%            Maximal term depth    :   18 (   4 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   :   96 (  96   !;   0   ?)

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

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

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

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

fof(f5,plain,
    a2 != inverse(double_divide(a2,inverse(double_divide(b2,inverse(b2))))),
    inference(definition_unfolding,[],[f4,f2,f2]) ).

fof(f6,plain,
    ! [X2,X3,X0,X1] : double_divide(inverse(double_divide(X0,inverse(double_divide(inverse(double_divide(double_divide(X1,X2),inverse(double_divide(X1,inverse(X0))))),inverse(X3))))),X2) = X3,
    inference(superposition,[],[f1,f1]) ).

fof(f7,plain,
    ! [X2,X3,X0,X1] : double_divide(inverse(double_divide(double_divide(inverse(double_divide(double_divide(X1,inverse(X2)),inverse(double_divide(X1,inverse(X0))))),X3),inverse(X0))),X3) = X2,
    inference(superposition,[],[f1,f1]) ).

fof(f10,plain,
    ! [X2,X3,X0,X1,X4] : double_divide(inverse(double_divide(X1,inverse(double_divide(inverse(double_divide(double_divide(inverse(double_divide(double_divide(X2,inverse(X1)),inverse(double_divide(X2,inverse(X0))))),X3),inverse(X0))),inverse(X4))))),X3) = X4,
    inference(superposition,[],[f6,f1]) ).

fof(f12,plain,
    ! [X2,X0] : double_divide(inverse(double_divide(X0,inverse(X0))),inverse(X2)) = X2,
    inference(superposition,[],[f6,f1]) ).

fof(f16,plain,
    ! [X2,X3,X0,X1,X4,X5] : double_divide(inverse(double_divide(double_divide(inverse(double_divide(X0,inverse(double_divide(inverse(double_divide(X1,inverse(double_divide(inverse(double_divide(double_divide(X2,inverse(X3)),inverse(double_divide(X2,inverse(X1))))),inverse(X0))))),inverse(X4))))),X5),inverse(X4))),X5) = X3,
    inference(superposition,[],[f7,f6]) ).

fof(f35,plain,
    ! [X2,X0] : double_divide(inverse(double_divide(X0,inverse(X2))),inverse(X0)) = X2,
    inference(superposition,[],[f7,f12]) ).

fof(f63,plain,
    ! [X0,X1] : double_divide(inverse(X0),inverse(inverse(double_divide(X1,inverse(X1))))) = X0,
    inference(superposition,[],[f35,f12]) ).

fof(f72,plain,
    ! [X2,X3,X0,X1] : double_divide(inverse(double_divide(double_divide(X2,inverse(X1)),inverse(double_divide(X2,inverse(X0))))),X3) = double_divide(inverse(double_divide(X1,inverse(X0))),X3),
    inference(superposition,[],[f10,f35]) ).

fof(f76,plain,
    ! [X2,X3,X0,X1] : double_divide(inverse(double_divide(double_divide(inverse(double_divide(X0,inverse(double_divide(inverse(double_divide(X1,inverse(X0))),inverse(X2))))),X3),inverse(X2))),X3) = X1,
    inference(superposition,[],[f7,f35]) ).

fof(f93,plain,
    ! [X3,X0,X1,X4,X5] : double_divide(inverse(double_divide(double_divide(inverse(double_divide(X0,inverse(double_divide(inverse(double_divide(X1,inverse(double_divide(inverse(double_divide(X3,inverse(X1))),inverse(X0))))),inverse(X4))))),X5),inverse(X4))),X5) = X3,
    inference(backward_demodulation,[],[f16,f72]) ).

fof(f268,plain,
    ! [X2,X3,X0,X1,X4] : inverse(double_divide(X2,inverse(X0))) = double_divide(inverse(double_divide(double_divide(inverse(double_divide(X1,inverse(double_divide(inverse(double_divide(X2,inverse(double_divide(inverse(X0),inverse(X1))))),inverse(X3))))),X4),inverse(X3))),X4),
    inference(superposition,[],[f93,f35]) ).

fof(f271,plain,
    ! [X2,X3,X0,X1,X6,X4,X5] : inverse(double_divide(X3,inverse(double_divide(inverse(double_divide(double_divide(X4,inverse(X2)),inverse(double_divide(X4,inverse(X3))))),inverse(X0))))) = double_divide(inverse(double_divide(double_divide(inverse(double_divide(X1,inverse(double_divide(inverse(double_divide(X2,inverse(double_divide(inverse(X0),inverse(X1))))),inverse(X5))))),X6),inverse(X5))),X6),
    inference(superposition,[],[f93,f6]) ).

fof(f284,plain,
    ! [X2,X3,X0,X1,X4] : double_divide(inverse(double_divide(double_divide(inverse(double_divide(X2,inverse(double_divide(inverse(double_divide(inverse(double_divide(X0,inverse(inverse(double_divide(X1,inverse(X1)))))),inverse(X2))),inverse(X3))))),X4),inverse(X3))),X4) = X0,
    inference(superposition,[],[f93,f12]) ).

fof(f287,plain,
    ! [X2,X3,X0,X1,X4] : double_divide(inverse(double_divide(double_divide(inverse(double_divide(X2,inverse(double_divide(X0,inverse(double_divide(inverse(double_divide(X1,inverse(X0))),inverse(X2))))))),X4),inverse(inverse(double_divide(X3,inverse(X3)))))),X4) = X1,
    inference(superposition,[],[f93,f63]) ).

fof(f311,plain,
    ! [X0,X1] : inverse(double_divide(X0,inverse(inverse(double_divide(X1,inverse(X1)))))) = X0,
    inference(forward_demodulation,[],[f284,f76]) ).

fof(f320,plain,
    ! [X2,X3,X0,X1,X6,X5] : inverse(double_divide(X3,inverse(double_divide(inverse(double_divide(X2,inverse(X3))),inverse(X0))))) = double_divide(inverse(double_divide(double_divide(inverse(double_divide(X1,inverse(double_divide(inverse(double_divide(X2,inverse(double_divide(inverse(X0),inverse(X1))))),inverse(X5))))),X6),inverse(X5))),X6),
    inference(forward_demodulation,[],[f271,f72]) ).

fof(f321,plain,
    ! [X3,X1] : inverse(double_divide(X1,inverse(double_divide(X3,inverse(X1))))) = X3,
    inference(backward_demodulation,[],[f93,f268]) ).

fof(f334,plain,
    ! [X2,X0,X1,X4] : double_divide(double_divide(inverse(double_divide(X2,inverse(double_divide(X0,inverse(double_divide(inverse(double_divide(X1,inverse(X0))),inverse(X2))))))),X4),X4) = X1,
    inference(backward_demodulation,[],[f287,f311]) ).

fof(f340,plain,
    ! [X2,X3,X0] : inverse(double_divide(X2,inverse(X0))) = inverse(double_divide(X3,inverse(double_divide(inverse(double_divide(X2,inverse(X3))),inverse(X0))))),
    inference(forward_demodulation,[],[f320,f268]) ).

fof(f375,plain,
    ! [X2,X1,X4] : double_divide(double_divide(inverse(double_divide(X2,inverse(double_divide(X1,inverse(X2))))),X4),X4) = X1,
    inference(backward_demodulation,[],[f334,f340]) ).

fof(f393,plain,
    ! [X1,X4] : double_divide(double_divide(X1,X4),X4) = X1,
    inference(forward_demodulation,[],[f375,f321]) ).

fof(f412,plain,
    ! [X0,X1] : double_divide(X0,inverse(X1)) = inverse(double_divide(X1,inverse(X0))),
    inference(superposition,[],[f393,f35]) ).

fof(f418,plain,
    ! [X0,X1] : inverse(X0) = double_divide(X0,inverse(inverse(double_divide(X1,inverse(X1))))),
    inference(superposition,[],[f393,f63]) ).

fof(f433,plain,
    ! [X0] : inverse(inverse(X0)) = X0,
    inference(backward_demodulation,[],[f63,f418]) ).

fof(f467,plain,
    ! [X0,X1] : inverse(X0) = double_divide(X0,inverse(double_divide(X1,inverse(X1)))),
    inference(backward_demodulation,[],[f418,f412]) ).

fof(f496,plain,
    a2 != inverse(double_divide(a2,double_divide(b2,inverse(b2)))),
    inference(backward_demodulation,[],[f5,f412]) ).

fof(f531,plain,
    ! [X0,X1] : inverse(X0) = double_divide(X0,double_divide(X1,inverse(X1))),
    inference(forward_demodulation,[],[f467,f412]) ).

fof(f567,plain,
    a2 != inverse(inverse(a2)),
    inference(backward_demodulation,[],[f496,f531]) ).

fof(f589,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f567,f433]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : GRP590-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.03  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.04/0.31  % Computer : n012.cluster.edu
% 0.04/0.31  % Model    : x86_64 x86_64
% 0.04/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.31  % Memory   : 8046.5625MB
% 0.04/0.31  % OS       : Linux 6.8.0-71-generic
% 0.04/0.31  % CPULimit : 300
% 0.04/0.31  % WCLimit  : 300
% 0.04/0.31  % DateTime : Sun Sep 27 10:07:19 UTC 2026
% 0.04/0.31  % CPUTime  : 
% 0.04/0.31  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.33  Running first-order model finding
% 0.07/0.33  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.30/0.43  % (2146384)Will run a generic schedule for satisfiability detection.
% 0.30/0.43  % (2146391)% WARNING: option uhcvi not known.
% 0.30/0.43  % (2146394)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1602228900:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.30/0.43  % (2146395)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3130783976:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.30/0.43  % (2146391)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4019785886:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.30/0.43  % (2146396)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1304133243:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.30/0.43  % (2146393)dis+10_1_sil=32000:sp=arity:random_seed=1860166423:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.30/0.43  % (2146392)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3010717694:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.30/0.43  % (2146390)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1487499123_2999 on theBenchmark for (2999ds/0Mi)
% 0.30/0.43  % TRYING [1]
% 0.30/0.43  % TRYING [2]
% 0.30/0.43  % TRYING [3]
% 0.30/0.43  % TRYING [4]
% 0.30/0.43  % (2146393)Instruction limit reached! 
% 0.30/0.43  % (2146393)------------------------------
% 0.30/0.43  % (2146393)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.30/0.43  % (2146393)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.30/0.43  % (2146393)CaDiCaL version: 2.1.3
% 0.30/0.43  % (2146393)Termination reason: Instruction limit
% 0.30/0.43  % (2146393)Termination phase: Saturation
% 0.30/0.43  % (2146393)Time elapsed: 0.030 s
% 0.30/0.43  % (2146393)Peak memory usage: 12 MB
% 0.30/0.43  % (2146393)Instructions burned: 105 (million)
% 0.30/0.43  % (2146394)Instruction limit reached! 
% 0.30/0.43  % (2146394)------------------------------
% 0.30/0.43  % (2146394)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.30/0.43  % (2146394)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.30/0.43  % (2146394)CaDiCaL version: 2.1.3
% 0.30/0.43  % (2146394)Termination reason: Instruction limit
% 0.30/0.43  % (2146394)Termination phase: Saturation
% 0.30/0.43  % (2146394)Time elapsed: 0.032 s
% 0.30/0.43  % (2146394)Peak memory usage: 13 MB
% 0.30/0.43  % (2146394)Instructions burned: 117 (million)
% 0.30/0.43  % (2146395)Instruction limit reached! 
% 0.30/0.43  % (2146395)------------------------------
% 0.30/0.43  % (2146395)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.30/0.43  % (2146395)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.30/0.43  % (2146395)CaDiCaL version: 2.1.3
% 0.30/0.43  % (2146395)Termination reason: Instruction limit
% 0.30/0.43  % (2146395)Termination phase: Saturation
% 0.30/0.43  % (2146395)Time elapsed: 0.039 s
% 0.30/0.43  % (2146395)Peak memory usage: 13 MB
% 0.30/0.43  % (2146395)Instructions burned: 133 (million)
% 0.30/0.43  % (2146416)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2932801809:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.30/0.43  % TRYING [1]
% 0.30/0.43  % TRYING [2]
% 0.30/0.43  % (2146417)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=4071131116:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 0.30/0.43  % TRYING [3]
% 0.30/0.43  % (2146418)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=3503607376:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 0.30/0.43  % (2146396)Instruction limit reached! 
% 0.30/0.43  % (2146396)------------------------------
% 0.30/0.43  % (2146396)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.30/0.43  % (2146396)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.30/0.43  % (2146396)CaDiCaL version: 2.1.3
% 0.30/0.43  % (2146396)Termination reason: Instruction limit
% 0.30/0.43  % (2146396)Termination phase: Saturation
% 0.30/0.43  % (2146396)Time elapsed: 0.050 s
% 0.30/0.43  % (2146396)Peak memory usage: 13 MB
% 0.30/0.43  % (2146396)Instructions burned: 161 (million)
% 0.30/0.43  % TRYING [4]
% 0.30/0.43  % (2146422)ott-21_1_sil=16000:fs=off:random_seed=3705467339:i=180:av=off:fsr=off_2999 on theBenchmark for (2999ds/180Mi)
% 0.30/0.43  % (2146417) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2146384-2146417"...
% 0.30/0.43  % (2146417)...printing done.
% 0.30/0.43  % (2146417)Refutation found. Thanks to Tanya!
% 0.30/0.43  % SZS status Unsatisfiable for theBenchmark
% 0.30/0.43  % SZS output start Proof for theBenchmark
% See solution above
% 0.30/0.43  % (2146417)------------------------------
% 0.30/0.43  % (2146417)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.30/0.43  % (2146417)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.30/0.43  % (2146417)CaDiCaL version: 2.1.3
% 0.30/0.43  % (2146417)Termination reason: Refutation
% 0.30/0.43  % (2146417)Time elapsed: 0.031 s
% 0.30/0.43  % (2146417)Peak memory usage: 12 MB
% 0.30/0.43  % (2146417)Instructions burned: 102 (million)
% 0.30/0.43  % (2146384)Success in time 0.098 s
% 0.30/0.43  % Vampire exiting
%------------------------------------------------------------------------------