%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : REL014+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 : n016.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:17 PM UTC 2026
% Result : Theorem 0.16s 15.50s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 31 ( 16 unt; 2 def)
% Number of atoms : 46 ( 26 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 30 ( 15 ~; 11 |; 2 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 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 : 14 ( 0 sgn 13 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
! [X0] : composition(X0,one) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',composition_identity) ).
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(f14,conjecture,
! [X0] :
( composition(X0,one) = X0
& composition(one,X0) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f15,negated_conjecture,
~ ! [X0] :
( composition(X0,one) = X0
& composition(one,X0) = X0 ),
inference(negated_conjecture,[status(cth)],[f14]) ).
fof(f16,plain,
? [X0] :
( composition(X0,one) != X0
| composition(one,X0) != X0 ),
inference(ennf_transformation,[],[f15]) ).
fof(f17,plain,
( sK0 != composition(sK0,one)
| sK0 != composition(one,sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f16]) ).
fof(f23,plain,
! [X0] : composition(X0,one) = X0,
inference(cnf_transformation,[],[f6]) ).
fof(f25,plain,
! [X0] : converse(converse(X0)) = X0,
inference(cnf_transformation,[],[f8]) ).
fof(f27,plain,
! [X0,X1] : converse(composition(X0,X1)) = composition(converse(X1),converse(X0)),
inference(cnf_transformation,[],[f10]) ).
fof(f31,plain,
( sK0 != composition(sK0,one)
| sK0 != composition(one,sK0) ),
inference(cnf_transformation,[],[f17]) ).
fof(f34,definition,
( spl1_1
<=> sK0 = composition(one,sK0) ),
introduced(definition,[new_symbols(definition,[spl1_1])],[avatar_definition]) ).
fof(f36,plain,
( sK0 != composition(one,sK0)
| spl1_1 ),
inference(avatar_component_clause,[],[f34]) ).
fof(f38,definition,
( spl1_2
<=> sK0 = composition(sK0,one) ),
introduced(definition,[new_symbols(definition,[spl1_2])],[avatar_definition]) ).
fof(f40,plain,
( sK0 != composition(sK0,one)
| spl1_2 ),
inference(avatar_component_clause,[],[f38]) ).
fof(f41,plain,
( ~ spl1_1
| ~ spl1_2 ),
inference(avatar_split_clause,[],[f31,f38,f34]) ).
fof(f42,plain,
( sK0 != sK0
| spl1_2 ),
inference(superposition,[],[f40,f23]) ).
fof(f43,plain,
( $false
| spl1_2 ),
inference(trivial_inequality_removal,[],[f42]) ).
fof(f44,plain,
spl1_2,
inference(avatar_contradiction_clause,[],[f43]) ).
fof(f69,plain,
! [X0] : converse(X0) = composition(converse(one),converse(X0)),
inference(superposition,[],[f27,f23]) ).
fof(f78,plain,
! [X0] : composition(converse(one),X0) = X0,
inference(superposition,[],[f69,f25]) ).
fof(f85,plain,
one = converse(one),
inference(superposition,[],[f23,f78]) ).
fof(f87,plain,
! [X0] : composition(one,X0) = X0,
inference(superposition,[],[f78,f85]) ).
fof(f110,plain,
( sK0 != sK0
| spl1_1 ),
inference(superposition,[],[f36,f87]) ).
fof(f111,plain,
( $false
| spl1_1 ),
inference(trivial_inequality_removal,[],[f110]) ).
fof(f112,plain,
spl1_1,
inference(avatar_contradiction_clause,[],[f111]) ).
cnf(s1,plain,
( ~ spl1_1
| ~ spl1_2 ),
inference(sat_conversion,[],[f41]) ).
cnf(s2,plain,
spl1_2,
inference(sat_conversion,[],[f44]) ).
cnf(s3,plain,
spl1_1,
inference(sat_conversion,[],[f112]) ).
cnf(s4,plain,
$false,
inference(rat,[],[s1,s2,s3]) ).
fof(f113,plain,
$false,
inference(avatar_sat_refutation,[],[s4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : REL014+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.42 % Computer : n016.cluster.edu
% 0.13/0.42 % Model : x86_64 x86_64
% 0.13/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.42 % Memory : 8046.5625MB
% 0.13/0.42 % OS : Linux 6.8.0-71-generic
% 0.04/15.45 % CPULimit : 300
% 0.04/15.45 % WCLimit : 300
% 0.04/15.45 % DateTime : Sun Sep 27 22:50:58 UTC 2026
% 0.04/15.45 % CPUTime :
% 0.04/15.45 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.04/15.46 Running first-order model finding
% 0.04/15.46 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.16/15.50 % (2839279)Will run a generic schedule for satisfiability detection.
% 0.16/15.50 % (2839285)% WARNING: option uhcvi not known.
% 0.16/15.50 % (2839285)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=767849673:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.16/15.50 % (2839287)dis+10_1_sil=32000:sp=arity:random_seed=711489106:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/15.50 % (2839288)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2675379873:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.16/15.50 % (2839290)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2849875914:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.16/15.50 % (2839286)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3214725803:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.16/15.50 % (2839284)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=487733763_2999 on theBenchmark for (2999ds/0Mi)
% 0.16/15.50 % (2839289)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1892557354:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.16/15.50 % TRYING [1]
% 0.16/15.50 % TRYING [2]
% 0.16/15.50 % TRYING [3]
% 0.16/15.50 % (2839290) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2839279-2839290"...
% 0.16/15.50 % (2839290)...printing done.
% 0.16/15.50 % (2839289) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2839279-2839289"...
% 0.16/15.50 % (2839290)Refutation found. Thanks to Tanya!
% 0.16/15.50 % SZS status Theorem for theBenchmark
% 0.16/15.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/15.50 % (2839290)------------------------------
% 0.16/15.50 % (2839290)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/15.50 % (2839290)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/15.50 % (2839290)CaDiCaL version: 2.1.3
% 0.16/15.50 % (2839290)Termination reason: Refutation
% 0.16/15.50 % (2839290)Time elapsed: 0.002 s
% 0.16/15.50 % (2839290)Peak memory usage: 12 MB
% 0.16/15.50 % (2839290)Instructions burned: 5 (million)
% 0.16/15.50 % (2839279)Success in time 0.028 s
% 0.16/15.50 % Vampire exiting
%------------------------------------------------------------------------------