↑ 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  : GRP140-1 : 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 : 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:16:56 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f5,axiom,
    ! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
    file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',symmetry_of_glb) ).

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

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(f11,axiom,
    ! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X0,X1)) = X0,
    file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',lub_absorbtion) ).

fof(f17,axiom,
    greatest_lower_bound(a,c) = c,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_glb1c_1) ).

fof(f18,plain,
    c = greatest_lower_bound(a,c),
    inference(reorient_equations,[],[f17]) ).

fof(f19,axiom,
    greatest_lower_bound(b,c) = c,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_glb1c_2) ).

fof(f20,plain,
    c = greatest_lower_bound(b,c),
    inference(reorient_equations,[],[f19]) ).

fof(f21,negated_conjecture,
    least_upper_bound(greatest_lower_bound(a,b),c) != greatest_lower_bound(a,b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ax_glb1c) ).

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

fof(f23,plain,
    c = greatest_lower_bound(c,a),
    inference(superposition,[],[f5,f18]) ).

fof(f24,plain,
    c = greatest_lower_bound(c,b),
    inference(superposition,[],[f5,f20]) ).

fof(f31,plain,
    greatest_lower_bound(a,b) != least_upper_bound(c,greatest_lower_bound(a,b)),
    inference(superposition,[],[f22,f6]) ).

fof(f34,plain,
    ! [X0,X1] : least_upper_bound(X1,greatest_lower_bound(X0,X1)) = X1,
    inference(superposition,[],[f11,f5]) ).

fof(f734,plain,
    ! [X0] : greatest_lower_bound(c,greatest_lower_bound(a,X0)) = greatest_lower_bound(c,X0),
    inference(superposition,[],[f7,f23]) ).

fof(f877,plain,
    ! [X0] : greatest_lower_bound(a,X0) = least_upper_bound(greatest_lower_bound(a,X0),greatest_lower_bound(c,X0)),
    inference(superposition,[],[f34,f734]) ).

fof(f881,plain,
    ! [X0] : greatest_lower_bound(a,X0) = least_upper_bound(greatest_lower_bound(c,X0),greatest_lower_bound(a,X0)),
    inference(forward_demodulation,[],[f877,f6]) ).

fof(f1204,plain,
    greatest_lower_bound(a,b) = least_upper_bound(c,greatest_lower_bound(a,b)),
    inference(superposition,[],[f881,f24]) ).

fof(f1228,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f1204,f31]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GRP140-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.37  % Computer : n002.cluster.edu
% 0.12/0.37  % Model    : x86_64 x86_64
% 0.12/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37  % Memory   : 8046.5625MB
% 0.12/0.37  % OS       : Linux 6.8.0-71-generic
% 0.12/0.37  % CPULimit : 300
% 0.12/0.37  % WCLimit  : 300
% 0.12/0.37  % DateTime : Sun Sep 27 09:35:21 UTC 2026
% 0.12/0.37  % CPUTime  : 
% 0.12/0.37  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.40  Running first-order model finding
% 0.12/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.37/0.47  % (3285573)Will run a generic schedule for satisfiability detection.
% 0.37/0.47  % (3285579)% WARNING: option uhcvi not known.
% 0.37/0.47  % (3285579)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=682482761:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.37/0.47  % (3285581)dis+10_1_sil=32000:sp=arity:random_seed=2674888154:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.37/0.47  % (3285582)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3559579056:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.37/0.47  % (3285583)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3651828379:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.37/0.47  % (3285578)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3789512113_2999 on theBenchmark for (2999ds/0Mi)
% 0.37/0.47  % (3285580)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2020968652:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.37/0.47  % (3285584)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1511459310:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.37/0.47  % TRYING [1]
% 0.37/0.47  % TRYING [2]
% 0.37/0.47  % TRYING [3]
% 0.37/0.47  % TRYING [4]
% 0.37/0.47  % (3285580) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3285573-3285580"...
% 0.37/0.47  % (3285580)...printing done.
% 0.37/0.47  % (3285580)Refutation found. Thanks to Tanya!
% 0.37/0.47  % SZS status Unsatisfiable for theBenchmark
% 0.37/0.47  % SZS output start Proof for theBenchmark
% See solution above
% 0.37/0.47  % (3285580)------------------------------
% 0.37/0.47  % (3285580)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.37/0.47  % (3285580)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.37/0.47  % (3285580)CaDiCaL version: 2.1.3
% 0.37/0.47  % (3285580)Termination reason: Refutation
% 0.37/0.47  % (3285580)Time elapsed: 0.025 s
% 0.37/0.47  % (3285580)Peak memory usage: 12 MB
% 0.37/0.47  % (3285580)Instructions burned: 40 (million)
% 0.37/0.47  % (3285573)Success in time 0.06 s
% 0.37/0.47  % Vampire exiting
%------------------------------------------------------------------------------