↑ 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  : REL023+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 : n006.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:20 PM UTC 2026

% Result   : Theorem 1.18s 0.64s
% Output   : Refutation 1.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   19
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   65 (  65 unt;   0 def)
%            Number of atoms       :   65 (  64 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    7 (   7   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   6 con; 0-2 aty)
%            Number of variables   :   91 (  88   !;   3   ?)

% 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(f3,axiom,
    ! [X0,X1] : X0 = join(complement(join(complement(X0),complement(X1))),complement(join(complement(X0),X1))),
    file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',maddux3_a_kind_of_de_Morgan) ).

fof(f4,axiom,
    ! [X0,X1] : meet(X0,X1) = complement(join(complement(X0),complement(X1))),
    file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',maddux4_definiton_of_meet) ).

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

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

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(f13,axiom,
    ! [X0] : zero = meet(X0,complement(X0)),
    file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',def_zero) ).

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

fof(f15,negated_conjecture,
    ~ ! [X0,X1,X2] : join(composition(meet(X0,converse(X1)),meet(X1,X2)),composition(X0,meet(X1,X2))) = composition(X0,meet(X1,X2)),
    inference(negated_conjecture,[status(cth)],[f14]) ).

fof(f16,plain,
    ? [X0,X1,X2] : composition(X0,meet(X1,X2)) != join(composition(meet(X0,converse(X1)),meet(X1,X2)),composition(X0,meet(X1,X2))),
    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(f19,plain,
    ! [X0,X1] : join(complement(join(complement(X0),complement(X1))),complement(join(complement(X0),X1))) = X0,
    inference(cnf_transformation,[],[f3]) ).

fof(f20,plain,
    ! [X0,X1] : complement(join(complement(X0),complement(X1))) = meet(X0,X1),
    inference(cnf_transformation,[],[f4]) ).

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

fof(f23,plain,
    ! [X2,X0,X1] : composition(join(X0,X1),X2) = join(composition(X0,X2),composition(X1,X2)),
    inference(cnf_transformation,[],[f7]) ).

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(f29,plain,
    ! [X0] : zero = meet(X0,complement(X0)),
    inference(cnf_transformation,[],[f13]) ).

fof(f30,plain,
    composition(sK0,meet(sK1,sK2)) != join(composition(meet(sK0,converse(sK1)),meet(sK1,sK2)),composition(sK0,meet(sK1,sK2))),
    inference(cnf_transformation,[],[f16]) ).

fof(f31,plain,
    ! [X0] : zero = complement(join(complement(X0),complement(complement(X0)))),
    inference(definition_unfolding,[],[f29,f20]) ).

fof(f32,plain,
    composition(sK0,complement(join(complement(sK1),complement(sK2)))) != join(composition(complement(join(complement(sK0),complement(converse(sK1)))),complement(join(complement(sK1),complement(sK2)))),composition(sK0,complement(join(complement(sK1),complement(sK2))))),
    inference(definition_unfolding,[],[f30,f20,f20,f20,f20]) ).

fof(f35,plain,
    ! [X0,X1] : join(complement(join(complement(X0),X1)),complement(join(complement(X0),complement(X1)))) = X0,
    inference(forward_demodulation,[],[f19,f17]) ).

fof(f36,plain,
    zero = complement(top),
    inference(forward_demodulation,[],[f31,f28]) ).

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

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

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

fof(f222,plain,
    one = converse(one),
    inference(superposition,[],[f217,f22]) ).

fof(f229,plain,
    ! [X0] : composition(one,X0) = X0,
    inference(superposition,[],[f217,f222]) ).

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

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

fof(f358,plain,
    composition(sK0,complement(join(complement(sK1),complement(sK2)))) != composition(join(complement(join(complement(sK0),complement(converse(sK1)))),sK0),complement(join(complement(sK1),complement(sK2)))),
    inference(superposition,[],[f32,f23]) ).

fof(f367,plain,
    composition(sK0,complement(join(complement(sK1),complement(sK2)))) != composition(join(sK0,complement(join(complement(sK0),complement(converse(sK1))))),complement(join(complement(sK1),complement(sK2)))),
    inference(forward_demodulation,[],[f358,f17]) ).

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

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

fof(f864,plain,
    ! [X0,X1] : complement(X1) = join(complement(X1),composition(converse(X0),complement(composition(X0,X1)))),
    inference(forward_demodulation,[],[f27,f17]) ).

fof(f1110,plain,
    ! [X0] : complement(X0) = join(complement(X0),complement(composition(one,X0))),
    inference(superposition,[],[f864,f217]) ).

fof(f1118,plain,
    ! [X0] : complement(X0) = join(complement(X0),complement(X0)),
    inference(forward_demodulation,[],[f1110,f229]) ).

fof(f1135,plain,
    ! [X0] : top = join(complement(X0),join(complement(X0),complement(complement(X0)))),
    inference(superposition,[],[f433,f1118]) ).

fof(f1136,plain,
    ! [X0] : top = join(top,complement(X0)),
    inference(forward_demodulation,[],[f1135,f413]) ).

fof(f1228,plain,
    ! [X0] : join(complement(join(complement(X0),top)),complement(join(complement(X0),zero))) = X0,
    inference(superposition,[],[f35,f36]) ).

fof(f1231,plain,
    ! [X0] : join(complement(join(complement(X0),complement(X0))),complement(top)) = X0,
    inference(superposition,[],[f35,f28]) ).

fof(f1243,plain,
    ! [X0] : join(complement(top),complement(join(complement(X0),complement(X0)))) = X0,
    inference(forward_demodulation,[],[f1231,f17]) ).

fof(f1246,plain,
    ! [X0] : join(complement(join(complement(X0),top)),complement(join(zero,complement(X0)))) = X0,
    inference(forward_demodulation,[],[f1228,f17]) ).

fof(f1261,plain,
    ! [X0] : join(complement(top),complement(complement(X0))) = X0,
    inference(forward_demodulation,[],[f1243,f1118]) ).

fof(f1263,plain,
    ! [X0] : join(complement(join(zero,complement(X0))),complement(join(complement(X0),top))) = X0,
    inference(forward_demodulation,[],[f1246,f17]) ).

fof(f1269,plain,
    ! [X0] : join(zero,complement(complement(X0))) = X0,
    inference(forward_demodulation,[],[f1261,f36]) ).

fof(f1271,plain,
    ! [X0] : join(complement(join(zero,complement(X0))),complement(join(top,complement(X0)))) = X0,
    inference(forward_demodulation,[],[f1263,f17]) ).

fof(f1275,plain,
    ! [X0] : join(complement(join(top,complement(X0))),complement(join(zero,complement(X0)))) = X0,
    inference(forward_demodulation,[],[f1271,f17]) ).

fof(f1278,plain,
    ! [X0] : join(complement(top),complement(join(zero,complement(X0)))) = X0,
    inference(forward_demodulation,[],[f1275,f1136]) ).

fof(f1280,plain,
    ! [X0] : join(zero,complement(join(zero,complement(X0)))) = X0,
    inference(forward_demodulation,[],[f1278,f36]) ).

fof(f1628,plain,
    ! [X0] : complement(X0) = join(zero,complement(X0)),
    inference(superposition,[],[f1280,f1269]) ).

fof(f1666,plain,
    ! [X0] : complement(complement(X0)) = X0,
    inference(superposition,[],[f1628,f1269]) ).

fof(f1715,plain,
    ! [X0] : join(X0,X0) = X0,
    inference(superposition,[],[f1118,f1666]) ).

fof(f1807,plain,
    ! [X0,X1] : join(X0,X1) = join(X0,join(X0,X1)),
    inference(superposition,[],[f18,f1715]) ).

fof(f2631,plain,
    ! [X0,X1] : join(complement(join(complement(X0),X1)),X0) = X0,
    inference(superposition,[],[f1807,f35]) ).

fof(f2724,plain,
    ! [X0,X1] : join(X0,complement(join(complement(X0),X1))) = X0,
    inference(forward_demodulation,[],[f2631,f17]) ).

fof(f4164,plain,
    composition(sK0,complement(join(complement(sK1),complement(sK2)))) != composition(sK0,complement(join(complement(sK1),complement(sK2)))),
    inference(superposition,[],[f367,f2724]) ).

fof(f4165,plain,
    $false,
    inference(trivial_inequality_removal,[],[f4164]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : REL023+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 : n006.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:52:25 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
% 1.18/0.64  % (3417749)Will run a generic schedule for satisfiability detection.
% 1.18/0.64  % (3417764)dis+10_1_sil=32000:sp=arity:random_seed=3583311830:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.18/0.64  % (3417762)% WARNING: option uhcvi not known.
% 1.18/0.64  % (3417761)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=874866675_2999 on theBenchmark for (2999ds/0Mi)
% 1.18/0.64  % (3417762)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=920524876:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.18/0.64  % (3417763)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2283193054:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.18/0.64  % (3417765)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3039936699:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.18/0.64  % (3417767)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=483228406:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.18/0.64  % (3417766)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2397389499:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.18/0.64  % TRYING [1]
% 1.18/0.64  % TRYING [2]
% 1.18/0.64  % TRYING [3]
% 1.18/0.64  % TRYING [4]
% 1.18/0.64  % (3417764)Instruction limit reached! 
% 1.18/0.64  % (3417764)------------------------------
% 1.18/0.64  % (3417764)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.18/0.64  % (3417764)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.18/0.64  % (3417764)CaDiCaL version: 2.1.3
% 1.18/0.64  % (3417764)Termination reason: Instruction limit
% 1.18/0.64  % (3417764)Termination phase: Saturation
% 1.18/0.64  % (3417764)Time elapsed: 0.033 s
% 1.18/0.64  % (3417764)Peak memory usage: 12 MB
% 1.18/0.64  % (3417764)Instructions burned: 107 (million)
% 1.18/0.64  % (3417787)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3978801491:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.18/0.64  % TRYING [1]
% 1.18/0.64  % TRYING [2]
% 1.18/0.64  % TRYING [3]
% 1.18/0.64  % TRYING [4]
% 1.18/0.64  % TRYING [5]
% 1.18/0.64  % (3417765)Instruction limit reached! 
% 1.18/0.64  % (3417765)------------------------------
% 1.18/0.64  % (3417765)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.18/0.64  % (3417765)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.18/0.64  % (3417765)CaDiCaL version: 2.1.3
% 1.18/0.64  % (3417765)Termination reason: Instruction limit
% 1.18/0.64  % (3417765)Termination phase: Saturation
% 1.18/0.64  % (3417765)Time elapsed: 0.069 s
% 1.18/0.64  % (3417765)Peak memory usage: 12 MB
% 1.18/0.64  % (3417765)Instructions burned: 117 (million)
% 1.18/0.64  % TRYING [5]
% 1.18/0.64  % (3417766)Instruction limit reached! 
% 1.18/0.64  % (3417766)------------------------------
% 1.18/0.64  % (3417766)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.18/0.64  % (3417766)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.18/0.64  % (3417766)CaDiCaL version: 2.1.3
% 1.18/0.64  % (3417766)Termination reason: Instruction limit
% 1.18/0.64  % (3417766)Termination phase: Saturation
% 1.18/0.64  % (3417766)Time elapsed: 0.075 s
% 1.18/0.64  % (3417766)Peak memory usage: 13 MB
% 1.18/0.64  % (3417766)Instructions burned: 133 (million)
% 1.18/0.64  % (3417807)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=11297374:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 1.18/0.64  % (3417767)Instruction limit reached! 
% 1.18/0.64  % (3417767)------------------------------
% 1.18/0.64  % (3417767)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.18/0.64  % (3417767)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.18/0.64  % (3417767)CaDiCaL version: 2.1.3
% 1.18/0.64  % (3417767)Termination reason: Instruction limit
% 1.18/0.64  % (3417767)Termination phase: Saturation
% 1.18/0.64  % (3417767)Time elapsed: 0.095 s
% 1.18/0.64  % (3417767)Peak memory usage: 12 MB
% 1.18/0.64  % (3417767)Instructions burned: 159 (million)
% 1.18/0.64  % (3417811)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=962536795:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.18/0.64  % (3417821)ott-21_1_sil=16000:fs=off:random_seed=3751499390:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.18/0.64  % (3417811) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3417749-3417811"...
% 1.18/0.64  % (3417811)...printing done.
% 1.18/0.64  % (3417811)Refutation found. Thanks to Tanya!
% 1.18/0.64  % SZS status Theorem for theBenchmark
% 1.18/0.64  % SZS output start Proof for theBenchmark
% See solution above
% 1.18/0.64  % (3417811)------------------------------
% 1.18/0.64  % (3417811)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.18/0.64  % (3417811)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.18/0.64  % (3417811)CaDiCaL version: 2.1.3
% 1.18/0.64  % (3417811)Termination reason: Refutation
% 1.18/0.64  % (3417811)Time elapsed: 0.071 s
% 1.18/0.64  % (3417811)Peak memory usage: 13 MB
% 1.18/0.64  % (3417811)Instructions burned: 127 (million)
% 1.18/0.64  % (3417749)Success in time 0.216 s
% 1.18/0.64  % Vampire exiting
%------------------------------------------------------------------------------