%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : REL046+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n009.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:07 PM UTC 2026
% Result : Theorem 3.64s 1.48s
% Output : Refutation 3.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 23 ( 17 unt; 0 def)
% Number of atoms : 33 ( 32 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 20 ( 10 ~; 4 |; 4 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 6 ( 2 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 : 32 ( 29 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : join(X0,X1) = join(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',maddux1_join_commutativity) ).
fof(f2,axiom,
! [X0,X1,X2] : join(X0,join(X1,X2)) = join(join(X0,X1),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',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/theBenchmark.p',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/theBenchmark.p',maddux4_definiton_of_meet) ).
fof(f14,conjecture,
! [X0,X1,X2] :
( join(X0,meet(X1,X2)) = meet(X1,X2)
=> ( join(X0,X1) = X1
& join(X0,X2) = X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f15,negated_conjecture,
~ ! [X0,X1,X2] :
( join(X0,meet(X1,X2)) = meet(X1,X2)
=> ( join(X0,X1) = X1
& join(X0,X2) = X2 ) ),
inference(negated_conjecture,[status(cth)],[f14]) ).
fof(f16,plain,
? [X0,X1,X2] :
( ( join(X0,X1) != X1
| join(X0,X2) != X2 )
& join(X0,meet(X1,X2)) = meet(X1,X2) ),
inference(ennf_transformation,[],[f15]) ).
fof(f17,plain,
( ( sK1 != join(sK0,sK1)
| sK2 != join(sK0,sK2) )
& meet(sK1,sK2) = join(sK0,meet(sK1,sK2)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f16]) ).
fof(f18,plain,
meet(sK1,sK2) = join(sK0,meet(sK1,sK2)),
inference(cnf_transformation,[],[f17]) ).
fof(f19,plain,
( sK2 != join(sK0,sK2)
| sK1 != join(sK0,sK1) ),
inference(cnf_transformation,[],[f17]) ).
fof(f20,plain,
! [X2,X0,X1] : join(X0,join(X1,X2)) = join(join(X0,X1),X2),
inference(cnf_transformation,[],[f2]) ).
fof(f21,plain,
! [X0,X1] : join(X0,X1) = join(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f22,plain,
! [X0,X1] : complement(join(complement(X0),complement(X1))) = meet(X0,X1),
inference(cnf_transformation,[],[f4]) ).
fof(f23,plain,
! [X0,X1] : join(complement(join(complement(X0),complement(X1))),complement(join(complement(X0),X1))) = X0,
inference(cnf_transformation,[],[f3]) ).
fof(f24,plain,
complement(join(complement(sK1),complement(sK2))) = join(sK0,complement(join(complement(sK1),complement(sK2)))),
inference(definition_unfolding,[],[f18,f22,f22]) ).
fof(f25,plain,
! [X0] : join(complement(join(complement(sK1),complement(sK2))),X0) = join(sK0,join(complement(join(complement(sK1),complement(sK2))),X0)),
inference(superposition,[],[f20,f24]) ).
fof(f45,plain,
! [X0,X1] : join(complement(join(complement(X0),X1)),complement(join(complement(X0),complement(X1)))) = X0,
inference(forward_demodulation,[],[f23,f21]) ).
fof(f47,plain,
! [X0,X1] : join(complement(join(X0,complement(X1))),complement(join(complement(X1),complement(X0)))) = X1,
inference(superposition,[],[f45,f21]) ).
fof(f52,plain,
sK1 = join(sK0,sK1),
inference(superposition,[],[f25,f45]) ).
fof(f316,plain,
sK2 = join(sK0,sK2),
inference(superposition,[],[f25,f47]) ).
fof(f336,plain,
( sK2 != sK2
| sK1 != join(sK0,sK1) ),
inference(superposition,[],[f19,f316]) ).
fof(f341,plain,
sK1 != join(sK0,sK1),
inference(trivial_inequality_removal,[],[f336]) ).
fof(f344,plain,
$false,
inference(forward_subsumption_resolution,[],[f341,f52]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : REL046+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n009.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 27 22:57:15 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.64/1.48 % (2500148)Detected formulas, will run a generic FOF schedule.
% 3.64/1.48 % (2500153)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=3971653194:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.64/1.48 % (2500159)dis-21_1_sil=8000:lcm=predicate:random_seed=1090564073:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 3.64/1.48 % (2500155)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=2908259394:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.64/1.48 % (2500154)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=1552225509:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.64/1.48 % (2500157)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2806821338:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.64/1.48 % (2500156)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1328138085:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.64/1.48 % (2500158)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2363423289:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.64/1.48 % (2500159)Refutation not found, incomplete strategy
% 3.64/1.48 % (2500159)------------------------------
% 3.64/1.48 % (2500159)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.64/1.48 % (2500159)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.64/1.48 % (2500159)CaDiCaL version: 2.1.3
% 3.64/1.48 % (2500159)Termination reason: Refutation not found, incomplete strategy
% 3.64/1.48 % (2500159)Time elapsed: 0.002 s
% 3.64/1.48 % (2500159)Peak memory usage: 88 MB
% 3.64/1.48 % (2500159)Instructions burned: 1 (million)
% 3.64/1.48 % (2500157)First to succeed.
% 3.64/1.48 % (2500157)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2500148"
% 3.64/1.48 % (2500156)Instruction limit reached!
% 3.64/1.48 % (2500156)------------------------------
% 3.64/1.48 % (2500156)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.64/1.48 % (2500156)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.64/1.48 % (2500156)CaDiCaL version: 2.1.3
% 3.64/1.48 % (2500156)Termination reason: Instruction limit
% 3.64/1.48 % (2500156)Termination phase: Saturation
% 3.64/1.48 % (2500156)Time elapsed: 0.058 s
% 3.64/1.48 % (2500156)Peak memory usage: 88 MB
% 3.64/1.48 % (2500156)Instructions burned: 109 (million)
% 3.64/1.48 % (2500158)Instruction limit reached!
% 3.64/1.48 % (2500158)------------------------------
% 3.64/1.48 % (2500158)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.64/1.48 % (2500158)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.64/1.48 % (2500158)CaDiCaL version: 2.1.3
% 3.64/1.48 % (2500158)Termination reason: Instruction limit
% 3.64/1.48 % (2500158)Termination phase: Saturation
% 3.64/1.48 % (2500158)Time elapsed: 0.084 s
% 3.64/1.48 % (2500158)Peak memory usage: 90 MB
% 3.64/1.48 % (2500158)Instructions burned: 140 (million)
% 3.64/1.48 % (2500167)lrs+10_1_sil=8000:sp=occurrence:random_seed=3425754957:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.64/1.48 % (2500159)------------------------------
% 3.64/1.48 % (2500159)------------------------------
% 3.64/1.48 % (2500168)lrs+10_1_sil=32000:urr=on:br=off:random_seed=232303137:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.64/1.48 % (2500157)Refutation found. Thanks to Tanya!
% 3.64/1.48 % SZS status Theorem for theBenchmark
% 3.64/1.48 % SZS output start Proof for theBenchmark
% See solution above
% 3.64/1.48 % (2500157)------------------------------
% 3.64/1.48 % (2500157)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.64/1.48 % (2500157)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.64/1.48 % (2500157)CaDiCaL version: 2.1.3
% 3.64/1.48 % (2500157)Termination reason: Refutation
% 3.64/1.48 % (2500157)Time elapsed: 0.009 s
% 3.64/1.48 % (2500157)Peak memory usage: 88 MB
% 3.64/1.48 % (2500157)Instructions burned: 14 (million)
% 3.64/1.48 % (2500157)------------------------------
% 3.64/1.48 % (2500157)------------------------------
% 3.64/1.48 % (2500148)Success in time 0.432 s
% 3.64/1.48 % Vampire exiting
%------------------------------------------------------------------------------