%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : FLD018-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n013.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 09:49:34 AM UTC 2026
% Result : Unsatisfiable 0.18s 0.28s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of formulae : 42 ( 12 unt; 4 def)
% Number of atoms : 81 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 84 ( 45 ~; 35 |; 0 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 5 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0] :
( equalish(add(additive_identity,X0),X0)
| ~ defined(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',existence_of_identity_addition) ).
fof(f3,axiom,
! [X0] :
( equalish(add(X0,additive_inverse(X0)),additive_identity)
| ~ defined(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',existence_of_inverse_addition) ).
fof(f12,axiom,
! [X0] :
( defined(additive_inverse(X0))
| ~ defined(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',well_definedness_of_additive_inverse) ).
fof(f22,axiom,
! [X0,X1] :
( equalish(X0,X1)
| ~ equalish(X1,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',symmetry_of_equality) ).
fof(f23,axiom,
! [X2,X0,X1] :
( equalish(X0,X1)
| ~ equalish(X0,X2)
| ~ equalish(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',transitivity_of_equality) ).
fof(f24,axiom,
! [X2,X0,X1] :
( equalish(add(X0,X1),add(X2,X1))
| ~ defined(X1)
| ~ equalish(X0,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',compatibility_of_equality_and_addition) ).
fof(f28,axiom,
defined(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_is_defined) ).
fof(f29,negated_conjecture,
equalish(a,additive_identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_equals_additive_identity_2) ).
fof(f30,negated_conjecture,
~ equalish(additive_inverse(a),additive_identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_inverse_not_equal_to_additive_identity_3) ).
fof(f31,plain,
~ equalish(additive_identity,additive_inverse(a)),
inference(resolution,[],[f22,f30]) ).
fof(f41,plain,
! [X0] :
( ~ equalish(additive_identity,X0)
| ~ equalish(X0,additive_inverse(a)) ),
inference(resolution,[],[f23,f31]) ).
fof(f72,plain,
( ~ equalish(additive_identity,add(additive_identity,additive_inverse(a)))
| ~ defined(additive_inverse(a)) ),
inference(resolution,[],[f41,f2]) ).
fof(f75,definition,
( spl0_4
<=> defined(additive_inverse(a)) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f77,plain,
( ~ defined(additive_inverse(a))
| spl0_4 ),
inference(avatar_component_clause,[],[f75]) ).
fof(f84,definition,
( spl0_6
<=> equalish(additive_identity,add(additive_identity,additive_inverse(a))) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f86,plain,
( ~ equalish(additive_identity,add(additive_identity,additive_inverse(a)))
| spl0_6 ),
inference(avatar_component_clause,[],[f84]) ).
fof(f87,plain,
( ~ spl0_4
| ~ spl0_6 ),
inference(avatar_split_clause,[],[f72,f84,f75]) ).
fof(f88,plain,
( ~ defined(a)
| spl0_4 ),
inference(resolution,[],[f77,f12]) ).
fof(f89,plain,
( $false
| spl0_4 ),
inference(resolution,[],[f88,f28]) ).
fof(f90,plain,
spl0_4,
inference(avatar_contradiction_clause,[],[f89]) ).
fof(f115,plain,
( ! [X0] :
( ~ equalish(additive_identity,X0)
| ~ equalish(X0,add(additive_identity,additive_inverse(a))) )
| spl0_6 ),
inference(resolution,[],[f86,f23]) ).
fof(f256,definition,
( spl0_16
<=> defined(a) ),
introduced(definition,[new_symbols(definition,[spl0_16])],[avatar_definition]) ).
fof(f258,plain,
( ~ defined(a)
| spl0_16 ),
inference(avatar_component_clause,[],[f256]) ).
fof(f269,plain,
( $false
| spl0_16 ),
inference(resolution,[],[f258,f28]) ).
fof(f270,plain,
spl0_16,
inference(avatar_contradiction_clause,[],[f269]) ).
fof(f866,plain,
( ! [X0] :
( ~ defined(additive_inverse(a))
| ~ equalish(X0,additive_identity)
| ~ equalish(additive_identity,add(X0,additive_inverse(a))) )
| spl0_6 ),
inference(resolution,[],[f24,f115]) ).
fof(f879,definition,
( spl0_55
<=> ! [X0] :
( ~ equalish(X0,additive_identity)
| ~ equalish(additive_identity,add(X0,additive_inverse(a))) ) ),
introduced(definition,[new_symbols(definition,[spl0_55])],[avatar_definition]) ).
fof(f880,plain,
( ! [X0] :
( ~ equalish(X0,additive_identity)
| ~ equalish(additive_identity,add(X0,additive_inverse(a))) )
| ~ spl0_55 ),
inference(avatar_component_clause,[],[f879]) ).
fof(f881,plain,
( spl0_55
| ~ spl0_4
| spl0_6 ),
inference(avatar_split_clause,[],[f866,f84,f75,f879]) ).
fof(f942,plain,
( ~ equalish(additive_identity,add(a,additive_inverse(a)))
| ~ spl0_55 ),
inference(resolution,[],[f880,f29]) ).
fof(f956,plain,
( ~ equalish(add(a,additive_inverse(a)),additive_identity)
| ~ spl0_55 ),
inference(resolution,[],[f942,f22]) ).
fof(f957,plain,
( ~ defined(a)
| ~ spl0_55 ),
inference(resolution,[],[f956,f3]) ).
fof(f960,plain,
( ~ spl0_16
| ~ spl0_55 ),
inference(avatar_split_clause,[],[f957,f879,f256]) ).
cnf(s5,plain,
( ~ spl0_4
| ~ spl0_6 ),
inference(sat_conversion,[],[f87]) ).
cnf(s6,plain,
spl0_4,
inference(sat_conversion,[],[f90]) ).
cnf(s18,plain,
spl0_16,
inference(sat_conversion,[],[f270]) ).
cnf(s54,plain,
( ~ spl0_4
| spl0_6
| spl0_55 ),
inference(sat_conversion,[],[f881]) ).
cnf(s66,plain,
( ~ spl0_16
| ~ spl0_55 ),
inference(sat_conversion,[],[f960]) ).
cnf(s68,plain,
~ spl0_55,
inference(rat,[],[s66,s18]) ).
cnf(s71,plain,
spl0_6,
inference(rat,[],[s54,s68,s6]) ).
cnf(s91,plain,
$false,
inference(rat,[],[s5,s71,s6]) ).
fof(f961,plain,
$false,
inference(avatar_sat_refutation,[],[s91]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : FLD018-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.06/0.18 % Computer : n013.cluster.edu
% 0.06/0.18 % Model : x86_64 x86_64
% 0.06/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.18 % Memory : 8046.5625MB
% 0.06/0.18 % OS : Linux 6.8.0-71-generic
% 0.06/0.19 % CPULimit : 300
% 0.06/0.19 % WCLimit : 300
% 0.06/0.19 % DateTime : Tue Sep 29 00:27:07 UTC 2026
% 0.06/0.19 % CPUTime :
% 0.06/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.06/0.22 Running first-order model finding
% 0.06/0.22 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.18/0.28 % (1742761)Will run a generic schedule for satisfiability detection.
% 0.18/0.28 % (1742767)% WARNING: option uhcvi not known.
% 0.18/0.28 % (1742767)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3058677592:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.28 % (1742766)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3776233379_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.28 % (1742771)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=319226614:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.28 % (1742768)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2310750875:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.28 % (1742769)dis+10_1_sil=32000:sp=arity:random_seed=1528278443:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.28 % (1742770)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=677928854:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.28 % (1742772)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=367130346:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.28 % TRYING [1]
% 0.18/0.28 % TRYING [2]
% 0.18/0.28 % TRYING [3]
% 0.18/0.28 % TRYING [4]
% 0.18/0.28 % (1742772) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1742761-1742772"...
% 0.18/0.28 % (1742772)...printing done.
% 0.18/0.28 % (1742772)Refutation found. Thanks to Tanya!
% 0.18/0.28 % SZS status Unsatisfiable for theBenchmark
% 0.18/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.28 % (1742772)------------------------------
% 0.18/0.28 % (1742772)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.28 % (1742772)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.28 % (1742772)CaDiCaL version: 2.1.3
% 0.18/0.28 % (1742772)Termination reason: Refutation
% 0.18/0.28 % (1742772)Time elapsed: 0.016 s
% 0.18/0.28 % (1742772)Peak memory usage: 12 MB
% 0.18/0.28 % (1742772)Instructions burned: 22 (million)
% 0.18/0.28 % (1742761)Success in time 0.049 s
% 0.18/0.28 % Vampire exiting
%------------------------------------------------------------------------------