↑ Up

Vampire-SAT---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : REL002+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT

% Computer : n020.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 12:34:10 PM UTC 2026

% Result   : Theorem 0.16s 0.48s
% Output   : Refutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   37 (  37 unt;   0 def)
%            Number of atoms       :   37 (  36 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    4 (   4   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-2 aty)
%            Number of variables   :   53 (  52   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] : join(X0,X1) = join(X1,X0),
    file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',maddux1_join_commutativity) ).

fof(f2,axiom,
    ! [X0,X1,X2] : join(X0,join(X1,X2)) = join(join(X0,X1),X2),
    file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',maddux2_join_associativity) ).

fof(f5,axiom,
    ! [X0,X1,X2] : composition(X0,composition(X1,X2)) = composition(composition(X0,X1),X2),
    file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',composition_associativity) ).

fof(f6,axiom,
    ! [X0] : composition(X0,one) = X0,
    file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',composition_identity) ).

fof(f8,axiom,
    ! [X0] : converse(converse(X0)) = X0,
    file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',converse_idempotence) ).

fof(f10,axiom,
    ! [X0,X1] : converse(composition(X0,X1)) = composition(converse(X1),converse(X0)),
    file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',converse_multiplicativity) ).

fof(f11,axiom,
    ! [X0,X1] : join(composition(converse(X0),complement(composition(X0,X1))),complement(X1)) = complement(X1),
    file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',converse_cancellativity) ).

fof(f12,axiom,
    ! [X0] : top = join(X0,complement(X0)),
    file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',def_top) ).

fof(f14,conjecture,
    ! [X0] : join(X0,top) = top,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

fof(f15,negated_conjecture,
    ~ ! [X0] : join(X0,top) = top,
    inference(negated_conjecture,[status(cth)],[f14]) ).

fof(f16,plain,
    ? [X0] : top != join(X0,top),
    inference(ennf_transformation,[],[f15]) ).

fof(f17,plain,
    ! [X0,X1] : join(X0,X1) = join(X1,X0),
    inference(cnf_transformation,[],[f1]) ).

fof(f18,plain,
    ! [X2,X0,X1] : join(X0,join(X1,X2)) = join(join(X0,X1),X2),
    inference(cnf_transformation,[],[f2]) ).

fof(f21,plain,
    ! [X2,X0,X1] : composition(X0,composition(X1,X2)) = composition(composition(X0,X1),X2),
    inference(cnf_transformation,[],[f5]) ).

fof(f22,plain,
    ! [X0] : composition(X0,one) = X0,
    inference(cnf_transformation,[],[f6]) ).

fof(f24,plain,
    ! [X0] : converse(converse(X0)) = X0,
    inference(cnf_transformation,[],[f8]) ).

fof(f26,plain,
    ! [X0,X1] : converse(composition(X0,X1)) = composition(converse(X1),converse(X0)),
    inference(cnf_transformation,[],[f10]) ).

fof(f27,plain,
    ! [X0,X1] : complement(X1) = join(composition(converse(X0),complement(composition(X0,X1))),complement(X1)),
    inference(cnf_transformation,[],[f11]) ).

fof(f28,plain,
    ! [X0] : top = join(X0,complement(X0)),
    inference(cnf_transformation,[],[f12]) ).

fof(f30,plain,
    top != join(sK0,top),
    inference(cnf_transformation,[],[f16]) ).

fof(f51,plain,
    ! [X0,X1] : converse(composition(converse(X0),X1)) = composition(converse(X1),X0),
    inference(superposition,[],[f26,f24]) ).

fof(f52,plain,
    ! [X0,X1] : join(X0,join(complement(X0),X1)) = join(top,X1),
    inference(superposition,[],[f18,f28]) ).

fof(f61,plain,
    ! [X0,X1] : top = join(X0,join(X1,complement(join(X0,X1)))),
    inference(superposition,[],[f28,f18]) ).

fof(f72,plain,
    ! [X0,X1] : composition(X0,X1) = composition(X0,composition(one,X1)),
    inference(superposition,[],[f21,f22]) ).

fof(f406,plain,
    ! [X0] : converse(converse(X0)) = composition(converse(one),X0),
    inference(superposition,[],[f51,f22]) ).

fof(f429,plain,
    ! [X0] : composition(converse(one),X0) = X0,
    inference(forward_demodulation,[],[f406,f24]) ).

fof(f443,plain,
    ! [X0,X1] : join(top,X0) = join(X1,join(X0,complement(X1))),
    inference(superposition,[],[f52,f17]) ).

fof(f469,plain,
    ! [X0] : complement(X0) = join(complement(composition(one,X0)),complement(X0)),
    inference(superposition,[],[f27,f429]) ).

fof(f475,plain,
    ! [X0] : composition(one,X0) = composition(converse(one),X0),
    inference(superposition,[],[f72,f429]) ).

fof(f479,plain,
    ! [X0] : composition(one,X0) = X0,
    inference(forward_demodulation,[],[f475,f429]) ).

fof(f483,plain,
    ! [X0] : complement(X0) = join(complement(X0),complement(composition(one,X0))),
    inference(forward_demodulation,[],[f469,f17]) ).

fof(f488,plain,
    ! [X0] : complement(X0) = join(complement(X0),complement(X0)),
    inference(forward_demodulation,[],[f483,f479]) ).

fof(f834,plain,
    ! [X0] : top = join(complement(X0),join(complement(X0),complement(complement(X0)))),
    inference(superposition,[],[f61,f488]) ).

fof(f837,plain,
    ! [X0] : top = join(top,complement(X0)),
    inference(forward_demodulation,[],[f834,f443]) ).

fof(f902,plain,
    ! [X0] : top = join(X0,top),
    inference(superposition,[],[f61,f837]) ).

fof(f969,plain,
    top != top,
    inference(superposition,[],[f30,f902]) ).

fof(f970,plain,
    $false,
    inference(trivial_inequality_removal,[],[f969]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : REL002+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38  % Computer : n020.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 22:51:04 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.41  Running first-order model finding
% 0.11/0.41  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.48  % (3853085)Will run a generic schedule for satisfiability detection.
% 0.16/0.48  % (3853096)% WARNING: option uhcvi not known.
% 0.16/0.48  % (3853096)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4175617013:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.16/0.48  % (3853095)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1755200870_2999 on theBenchmark for (2999ds/0Mi)
% 0.16/0.48  % (3853098)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=248991635:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.16/0.48  % (3853099)dis+10_1_sil=32000:sp=arity:random_seed=4084044346:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/0.48  % (3853102)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3039334513:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.16/0.48  % (3853101)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3010780661:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.16/0.48  % (3853100)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3985377849:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.16/0.48  % TRYING [1]
% 0.16/0.48  % TRYING [2]
% 0.16/0.48  % TRYING [3]
% 0.16/0.48  % TRYING [4]
% 0.16/0.48  % (3853100) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3853085-3853100"...
% 0.16/0.48  % (3853100)...printing done.
% 0.16/0.48  % (3853100)Refutation found. Thanks to Tanya!
% 0.16/0.48  % SZS status Theorem for theBenchmark
% 0.16/0.48  % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.49  % (3853100)------------------------------
% 0.16/0.49  % (3853100)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.49  % (3853100)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.49  % (3853100)CaDiCaL version: 2.1.3
% 0.16/0.49  % (3853100)Termination reason: Refutation
% 0.16/0.49  % (3853100)Time elapsed: 0.025 s
% 0.16/0.49  % (3853100)Peak memory usage: 12 MB
% 0.16/0.49  % (3853100)Instructions burned: 38 (million)
% 0.16/0.49  % (3853085)Success in time 0.068 s
% 0.16/0.49  % Vampire exiting
%------------------------------------------------------------------------------