%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : FLD003-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 : 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 09:49:30 AM UTC 2026
% Result : Unsatisfiable 0.20s 0.32s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of formulae : 47 ( 11 unt; 3 def)
% Number of atoms : 97 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 99 ( 49 ~; 47 |; 0 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 4 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 27 ( 0 sgn 27 !; 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(f4,axiom,
! [X0,X1] :
( equalish(add(X0,X1),add(X1,X0))
| ~ defined(X0)
| ~ defined(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',commutativity_addition) ).
fof(f10,axiom,
! [X0,X1] :
( defined(add(X0,X1))
| ~ defined(X0)
| ~ defined(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',well_definedness_of_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(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,axiom,
defined(b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_is_defined) ).
fof(f30,negated_conjecture,
~ equalish(add(a,add(b,additive_inverse(b))),a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',add_not_equal_to_a_3) ).
fof(f32,plain,
! [X0] :
( ~ equalish(add(additive_identity,X0),X0)
| ~ defined(X0) ),
inference(consistent_polarity_flipping,[],[f2]) ).
fof(f33,plain,
! [X0] :
( ~ equalish(add(X0,additive_inverse(X0)),additive_identity)
| ~ defined(X0) ),
inference(consistent_polarity_flipping,[],[f3]) ).
fof(f34,plain,
! [X0,X1] :
( ~ equalish(add(X0,X1),add(X1,X0))
| ~ defined(X0)
| ~ defined(X1) ),
inference(consistent_polarity_flipping,[],[f4]) ).
fof(f48,plain,
! [X2,X0,X1] :
( ~ equalish(X0,X1)
| equalish(X0,X2)
| equalish(X2,X1) ),
inference(consistent_polarity_flipping,[],[f23]) ).
fof(f49,plain,
! [X2,X0,X1] :
( ~ equalish(add(X0,X1),add(X2,X1))
| ~ defined(X1)
| equalish(X0,X2) ),
inference(consistent_polarity_flipping,[],[f24]) ).
fof(f53,plain,
equalish(add(a,add(b,additive_inverse(b))),a),
inference(consistent_polarity_flipping,[],[f30]) ).
fof(f84,plain,
! [X0] :
( equalish(add(a,add(b,additive_inverse(b))),X0)
| equalish(X0,a) ),
inference(resolution,[],[f48,f53]) ).
fof(f111,plain,
( ~ defined(a)
| ~ defined(add(b,additive_inverse(b)))
| equalish(add(add(b,additive_inverse(b)),a),a) ),
inference(resolution,[],[f34,f84]) ).
fof(f112,plain,
( ~ defined(add(b,additive_inverse(b)))
| equalish(add(add(b,additive_inverse(b)),a),a) ),
inference(forward_subsumption_resolution,[],[f111,f28]) ).
fof(f114,definition,
( spl0_8
<=> equalish(add(add(b,additive_inverse(b)),a),a) ),
introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).
fof(f116,plain,
( equalish(add(add(b,additive_inverse(b)),a),a)
| ~ spl0_8 ),
inference(avatar_component_clause,[],[f114]) ).
fof(f118,definition,
( spl0_9
<=> defined(add(b,additive_inverse(b))) ),
introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition]) ).
fof(f120,plain,
( ~ defined(add(b,additive_inverse(b)))
| spl0_9 ),
inference(avatar_component_clause,[],[f118]) ).
fof(f121,plain,
( spl0_8
| ~ spl0_9 ),
inference(avatar_split_clause,[],[f112,f118,f114]) ).
fof(f122,plain,
( ~ defined(b)
| ~ defined(additive_inverse(b))
| spl0_9 ),
inference(resolution,[],[f120,f10]) ).
fof(f123,plain,
( ~ defined(additive_inverse(b))
| spl0_9 ),
inference(forward_subsumption_resolution,[],[f122,f29]) ).
fof(f124,plain,
( ~ defined(b)
| spl0_9 ),
inference(resolution,[],[f123,f12]) ).
fof(f125,plain,
( $false
| spl0_9 ),
inference(forward_subsumption_resolution,[],[f124,f29]) ).
fof(f126,plain,
spl0_9,
inference(avatar_contradiction_clause,[],[f125]) ).
fof(f163,plain,
( ! [X0] :
( equalish(add(add(b,additive_inverse(b)),a),X0)
| equalish(X0,a) )
| ~ spl0_8 ),
inference(resolution,[],[f116,f48]) ).
fof(f452,plain,
( ! [X0] :
( equalish(add(X0,a),a)
| ~ defined(a)
| equalish(add(b,additive_inverse(b)),X0) )
| ~ spl0_8 ),
inference(resolution,[],[f163,f49]) ).
fof(f463,plain,
( ! [X0] :
( equalish(add(b,additive_inverse(b)),X0)
| equalish(add(X0,a),a) )
| ~ spl0_8 ),
inference(forward_subsumption_resolution,[],[f452,f28]) ).
fof(f2680,plain,
( equalish(add(additive_identity,a),a)
| ~ defined(b)
| ~ spl0_8 ),
inference(resolution,[],[f463,f33]) ).
fof(f2687,plain,
( equalish(add(additive_identity,a),a)
| ~ spl0_8 ),
inference(forward_subsumption_resolution,[],[f2680,f29]) ).
fof(f2695,definition,
( spl0_111
<=> equalish(add(additive_identity,a),a) ),
introduced(definition,[new_symbols(definition,[spl0_111])],[avatar_definition]) ).
fof(f2697,plain,
( equalish(add(additive_identity,a),a)
| ~ spl0_111 ),
inference(avatar_component_clause,[],[f2695]) ).
fof(f2699,plain,
( spl0_111
| ~ spl0_8 ),
inference(avatar_split_clause,[],[f2687,f114,f2695]) ).
fof(f2743,plain,
( ~ defined(a)
| ~ spl0_111 ),
inference(resolution,[],[f2697,f32]) ).
fof(f2748,plain,
( $false
| ~ spl0_111 ),
inference(forward_subsumption_resolution,[],[f2743,f28]) ).
fof(f2749,plain,
~ spl0_111,
inference(avatar_contradiction_clause,[],[f2748]) ).
cnf(s7,plain,
( spl0_8
| ~ spl0_9 ),
inference(sat_conversion,[],[f121]) ).
cnf(s8,plain,
spl0_9,
inference(sat_conversion,[],[f126]) ).
cnf(s225,plain,
( ~ spl0_8
| spl0_111 ),
inference(sat_conversion,[],[f2699]) ).
cnf(s229,plain,
~ spl0_111,
inference(sat_conversion,[],[f2749]) ).
cnf(s230,plain,
~ spl0_8,
inference(rat,[],[s225,s229]) ).
cnf(s239,plain,
$false,
inference(rat,[],[s7,s8,s230]) ).
fof(f2750,plain,
$false,
inference(avatar_sat_refutation,[],[s239]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : FLD003-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.07/0.19 % Computer : n006.cluster.edu
% 0.07/0.19 % Model : x86_64 x86_64
% 0.07/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.19 % Memory : 8046.5625MB
% 0.07/0.19 % OS : Linux 6.8.0-71-generic
% 0.07/0.19 % CPULimit : 300
% 0.07/0.19 % WCLimit : 300
% 0.07/0.19 % DateTime : Tue Sep 29 00:21:55 UTC 2026
% 0.07/0.19 % CPUTime :
% 0.07/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.22 Running first-order model finding
% 0.07/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.20/0.32 % (354841)Will run a generic schedule for satisfiability detection.
% 0.20/0.32 % (354848)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3847462951:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.32 % (354847)% WARNING: option uhcvi not known.
% 0.20/0.32 % (354846)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3885723642_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.32 % (354847)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1997343705:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.32 % (354849)dis+10_1_sil=32000:sp=arity:random_seed=3688871785:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.32 % (354851)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3681060713:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.32 % (354850)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3055833463:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.32 % (354852)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1683983761:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.32 % TRYING [1]
% 0.20/0.32 % TRYING [2]
% 0.20/0.32 % TRYING [3]
% 0.20/0.32 % TRYING [4]
% 0.20/0.32 % (354847) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-354841-354847"...
% 0.20/0.32 % (354847)...printing done.
% 0.20/0.32 % (354847)Refutation found. Thanks to Tanya!
% 0.20/0.32 % SZS status Unsatisfiable for theBenchmark
% 0.20/0.32 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.32 % (354847)------------------------------
% 0.20/0.32 % (354847)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.32 % (354847)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.32 % (354847)CaDiCaL version: 2.1.3
% 0.20/0.32 % (354847)Termination reason: Refutation
% 0.20/0.32 % (354847)Time elapsed: 0.054 s
% 0.20/0.32 % (354847)Peak memory usage: 13 MB
% 0.20/0.32 % (354847)Instructions burned: 82 (million)
% 0.20/0.32 % (354841)Success in time 0.093 s
% 0.20/0.32 % Vampire exiting
%------------------------------------------------------------------------------