%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : REL003+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:11 PM UTC 2026
% Result : Theorem 0.12s 0.46s
% Output : Refutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 40 ( 10 unt; 2 def)
% Number of atoms : 79 ( 37 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 68 ( 29 ~; 29 |; 4 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 3 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn 14 !; 2 ?)
% 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(f8,axiom,
! [X0] : converse(converse(X0)) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',converse_idempotence) ).
fof(f9,axiom,
! [X0,X1] : converse(join(X0,X1)) = join(converse(X0),converse(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',converse_additivity) ).
fof(f14,conjecture,
! [X0,X1] :
( ( join(X0,X1) = X1
=> join(converse(X0),converse(X1)) = converse(X1) )
& ( join(converse(X0),converse(X1)) = converse(X1)
=> join(X0,X1) = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f15,negated_conjecture,
~ ! [X0,X1] :
( ( join(X0,X1) = X1
=> join(converse(X0),converse(X1)) = converse(X1) )
& ( join(converse(X0),converse(X1)) = converse(X1)
=> join(X0,X1) = X1 ) ),
inference(negated_conjecture,[status(cth)],[f14]) ).
fof(f16,plain,
? [X0,X1] :
( ( converse(X1) != join(converse(X0),converse(X1))
& join(X0,X1) = X1 )
| ( join(X0,X1) != X1
& join(converse(X0),converse(X1)) = converse(X1) ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f17,plain,
! [X0,X1] : join(X0,X1) = join(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f24,plain,
! [X0] : converse(converse(X0)) = X0,
inference(cnf_transformation,[],[f8]) ).
fof(f25,plain,
! [X0,X1] : converse(join(X0,X1)) = join(converse(X0),converse(X1)),
inference(cnf_transformation,[],[f9]) ).
fof(f30,plain,
( sK1 != join(sK0,sK1)
| converse(sK1) != join(converse(sK0),converse(sK1)) ),
inference(cnf_transformation,[],[f16]) ).
fof(f31,plain,
( converse(sK1) = join(converse(sK0),converse(sK1))
| sK1 = join(sK0,sK1) ),
inference(cnf_transformation,[],[f16]) ).
fof(f34,definition,
( spl2_1
<=> converse(sK1) = join(converse(sK0),converse(sK1)) ),
introduced(definition,[new_symbols(definition,[spl2_1])],[avatar_definition]) ).
fof(f35,plain,
( converse(sK1) = join(converse(sK0),converse(sK1))
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f34]) ).
fof(f36,plain,
( converse(sK1) != join(converse(sK0),converse(sK1))
| spl2_1 ),
inference(avatar_component_clause,[],[f34]) ).
fof(f38,definition,
( spl2_2
<=> sK1 = join(sK0,sK1) ),
introduced(definition,[new_symbols(definition,[spl2_2])],[avatar_definition]) ).
fof(f39,plain,
( sK1 = join(sK0,sK1)
| ~ spl2_2 ),
inference(avatar_component_clause,[],[f38]) ).
fof(f40,plain,
( sK1 != join(sK0,sK1)
| spl2_2 ),
inference(avatar_component_clause,[],[f38]) ).
fof(f41,plain,
( ~ spl2_1
| ~ spl2_2 ),
inference(avatar_split_clause,[],[f30,f38,f34]) ).
fof(f42,plain,
( spl2_2
| spl2_1 ),
inference(avatar_split_clause,[],[f31,f34,f38]) ).
fof(f43,plain,
( converse(sK1) != join(converse(sK1),converse(sK0))
| spl2_1 ),
inference(forward_demodulation,[],[f36,f17]) ).
fof(f44,plain,
( sK1 = join(sK1,sK0)
| ~ spl2_2 ),
inference(forward_demodulation,[],[f39,f17]) ).
fof(f45,plain,
( converse(sK1) != converse(join(sK1,sK0))
| spl2_1 ),
inference(forward_demodulation,[],[f43,f25]) ).
fof(f46,plain,
( converse(sK1) != converse(sK1)
| spl2_1
| ~ spl2_2 ),
inference(forward_demodulation,[],[f45,f44]) ).
fof(f47,plain,
( $false
| spl2_1
| ~ spl2_2 ),
inference(trivial_inequality_removal,[],[f46]) ).
fof(f48,plain,
( spl2_1
| ~ spl2_2 ),
inference(avatar_contradiction_clause,[],[f47]) ).
fof(f49,plain,
( converse(sK1) = join(converse(sK1),converse(sK0))
| ~ spl2_1 ),
inference(forward_demodulation,[],[f35,f17]) ).
fof(f50,plain,
( sK1 != join(sK1,sK0)
| spl2_2 ),
inference(forward_demodulation,[],[f40,f17]) ).
fof(f51,plain,
( converse(sK1) = converse(join(sK1,sK0))
| ~ spl2_1 ),
inference(forward_demodulation,[],[f49,f25]) ).
fof(f52,plain,
( join(sK1,sK0) = converse(converse(sK1))
| ~ spl2_1 ),
inference(superposition,[],[f24,f51]) ).
fof(f53,plain,
( sK1 = join(sK1,sK0)
| ~ spl2_1 ),
inference(forward_demodulation,[],[f52,f24]) ).
fof(f54,plain,
( $false
| ~ spl2_1
| spl2_2 ),
inference(forward_subsumption_resolution,[],[f53,f50]) ).
fof(f55,plain,
( ~ spl2_1
| spl2_2 ),
inference(avatar_contradiction_clause,[],[f54]) ).
cnf(s1,plain,
( ~ spl2_1
| ~ spl2_2 ),
inference(sat_conversion,[],[f41]) ).
cnf(s2,plain,
( spl2_1
| spl2_2 ),
inference(sat_conversion,[],[f42]) ).
cnf(s3,plain,
( spl2_1
| ~ spl2_2 ),
inference(sat_conversion,[],[f48]) ).
cnf(s4,plain,
( ~ spl2_1
| spl2_2 ),
inference(sat_conversion,[],[f55]) ).
cnf(s5,plain,
spl2_1,
inference(rat,[],[s2,s3]) ).
cnf(s6,plain,
spl2_2,
inference(rat,[],[s4,s5]) ).
cnf(s7,plain,
$false,
inference(rat,[],[s1,s6,s5]) ).
fof(f56,plain,
$false,
inference(avatar_sat_refutation,[],[s7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : REL003+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.38 % Computer : n006.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Sun Sep 27 22:49:55 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.41 Running first-order model finding
% 0.12/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.12/0.46 % (3412947)Will run a generic schedule for satisfiability detection.
% 0.12/0.46 % (3412954)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3298576299_2999 on theBenchmark for (2999ds/0Mi)
% 0.12/0.46 % TRYING [1]
% 0.12/0.46 % TRYING [2]
% 0.12/0.46 % TRYING [3]
% 0.12/0.46 % (3412955)% WARNING: option uhcvi not known.
% 0.12/0.46 % (3412956)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2749848624:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.12/0.46 % (3412955)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4273762241:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.12/0.46 % (3412959)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1519540337:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.12/0.46 % (3412958)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2140068109:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.12/0.46 % (3412960)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1010256692:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.12/0.46 % TRYING [4]
% 0.12/0.46 % (3412958) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3412947-3412958"...
% 0.12/0.46 % (3412959) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3412947-3412959"...
% 0.12/0.46 % (3412955) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3412947-3412955"...
% 0.12/0.46 % (3412956) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3412947-3412956"...
% 0.12/0.46 % (3412960) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3412947-3412960"...
% 0.12/0.46 % (3412958)...printing done.
% 0.12/0.46 % (3412959)...printing done.
% 0.12/0.46 % (3412955)...printing done.
% 0.12/0.46 % (3412956)...printing done.
% 0.12/0.46 % (3412958)Refutation found. Thanks to Tanya!
% 0.12/0.46 % SZS status Theorem for theBenchmark
% 0.12/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.46 % (3412958)------------------------------
% 0.12/0.46 % (3412958)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.12/0.46 % (3412958)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.12/0.46 % (3412958)CaDiCaL version: 2.1.3
% 0.12/0.46 % (3412958)Termination reason: Refutation
% 0.12/0.46 % (3412958)Time elapsed: 0.003 s
% 0.12/0.46 % (3412958)Peak memory usage: 12 MB
% 0.12/0.46 % (3412958)Instructions burned: 2 (million)
% 0.12/0.46 % (3412947)Success in time 0.04 s
% 0.12/0.46 % Vampire exiting
%------------------------------------------------------------------------------