%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : FLD023-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/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 09:49:35 AM UTC 2026
% Result : Unsatisfiable 0.17s 0.26s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of formulae : 32 ( 11 unt; 1 def)
% Number of atoms : 61 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 57 ( 28 ~; 28 |; 0 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 23 ( 0 sgn 23 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] :
( equalish(add(X0,additive_inverse(X0)),additive_identity)
| ~ defined(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',existence_of_inverse_addition) ).
fof(f12,axiom,
! [X0] :
( defined(additive_inverse(X0))
| ~ defined(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',well_definedness_of_additive_inverse) ).
fof(f22,axiom,
! [X0,X1] :
( equalish(X0,X1)
| ~ equalish(X1,X0) ),
file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/benchmark/Axioms/FLD001-0.ax',compatibility_of_equality_and_addition) ).
fof(f28,axiom,
defined(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_is_defined) ).
fof(f30,negated_conjecture,
equalish(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_equals_b_3) ).
fof(f31,negated_conjecture,
~ equalish(additive_identity,add(b,additive_inverse(a))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',additive_identity_not_equal_to_add_4) ).
fof(f34,plain,
! [X0] :
( ~ equalish(add(X0,additive_inverse(X0)),additive_identity)
| ~ defined(X0) ),
inference(consistent_polarity_flipping,[],[f3]) ).
fof(f48,plain,
! [X0,X1] :
( ~ equalish(X0,X1)
| equalish(X1,X0) ),
inference(consistent_polarity_flipping,[],[f22]) ).
fof(f49,plain,
! [X2,X0,X1] :
( ~ equalish(X0,X1)
| equalish(X0,X2)
| equalish(X2,X1) ),
inference(consistent_polarity_flipping,[],[f23]) ).
fof(f50,plain,
! [X2,X0,X1] :
( ~ equalish(add(X0,X1),add(X2,X1))
| ~ defined(X1)
| equalish(X0,X2) ),
inference(consistent_polarity_flipping,[],[f24]) ).
fof(f54,plain,
~ equalish(a,b),
inference(consistent_polarity_flipping,[],[f30]) ).
fof(f55,plain,
equalish(additive_identity,add(b,additive_inverse(a))),
inference(consistent_polarity_flipping,[],[f31]) ).
fof(f93,plain,
! [X0] :
( equalish(X0,add(b,additive_inverse(a)))
| equalish(additive_identity,X0) ),
inference(resolution,[],[f49,f55]) ).
fof(f116,definition,
( spl0_7
<=> defined(additive_inverse(a)) ),
introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).
fof(f117,plain,
( defined(additive_inverse(a))
| ~ spl0_7 ),
inference(avatar_component_clause,[],[f116]) ).
fof(f118,plain,
( ~ defined(additive_inverse(a))
| spl0_7 ),
inference(avatar_component_clause,[],[f116]) ).
fof(f124,plain,
( ~ defined(a)
| spl0_7 ),
inference(resolution,[],[f118,f12]) ).
fof(f125,plain,
( $false
| spl0_7 ),
inference(forward_subsumption_resolution,[],[f124,f28]) ).
fof(f126,plain,
spl0_7,
inference(avatar_contradiction_clause,[],[f125]) ).
fof(f157,plain,
! [X0] :
( ~ defined(additive_inverse(a))
| equalish(X0,b)
| equalish(additive_identity,add(X0,additive_inverse(a))) ),
inference(resolution,[],[f50,f93]) ).
fof(f158,plain,
( ! [X0] :
( equalish(additive_identity,add(X0,additive_inverse(a)))
| equalish(X0,b) )
| ~ spl0_7 ),
inference(forward_subsumption_resolution,[],[f157,f117]) ).
fof(f231,plain,
( ! [X0] :
( equalish(add(X0,additive_inverse(a)),additive_identity)
| equalish(X0,b) )
| ~ spl0_7 ),
inference(resolution,[],[f158,f48]) ).
fof(f561,plain,
( equalish(a,b)
| ~ defined(a)
| ~ spl0_7 ),
inference(resolution,[],[f231,f34]) ).
fof(f566,plain,
( ~ defined(a)
| ~ spl0_7 ),
inference(forward_subsumption_resolution,[],[f561,f54]) ).
fof(f567,plain,
( $false
| ~ spl0_7 ),
inference(forward_subsumption_resolution,[],[f566,f28]) ).
fof(f568,plain,
~ spl0_7,
inference(avatar_contradiction_clause,[],[f567]) ).
cnf(s8,plain,
spl0_7,
inference(sat_conversion,[],[f126]) ).
cnf(s44,plain,
~ spl0_7,
inference(sat_conversion,[],[f568]) ).
cnf(s45,plain,
$false,
inference(rat,[],[s8,s44]) ).
fof(f569,plain,
$false,
inference(avatar_sat_refutation,[],[s45]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : FLD023-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.05/0.17 % Computer : n003.cluster.edu
% 0.05/0.17 % Model : x86_64 x86_64
% 0.05/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.05/0.17 % Memory : 8046.5625MB
% 0.05/0.17 % OS : Linux 6.8.0-71-generic
% 0.05/0.17 % CPULimit : 300
% 0.05/0.17 % WCLimit : 300
% 0.05/0.17 % DateTime : Tue Sep 29 00:26:48 UTC 2026
% 0.05/0.17 % CPUTime :
% 0.05/0.17 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.05/0.20 Running first-order model finding
% 0.05/0.21 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.26 % (2179893)Will run a generic schedule for satisfiability detection.
% 0.17/0.26 % (2179898)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1886085206_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.26 % TRYING [1]
% 0.17/0.26 % TRYING [2]
% 0.17/0.26 % TRYING [3]
% 0.17/0.26 % (2179899)% WARNING: option uhcvi not known.
% 0.17/0.26 % TRYING [4]
% 0.17/0.26 % (2179902)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3210498674:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.26 % (2179899)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2262856248:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.26 % (2179900)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1569791913:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.26 % (2179903)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=81723751:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.26 % (2179901)dis+10_1_sil=32000:sp=arity:random_seed=4185271484:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.26 % (2179904)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=227560170:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.26 % (2179899) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2179893-2179899"...
% 0.17/0.26 % (2179899)...printing done.
% 0.17/0.26 % (2179899)Refutation found. Thanks to Tanya!
% 0.17/0.26 % SZS status Unsatisfiable for theBenchmark
% 0.17/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.26 % (2179899)------------------------------
% 0.17/0.26 % (2179899)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.26 % (2179899)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.26 % (2179899)CaDiCaL version: 2.1.3
% 0.17/0.26 % (2179899)Termination reason: Refutation
% 0.17/0.26 % (2179899)Time elapsed: 0.010 s
% 0.17/0.26 % (2179899)Peak memory usage: 12 MB
% 0.17/0.26 % (2179899)Instructions burned: 11 (million)
% 0.17/0.26 % (2179893)Success in time 0.049 s
% 0.17/0.26 % Vampire exiting
%------------------------------------------------------------------------------