↑ 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  : GRP171-2 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT

% Computer : n010.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:02 AM UTC 2026

% Result   : Unsatisfiable 0.41s 0.53s
% Output   : Refutation 0.41s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   18 (  18 unt;   0 def)
%            Number of atoms       :   18 (  17 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    2 (   2   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   15 (  15   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0] : multiply(identity,X0) = X0,
    file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_identity) ).

fof(f7,axiom,
    ! [X2,X0,X1] : greatest_lower_bound(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(greatest_lower_bound(X0,X1),X2),
    file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',associativity_of_glb) ).

fof(f12,axiom,
    ! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X0,X1)) = X0,
    file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',glb_absorbtion) ).

fof(f15,axiom,
    ! [X2,X0,X1] : multiply(least_upper_bound(X0,X1),X2) = least_upper_bound(multiply(X0,X2),multiply(X1,X2)),
    file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_lub2) ).

fof(f17,axiom,
    least_upper_bound(identity,a) = a,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p04c_1) ).

fof(f18,plain,
    a = least_upper_bound(identity,a),
    inference(reorient_equations,[],[f17]) ).

fof(f19,axiom,
    least_upper_bound(identity,b) = b,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p04c_2) ).

fof(f20,plain,
    b = least_upper_bound(identity,b),
    inference(reorient_equations,[],[f19]) ).

fof(f21,negated_conjecture,
    greatest_lower_bound(identity,multiply(a,b)) != identity,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p04c) ).

fof(f22,plain,
    identity != greatest_lower_bound(identity,multiply(a,b)),
    inference(reorient_equations,[],[f21]) ).

fof(f27,plain,
    identity = greatest_lower_bound(identity,b),
    inference(superposition,[],[f12,f20]) ).

fof(f128,plain,
    ! [X2,X0,X1] : multiply(X0,X2) = greatest_lower_bound(multiply(X0,X2),multiply(least_upper_bound(X0,X1),X2)),
    inference(superposition,[],[f12,f15]) ).

fof(f153,plain,
    ! [X0] : greatest_lower_bound(identity,X0) = greatest_lower_bound(identity,greatest_lower_bound(b,X0)),
    inference(superposition,[],[f7,f27]) ).

fof(f2823,plain,
    ! [X0] : multiply(identity,X0) = greatest_lower_bound(multiply(identity,X0),multiply(a,X0)),
    inference(superposition,[],[f128,f18]) ).

fof(f2869,plain,
    ! [X0] : greatest_lower_bound(X0,multiply(a,X0)) = X0,
    inference(forward_demodulation,[],[f2823,f1]) ).

fof(f2978,plain,
    greatest_lower_bound(identity,multiply(a,b)) = greatest_lower_bound(identity,b),
    inference(superposition,[],[f153,f2869]) ).

fof(f2979,plain,
    identity = greatest_lower_bound(identity,multiply(a,b)),
    inference(forward_demodulation,[],[f2978,f27]) ).

fof(f2991,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f2979,f22]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GRP171-2 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.37  % Computer : n010.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 09:35:47 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.41/0.53  % (696132)Will run a generic schedule for satisfiability detection.
% 0.41/0.53  % (696137)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1599348707_2999 on theBenchmark for (2999ds/0Mi)
% 0.41/0.53  % TRYING [1]
% 0.41/0.53  % TRYING [2]
% 0.41/0.53  % TRYING [3]
% 0.41/0.53  % TRYING [4]
% 0.41/0.53  % (696143)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2978516264:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.41/0.53  % (696139)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3020616941:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.41/0.53  % (696140)dis+10_1_sil=32000:sp=arity:random_seed=1789498544:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.41/0.53  % (696141)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=113655024:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.41/0.53  % (696142)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2070331024:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.41/0.53  % (696138)% WARNING: option uhcvi not known.
% 0.41/0.53  % (696138)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2949406881:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.41/0.53  % TRYING [5]
% 0.41/0.53  % (696140)Instruction limit reached! 
% 0.41/0.53  % (696140)------------------------------
% 0.41/0.53  % (696140)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.41/0.53  % (696140)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.41/0.53  % (696140)CaDiCaL version: 2.1.3
% 0.41/0.53  % (696140)Termination reason: Instruction limit
% 0.41/0.53  % (696140)Termination phase: Saturation
% 0.41/0.53  % (696140)Time elapsed: 0.058 s
% 0.41/0.53  % (696140)Peak memory usage: 12 MB
% 0.41/0.53  % (696140)Instructions burned: 103 (million)
% 0.41/0.53  % (696141)Instruction limit reached! 
% 0.41/0.53  % (696141)------------------------------
% 0.41/0.53  % (696141)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.41/0.53  % (696141)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.41/0.53  % (696141)CaDiCaL version: 2.1.3
% 0.41/0.53  % (696141)Termination reason: Instruction limit
% 0.41/0.53  % (696141)Termination phase: Saturation
% 0.41/0.53  % (696141)Time elapsed: 0.068 s
% 0.41/0.53  % (696141)Peak memory usage: 12 MB
% 0.41/0.53  % (696141)Instructions burned: 116 (million)
% 0.41/0.53  % TRYING [6]
% 0.41/0.53  % (696151)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=4243876652:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.41/0.53  % (696142)Instruction limit reached! 
% 0.41/0.53  % (696142)------------------------------
% 0.41/0.53  % (696142)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.41/0.53  % (696142)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.41/0.53  % (696142)CaDiCaL version: 2.1.3
% 0.41/0.53  % (696142)Termination reason: Instruction limit
% 0.41/0.53  % (696142)Termination phase: Saturation
% 0.41/0.53  % (696142)Time elapsed: 0.078 s
% 0.41/0.53  % (696142)Peak memory usage: 13 MB
% 0.41/0.53  % (696142)Instructions burned: 132 (million)
% 0.41/0.53  % TRYING [1]
% 0.41/0.53  % TRYING [2]
% 0.41/0.53  % TRYING [3]
% 0.41/0.53  % (696138) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-696132-696138"...
% 0.41/0.53  % (696138)...printing done.
% 0.41/0.53  % (696138)Refutation found. Thanks to Tanya!
% 0.41/0.53  % SZS status Unsatisfiable for theBenchmark
% 0.41/0.53  % SZS output start Proof for theBenchmark
% See solution above
% 0.41/0.53  % (696138)------------------------------
% 0.41/0.53  % (696138)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.41/0.53  % (696138)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.41/0.53  % (696138)CaDiCaL version: 2.1.3
% 0.41/0.53  % (696138)Termination reason: Refutation
% 0.41/0.53  % (696138)Time elapsed: 0.073 s
% 0.41/0.53  % (696138)Peak memory usage: 13 MB
% 0.41/0.53  % (696138)Instructions burned: 124 (million)
% 0.41/0.53  % (696132)Success in time 0.119 s
% 0.41/0.53  % Vampire exiting
%------------------------------------------------------------------------------