↑ 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  : GRP606-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 : n002.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:12 AM UTC 2026

% Result   : Unsatisfiable 0.16s 0.50s
% Output   : Refutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   32 (  32 unt;   0 def)
%            Number of atoms       :   32 (  31 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    6 (   6   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    9 (   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   :   58 (  58   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X2,X0,X1] : double_divide(inverse(double_divide(X0,inverse(double_divide(inverse(X1),double_divide(X0,X2))))),X2) = X1,
    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(inverse(double_divide(X1,inverse(double_divide(inverse(X0),double_divide(X1,X2))))),inverse(double_divide(inverse(X3),X0)))),X2) = X3,
    inference(superposition,[],[f1,f1]) ).

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

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

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

fof(f59,plain,
    ! [X0,X1] : double_divide(inverse(inverse(double_divide(inverse(X0),X1))),inverse(X0)) = X1,
    inference(superposition,[],[f40,f40]) ).

fof(f71,plain,
    ! [X0,X1] : inverse(double_divide(inverse(X0),X1)) = double_divide(inverse(inverse(X0)),inverse(X1)),
    inference(superposition,[],[f59,f40]) ).

fof(f81,plain,
    ! [X0,X1] : inverse(double_divide(inverse(double_divide(inverse(X1),X0)),X1)) = X0,
    inference(superposition,[],[f71,f59]) ).

fof(f117,plain,
    ! [X0,X1] : inverse(double_divide(X0,double_divide(inverse(X1),X0))) = X1,
    inference(superposition,[],[f81,f81]) ).

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

fof(f134,plain,
    ! [X2,X0] : double_divide(inverse(inverse(double_divide(X0,X2))),X0) = X2,
    inference(superposition,[],[f59,f81]) ).

fof(f136,plain,
    ! [X2,X0] : inverse(double_divide(X0,X2)) = double_divide(inverse(X0),inverse(X2)),
    inference(superposition,[],[f71,f81]) ).

fof(f176,plain,
    ! [X0,X1] : inverse(double_divide(inverse(double_divide(inverse(X0),X0)),X1)) = X1,
    inference(superposition,[],[f81,f121]) ).

fof(f177,plain,
    ! [X0,X1] : inverse(double_divide(double_divide(inverse(X1),X1),X0)) = X0,
    inference(superposition,[],[f117,f121]) ).

fof(f290,plain,
    ! [X0,X1] : double_divide(inverse(X1),inverse(double_divide(inverse(X0),X0))) = X1,
    inference(superposition,[],[f121,f136]) ).

fof(f315,plain,
    ! [X0,X1] : inverse(double_divide(X1,double_divide(inverse(X0),X0))) = X1,
    inference(forward_demodulation,[],[f290,f136]) ).

fof(f376,plain,
    ! [X0,X1] : double_divide(inverse(X1),X1) = double_divide(inverse(X0),X0),
    inference(superposition,[],[f315,f177]) ).

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

fof(f602,plain,
    ! [X2,X0] : double_divide(X2,double_divide(X2,X0)) = X0,
    inference(superposition,[],[f547,f81]) ).

fof(f622,plain,
    ! [X0] : inverse(inverse(X0)) = X0,
    inference(superposition,[],[f117,f547]) ).

fof(f694,plain,
    ! [X0,X1] : double_divide(inverse(X1),X1) = double_divide(X0,inverse(X0)),
    inference(superposition,[],[f376,f622]) ).

fof(f731,plain,
    ! [X0,X1] : double_divide(X1,X0) = double_divide(inverse(inverse(X0)),X1),
    inference(superposition,[],[f134,f602]) ).

fof(f745,plain,
    ! [X0,X1] : double_divide(X1,X0) = double_divide(X0,X1),
    inference(forward_demodulation,[],[f731,f622]) ).

fof(f1484,plain,
    ! [X0,X1] : double_divide(X0,inverse(X0)) = double_divide(X1,inverse(X1)),
    inference(forward_demodulation,[],[f694,f745]) ).

fof(f1841,plain,
    ! [X0] : a2 != inverse(double_divide(a2,inverse(double_divide(X0,inverse(X0))))),
    inference(superposition,[],[f5,f1484]) ).

fof(f2034,plain,
    ! [X0] : a2 != inverse(double_divide(a2,inverse(inverse(double_divide(inverse(X0),X0))))),
    inference(superposition,[],[f1841,f176]) ).

fof(f2038,plain,
    ! [X0] : a2 != inverse(double_divide(a2,double_divide(inverse(X0),X0))),
    inference(forward_demodulation,[],[f2034,f622]) ).

fof(f2051,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f2038,f315]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP606-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.38  % Computer : n002.cluster.edu
% 0.11/0.38  % Model    : x86_64 x86_64
% 0.11/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38  % Memory   : 8046.5625MB
% 0.11/0.38  % OS       : Linux 6.8.0-71-generic
% 0.11/0.38  % CPULimit : 300
% 0.11/0.38  % WCLimit  : 300
% 0.11/0.38  % DateTime : Sun Sep 27 10:12:37 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.40  Running first-order model finding
% 0.11/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.16/0.50  % (3318795)Will run a generic schedule for satisfiability detection.
% 0.16/0.50  % (3318805)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2217238336:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.16/0.50  % (3318801)% WARNING: option uhcvi not known.
% 0.16/0.50  % (3318802)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3564872332:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.16/0.50  % (3318804)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3450101317:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.16/0.50  % (3318801)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1992326324:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.16/0.50  % (3318800)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3902141711_2999 on theBenchmark for (2999ds/0Mi)
% 0.16/0.50  % (3318803)dis+10_1_sil=32000:sp=arity:random_seed=1285977511:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/0.50  % (3318806)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=331660862:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.16/0.50  % TRYING [1]
% 0.16/0.50  % TRYING [2]
% 0.16/0.50  % TRYING [3]
% 0.16/0.50  % TRYING [4]
% 0.16/0.50  % (3318805)Instruction limit reached! 
% 0.16/0.50  % (3318805)------------------------------
% 0.16/0.50  % (3318805)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.50  % (3318805)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.50  % (3318805)CaDiCaL version: 2.1.3
% 0.16/0.50  % (3318805)Termination reason: Instruction limit
% 0.16/0.50  % (3318805)Termination phase: Saturation
% 0.16/0.50  % (3318805)Time elapsed: 0.041 s
% 0.16/0.50  % (3318805)Peak memory usage: 13 MB
% 0.16/0.50  % (3318805)Instructions burned: 134 (million)
% 0.16/0.50  % (3318802) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3318795-3318802"...
% 0.16/0.50  % (3318802)...printing done.
% 0.16/0.50  % (3318802)Refutation found. Thanks to Tanya!
% 0.16/0.50  % SZS status Unsatisfiable for theBenchmark
% 0.16/0.50  % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.50  % (3318802)------------------------------
% 0.16/0.50  % (3318802)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.50  % (3318802)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.50  % (3318802)CaDiCaL version: 2.1.3
% 0.16/0.50  % (3318802)Termination reason: Refutation
% 0.16/0.50  % (3318802)Time elapsed: 0.048 s
% 0.16/0.50  % (3318802)Peak memory usage: 12 MB
% 0.16/0.50  % (3318802)Instructions burned: 83 (million)
% 0.16/0.50  % (3318795)Success in time 0.092 s
% 0.16/0.50  % Vampire exiting
%------------------------------------------------------------------------------