%------------------------------------------------------------------------------
% File : Vampire-SAT---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 SAT
% Computer : n003.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:39 PM UTC 2026
% Result : Theorem 0.32s 0.58s
% Output : Refutation 0.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 32 ( 21 unt; 2 def)
% Number of atoms : 47 ( 32 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 27 ( 12 ~; 7 |; 4 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 3 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 32 ( 0 sgn 29 !; 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(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,
! [X0,X1] : join(X0,X1) = join(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f19,plain,
! [X2,X0,X1] : join(X0,join(X1,X2)) = join(join(X0,X1),X2),
inference(cnf_transformation,[],[f2]) ).
fof(f20,plain,
! [X0,X1] : join(complement(join(complement(X0),complement(X1))),complement(join(complement(X0),X1))) = X0,
inference(cnf_transformation,[],[f3]) ).
fof(f21,plain,
! [X0,X1] : complement(join(complement(X0),complement(X1))) = meet(X0,X1),
inference(cnf_transformation,[],[f4]) ).
fof(f31,plain,
meet(sK1,sK2) = join(sK0,meet(sK1,sK2)),
inference(cnf_transformation,[],[f17]) ).
fof(f32,plain,
( sK1 != join(sK0,sK1)
| sK2 != join(sK0,sK2) ),
inference(cnf_transformation,[],[f17]) ).
fof(f34,plain,
complement(join(complement(sK1),complement(sK2))) = join(sK0,complement(join(complement(sK1),complement(sK2)))),
inference(definition_unfolding,[],[f31,f21,f21]) ).
fof(f36,definition,
( spl3_1
<=> sK2 = join(sK0,sK2) ),
introduced(definition,[new_symbols(definition,[spl3_1])],[avatar_definition]) ).
fof(f38,plain,
( sK2 != join(sK0,sK2)
| spl3_1 ),
inference(avatar_component_clause,[],[f36]) ).
fof(f40,definition,
( spl3_2
<=> sK1 = join(sK0,sK1) ),
introduced(definition,[new_symbols(definition,[spl3_2])],[avatar_definition]) ).
fof(f43,plain,
( ~ spl3_1
| ~ spl3_2 ),
inference(avatar_split_clause,[],[f32,f40,f36]) ).
fof(f57,plain,
! [X0] : join(complement(join(complement(sK1),complement(sK2))),X0) = join(sK0,join(complement(join(complement(sK1),complement(sK2))),X0)),
inference(superposition,[],[f19,f34]) ).
fof(f119,plain,
! [X0,X1] : join(complement(join(complement(X0),X1)),complement(join(complement(X0),complement(X1)))) = X0,
inference(forward_demodulation,[],[f20,f18]) ).
fof(f120,plain,
! [X0,X1] : join(complement(join(X0,complement(X1))),complement(join(complement(X1),complement(X0)))) = X1,
inference(superposition,[],[f119,f18]) ).
fof(f131,plain,
sK1 = join(sK0,sK1),
inference(superposition,[],[f57,f119]) ).
fof(f133,plain,
spl3_2,
inference(avatar_split_clause,[],[f131,f40]) ).
fof(f1824,plain,
sK2 = join(sK0,sK2),
inference(superposition,[],[f57,f120]) ).
fof(f1836,plain,
( $false
| spl3_1 ),
inference(forward_subsumption_resolution,[],[f1824,f38]) ).
fof(f1837,plain,
spl3_1,
inference(avatar_contradiction_clause,[],[f1836]) ).
cnf(s1,plain,
( ~ spl3_1
| ~ spl3_2 ),
inference(sat_conversion,[],[f43]) ).
cnf(s2,plain,
spl3_2,
inference(sat_conversion,[],[f133]) ).
cnf(s3,plain,
spl3_1,
inference(sat_conversion,[],[f1837]) ).
cnf(s4,plain,
$false,
inference(rat,[],[s1,s2,s3]) ).
fof(f1866,plain,
$false,
inference(avatar_sat_refutation,[],[s4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : REL046+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.19/0.44 % Computer : n003.cluster.edu
% 0.19/0.44 % Model : x86_64 x86_64
% 0.19/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.44 % Memory : 8046.5625MB
% 0.19/0.44 % OS : Linux 6.8.0-71-generic
% 0.19/0.44 % CPULimit : 300
% 0.19/0.44 % WCLimit : 300
% 0.19/0.44 % DateTime : Sun Sep 27 22:58:56 UTC 2026
% 0.19/0.45 % CPUTime :
% 0.19/0.45 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.24/0.50 Running first-order model finding
% 0.24/0.50 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.32/0.58 % (1021300)Will run a generic schedule for satisfiability detection.
% 0.32/0.58 % (1021308)dis+10_1_sil=32000:sp=arity:random_seed=1568068290:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.32/0.58 % (1021307)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1863255167:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.32/0.58 % (1021306)% WARNING: option uhcvi not known.
% 0.32/0.58 % (1021311)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1488816277:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.32/0.58 % (1021306)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1617767682:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.32/0.58 % (1021305)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1481915543_2999 on theBenchmark for (2999ds/0Mi)
% 0.32/0.58 % (1021309)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3261217651:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.32/0.58 % (1021310)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3440704518:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.32/0.58 % TRYING [1]
% 0.32/0.58 % TRYING [2]
% 0.32/0.58 % TRYING [3]
% 0.32/0.58 % TRYING [4]
% 0.32/0.58 % (1021308) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1021300-1021308"...
% 0.32/0.58 % (1021308)...printing done.
% 0.32/0.58 % (1021308)Refutation found. Thanks to Tanya!
% 0.32/0.58 % SZS status Theorem for theBenchmark
% 0.32/0.58 % SZS output start Proof for theBenchmark
% See solution above
% 0.32/0.58 % (1021308)------------------------------
% 0.32/0.58 % (1021308)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.32/0.58 % (1021308)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.32/0.58 % (1021308)CaDiCaL version: 2.1.3
% 0.32/0.58 % (1021308)Termination reason: Refutation
% 0.32/0.58 % (1021308)Time elapsed: 0.040 s
% 0.32/0.58 % (1021308)Peak memory usage: 13 MB
% 0.32/0.58 % (1021308)Instructions burned: 78 (million)
% 0.32/0.58 % (1021300)Success in time 0.065 s
% 0.32/0.58 % Vampire exiting
%------------------------------------------------------------------------------