↑ 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+2 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n014.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 0.98s 0.63s
% Output   : Refutation 0.98s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   57 (  57 unt;   0 def)
%            Number of atoms       :   57 (  56 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   :   84 (  81   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] : join(X0,X1) = join(X1,X0),
    file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/benchmark/Axioms/REL001+0.ax',maddux4_definiton_of_meet) ).

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

fof(f6,axiom,
    ! [X0] : composition(X0,one) = X0,
    file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/REL001+0.ax',composition_distributivity) ).

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

fof(f10,axiom,
    ! [X0,X1] : converse(composition(X0,X1)) = composition(converse(X1),converse(X0)),
    file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/REL001+0.ax',converse_cancellativity) ).

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

fof(f13,axiom,
    ! [X0] : zero = meet(X0,complement(X0)),
    file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',def_zero) ).

fof(f17,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/sandbox2/benchmark/theBenchmark.p',goals) ).

fof(f18,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)],[f17]) ).

fof(f19,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,[],[f18]) ).

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

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

fof(f22,plain,
    ! [X0,X1] : join(complement(join(complement(X0),complement(X1))),complement(join(complement(X0),X1))) = X0,
    inference(cnf_transformation,[],[f3]) ).

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

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

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

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

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

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

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

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

fof(f32,plain,
    ! [X0] : zero = meet(X0,complement(X0)),
    inference(cnf_transformation,[],[f13]) ).

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

fof(f37,plain,
    ! [X0] : zero = complement(join(complement(X0),complement(complement(X0)))),
    inference(definition_unfolding,[],[f32,f23]) ).

fof(f41,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,[],[f36,f23,f23,f23,f23]) ).

fof(f44,plain,
    zero = complement(top),
    inference(forward_demodulation,[],[f37,f31]) ).

fof(f52,plain,
    ! [X0,X1] : join(complement(join(complement(X0),X1)),complement(join(complement(X0),complement(X1)))) = X0,
    inference(forward_demodulation,[],[f22,f20]) ).

fof(f54,plain,
    ! [X0,X1] : converse(composition(converse(X0),X1)) = composition(converse(X1),X0),
    inference(superposition,[],[f29,f27]) ).

fof(f217,plain,
    ! [X0,X1] : composition(X0,X1) = composition(X0,composition(one,X1)),
    inference(superposition,[],[f24,f25]) ).

fof(f280,plain,
    ! [X0] : converse(converse(X0)) = composition(converse(one),X0),
    inference(superposition,[],[f54,f25]) ).

fof(f301,plain,
    ! [X0] : composition(converse(one),X0) = X0,
    inference(forward_demodulation,[],[f280,f27]) ).

fof(f314,plain,
    ! [X0] : composition(one,X0) = composition(converse(one),X0),
    inference(superposition,[],[f217,f301]) ).

fof(f319,plain,
    ! [X0] : composition(one,X0) = X0,
    inference(forward_demodulation,[],[f314,f301]) ).

fof(f681,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,[],[f41,f26]) ).

fof(f691,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,[],[f681,f20]) ).

fof(f918,plain,
    ! [X0,X1] : complement(X1) = join(complement(X1),composition(converse(X0),complement(composition(X0,X1)))),
    inference(forward_demodulation,[],[f30,f20]) ).

fof(f1379,plain,
    ! [X0] : complement(X0) = join(complement(X0),complement(composition(one,X0))),
    inference(superposition,[],[f918,f301]) ).

fof(f1388,plain,
    ! [X0] : complement(X0) = join(complement(X0),complement(X0)),
    inference(forward_demodulation,[],[f1379,f319]) ).

fof(f1401,plain,
    zero = join(zero,zero),
    inference(superposition,[],[f1388,f44]) ).

fof(f1418,plain,
    ! [X0] : join(zero,X0) = join(zero,join(zero,X0)),
    inference(superposition,[],[f21,f1401]) ).

fof(f1655,plain,
    ! [X0] : join(complement(join(complement(X0),complement(X0))),complement(top)) = X0,
    inference(superposition,[],[f52,f31]) ).

fof(f1668,plain,
    ! [X0] : join(complement(top),complement(join(complement(X0),complement(X0)))) = X0,
    inference(forward_demodulation,[],[f1655,f20]) ).

fof(f1689,plain,
    ! [X0] : join(complement(top),complement(complement(X0))) = X0,
    inference(forward_demodulation,[],[f1668,f1388]) ).

fof(f1702,plain,
    ! [X0] : join(zero,complement(complement(X0))) = X0,
    inference(forward_demodulation,[],[f1689,f44]) ).

fof(f1719,plain,
    ! [X0] : join(zero,X0) = X0,
    inference(superposition,[],[f1418,f1702]) ).

fof(f1739,plain,
    ! [X0] : complement(complement(X0)) = X0,
    inference(superposition,[],[f1719,f1702]) ).

fof(f1858,plain,
    ! [X0] : join(X0,X0) = X0,
    inference(superposition,[],[f1388,f1739]) ).

fof(f1916,plain,
    ! [X0,X1] : join(X0,X1) = join(X0,join(X0,X1)),
    inference(superposition,[],[f21,f1858]) ).

fof(f2967,plain,
    ! [X0,X1] : join(complement(join(complement(X0),X1)),X0) = X0,
    inference(superposition,[],[f1916,f52]) ).

fof(f3071,plain,
    ! [X0,X1] : join(X0,complement(join(complement(X0),X1))) = X0,
    inference(forward_demodulation,[],[f2967,f20]) ).

fof(f3376,plain,
    composition(sK0,complement(join(complement(sK1),complement(sK2)))) != composition(sK0,complement(join(complement(sK1),complement(sK2)))),
    inference(superposition,[],[f691,f3071]) ).

fof(f3377,plain,
    $false,
    inference(trivial_inequality_removal,[],[f3376]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : REL023+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38  % Computer : n014.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:16 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.16/0.41  Running first-order model finding
% 0.16/0.41  Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.98/0.63  % (1257406)Will run a generic schedule for satisfiability detection.
% 0.98/0.63  % (1257416)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1710897757_2999 on theBenchmark for (2999ds/0Mi)
% 0.98/0.63  % TRYING [1]
% 0.98/0.63  % TRYING [2]
% 0.98/0.63  % TRYING [3]
% 0.98/0.63  % (1257417)% WARNING: option uhcvi not known.
% 0.98/0.63  % (1257418)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4260470158:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.98/0.63  % (1257419)dis+10_1_sil=32000:sp=arity:random_seed=2620521632:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.98/0.63  % (1257420)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4284740629:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.98/0.63  % (1257421)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=864193299:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.98/0.63  % (1257422)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2331447048:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.98/0.63  % (1257417)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2479433509:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.98/0.63  % TRYING [4]
% 0.98/0.63  % (1257419)Instruction limit reached! 
% 0.98/0.63  % (1257419)------------------------------
% 0.98/0.63  % (1257419)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.98/0.63  % (1257419)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.98/0.63  % (1257419)CaDiCaL version: 2.1.3
% 0.98/0.63  % (1257419)Termination reason: Instruction limit
% 0.98/0.63  % (1257419)Termination phase: Saturation
% 0.98/0.63  % (1257419)Time elapsed: 0.059 s
% 0.98/0.63  % (1257419)Peak memory usage: 13 MB
% 0.98/0.63  % (1257419)Instructions burned: 103 (million)
% 0.98/0.63  % (1257420)Instruction limit reached! 
% 0.98/0.63  % (1257420)------------------------------
% 0.98/0.63  % (1257420)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.98/0.63  % (1257420)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.98/0.63  % (1257420)CaDiCaL version: 2.1.3
% 0.98/0.63  % (1257420)Termination reason: Instruction limit
% 0.98/0.63  % (1257420)Termination phase: Saturation
% 0.98/0.63  % (1257420)Time elapsed: 0.070 s
% 0.98/0.63  % (1257420)Peak memory usage: 13 MB
% 0.98/0.63  % (1257420)Instructions burned: 117 (million)
% 0.98/0.63  % (1257464)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2124613443:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.98/0.63  % (1257421)Instruction limit reached! 
% 0.98/0.63  % (1257421)------------------------------
% 0.98/0.63  % (1257421)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.98/0.63  % (1257421)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.98/0.63  % (1257421)CaDiCaL version: 2.1.3
% 0.98/0.63  % (1257421)Termination reason: Instruction limit
% 0.98/0.63  % (1257421)Termination phase: Saturation
% 0.98/0.63  % (1257421)Time elapsed: 0.079 s
% 0.98/0.63  % (1257421)Peak memory usage: 13 MB
% 0.98/0.63  % (1257421)Instructions burned: 136 (million)
% 0.98/0.63  % TRYING [1]
% 0.98/0.63  % TRYING [2]
% 0.98/0.63  % (1257467)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1962372001:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 0.98/0.63  % TRYING [3]
% 0.98/0.63  % (1257422)Instruction limit reached! 
% 0.98/0.63  % (1257422)------------------------------
% 0.98/0.63  % (1257422)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.98/0.63  % (1257422)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.98/0.63  % (1257422)CaDiCaL version: 2.1.3
% 0.98/0.63  % (1257422)Termination reason: Instruction limit
% 0.98/0.63  % (1257422)Termination phase: Saturation
% 0.98/0.63  % (1257422)Time elapsed: 0.095 s
% 0.98/0.63  % (1257422)Peak memory usage: 13 MB
% 0.98/0.63  % (1257422)Instructions burned: 160 (million)
% 0.98/0.63  % (1257473)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=1378511025:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 0.98/0.63  % (1257483)ott-21_1_sil=16000:fs=off:random_seed=1943695969:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 0.98/0.63  % TRYING [5]
% 0.98/0.63  % TRYING [4]
% 0.98/0.63  % (1257473) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1257406-1257473"...
% 0.98/0.63  % (1257473)...printing done.
% 0.98/0.63  % (1257473)Refutation found. Thanks to Tanya!
% 0.98/0.63  % SZS status Theorem for theBenchmark
% 0.98/0.63  % SZS output start Proof for theBenchmark
% See solution above
% 0.98/0.63  % (1257473)------------------------------
% 0.98/0.63  % (1257473)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.98/0.63  % (1257473)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.98/0.63  % (1257473)CaDiCaL version: 2.1.3
% 0.98/0.63  % (1257473)Termination reason: Refutation
% 0.98/0.63  % (1257473)Time elapsed: 0.062 s
% 0.98/0.63  % (1257473)Peak memory usage: 13 MB
% 0.98/0.63  % (1257473)Instructions burned: 109 (million)
% 0.98/0.63  % (1257406)Success in time 0.207 s
% 0.98/0.63  % Vampire exiting
%------------------------------------------------------------------------------