%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : FLD059-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:45 AM UTC 2026
% Result : Unsatisfiable 0.20s 0.27s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 22 ( 8 unt; 0 def)
% Number of atoms : 47 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 39 ( 14 ~; 25 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 27 ( 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(f17,axiom,
! [X2,X0,X1] :
( less_or_equal(X0,X1)
| ~ less_or_equal(X0,X2)
| ~ less_or_equal(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',transitivity_of_order_relation) ).
fof(f19,axiom,
! [X2,X0,X1] :
( less_or_equal(add(X0,X1),add(X2,X1))
| ~ defined(X1)
| ~ less_or_equal(X0,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',compatibility_of_order_relation_and_addition) ).
fof(f26,axiom,
! [X2,X0,X1] :
( less_or_equal(X0,X1)
| ~ less_or_equal(X2,X1)
| ~ equalish(X2,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',compatibility_of_equality_and_order_relation) ).
fof(f28,axiom,
defined(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_is_defined) ).
fof(f29,negated_conjecture,
less_or_equal(additive_identity,a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_2) ).
fof(f30,negated_conjecture,
~ less_or_equal(additive_identity,add(a,a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_less_or_equal_3) ).
fof(f32,plain,
! [X0] :
( ~ equalish(add(additive_identity,X0),X0)
| defined(X0) ),
inference(consistent_polarity_flipping,[],[f2]) ).
fof(f47,plain,
! [X2,X0,X1] :
( ~ less_or_equal(X0,X1)
| less_or_equal(X0,X2)
| less_or_equal(X2,X1) ),
inference(consistent_polarity_flipping,[],[f17]) ).
fof(f49,plain,
! [X2,X0,X1] :
( ~ less_or_equal(add(X0,X1),add(X2,X1))
| defined(X1)
| less_or_equal(X0,X2) ),
inference(consistent_polarity_flipping,[],[f19]) ).
fof(f56,plain,
! [X2,X0,X1] :
( ~ less_or_equal(X0,X1)
| less_or_equal(X2,X1)
| equalish(X2,X0) ),
inference(consistent_polarity_flipping,[],[f26]) ).
fof(f58,plain,
~ defined(a),
inference(consistent_polarity_flipping,[],[f28]) ).
fof(f59,plain,
~ less_or_equal(additive_identity,a),
inference(consistent_polarity_flipping,[],[f29]) ).
fof(f60,plain,
less_or_equal(additive_identity,add(a,a)),
inference(consistent_polarity_flipping,[],[f30]) ).
fof(f75,plain,
! [X0] :
( less_or_equal(X0,add(a,a))
| less_or_equal(additive_identity,X0) ),
inference(resolution,[],[f47,f60]) ).
fof(f85,plain,
! [X0,X1] :
( less_or_equal(X0,add(a,a))
| equalish(X0,X1)
| less_or_equal(additive_identity,X1) ),
inference(resolution,[],[f56,f75]) ).
fof(f171,plain,
! [X0,X1] :
( equalish(add(X0,a),X1)
| less_or_equal(additive_identity,X1)
| defined(a)
| less_or_equal(X0,a) ),
inference(resolution,[],[f85,f49]) ).
fof(f193,plain,
! [X0,X1] :
( equalish(add(X0,a),X1)
| less_or_equal(additive_identity,X1)
| less_or_equal(X0,a) ),
inference(forward_subsumption_resolution,[],[f171,f58]) ).
fof(f411,plain,
( less_or_equal(additive_identity,a)
| less_or_equal(additive_identity,a)
| defined(a) ),
inference(resolution,[],[f193,f32]) ).
fof(f418,plain,
( less_or_equal(additive_identity,a)
| defined(a) ),
inference(duplicate_literal_removal,[],[f411]) ).
fof(f421,plain,
defined(a),
inference(forward_subsumption_resolution,[],[f418,f59]) ).
fof(f422,plain,
$false,
inference(forward_subsumption_resolution,[],[f421,f58]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : FLD059-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.17 % Computer : n013.cluster.edu
% 0.08/0.17 % Model : x86_64 x86_64
% 0.08/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17 % Memory : 8046.5625MB
% 0.08/0.17 % OS : Linux 6.8.0-71-generic
% 0.08/0.17 % CPULimit : 300
% 0.08/0.17 % WCLimit : 300
% 0.08/0.17 % DateTime : Tue Sep 29 00:43:21 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.21 Running first-order model finding
% 0.08/0.21 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.27 % (1753666)Will run a generic schedule for satisfiability detection.
% 0.20/0.27 % (1753671)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=890834026_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.27 % TRYING [1]
% 0.20/0.27 % TRYING [2]
% 0.20/0.27 % TRYING [3]
% 0.20/0.27 % (1753672)% WARNING: option uhcvi not known.
% 0.20/0.27 % TRYING [4]
% 0.20/0.27 % (1753672)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1329541623:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.27 % (1753673)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1082649013:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.27 % (1753674)dis+10_1_sil=32000:sp=arity:random_seed=4243800154:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.27 % (1753676)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4016013077:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.27 % (1753675)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2859633426:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.27 % (1753677)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3012361556:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.27 % TRYING [5]
% 0.20/0.27 % (1753672) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1753666-1753672"...
% 0.20/0.27 % (1753672)...printing done.
% 0.20/0.27 % (1753672)Refutation found. Thanks to Tanya!
% 0.20/0.27 % SZS status Unsatisfiable for theBenchmark
% 0.20/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.27 % (1753672)------------------------------
% 0.20/0.27 % (1753672)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.27 % (1753672)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.27 % (1753672)CaDiCaL version: 2.1.3
% 0.20/0.27 % (1753672)Termination reason: Refutation
% 0.20/0.27 % (1753672)Time elapsed: 0.008 s
% 0.20/0.27 % (1753672)Peak memory usage: 11 MB
% 0.20/0.27 % (1753672)Instructions burned: 11 (million)
% 0.20/0.27 % (1753666)Success in time 0.051 s
% 0.20/0.27 % Vampire exiting
%------------------------------------------------------------------------------