%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : FLD058-3 : 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.19s 0.28s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of formulae : 40 ( 14 unt; 2 def)
% Number of atoms : 77 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 74 ( 37 ~; 35 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 3 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 18 ( 0 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] :
( sum(additive_identity,X0,X0)
| ~ defined(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',existence_of_identity_addition) ).
fof(f14,axiom,
defined(additive_identity),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',well_definedness_of_additive_identity) ).
fof(f21,axiom,
! [X0,X1] :
( sum(additive_identity,X0,X1)
| ~ less_or_equal(X0,X1)
| ~ less_or_equal(X1,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',antisymmetry_of_order_relation) ).
fof(f22,axiom,
! [X2,X0,X1] :
( ~ less_or_equal(X2,X1)
| ~ less_or_equal(X0,X2)
| less_or_equal(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',transitivity_of_order_relation) ).
fof(f23,axiom,
! [X0,X1] :
( less_or_equal(X1,X0)
| less_or_equal(X0,X1)
| ~ defined(X0)
| ~ defined(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',totality_of_order_relation) ).
fof(f24,axiom,
! [X2,X3,X0,X1,X4] :
( ~ sum(X3,X4,X1)
| ~ less_or_equal(X2,X3)
| ~ sum(X2,X4,X0)
| less_or_equal(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',compatibility_of_order_relation_and_addition) ).
fof(f28,axiom,
defined(b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_is_defined) ).
fof(f29,negated_conjecture,
less_or_equal(additive_identity,a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_3) ).
fof(f30,negated_conjecture,
less_or_equal(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_4) ).
fof(f31,negated_conjecture,
~ sum(additive_identity,a,additive_identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_sum_5) ).
fof(f32,negated_conjecture,
sum(additive_identity,b,additive_identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sum_6) ).
fof(f148,plain,
( ~ less_or_equal(a,additive_identity)
| ~ less_or_equal(additive_identity,a) ),
inference(resolution,[],[f21,f31]) ).
fof(f162,plain,
! [X0] :
( less_or_equal(X0,X0)
| ~ defined(X0)
| ~ defined(X0) ),
inference(factoring,[],[f23]) ).
fof(f163,plain,
! [X0] :
( less_or_equal(X0,X0)
| ~ defined(X0) ),
inference(duplicate_literal_removal,[],[f162]) ).
fof(f174,plain,
~ less_or_equal(a,additive_identity),
inference(forward_subsumption_resolution,[],[f148,f29]) ).
fof(f239,plain,
! [X0,X1] :
( ~ sum(X0,b,X1)
| ~ less_or_equal(X0,additive_identity)
| less_or_equal(X1,additive_identity) ),
inference(resolution,[],[f24,f32]) ).
fof(f338,plain,
( ~ less_or_equal(additive_identity,additive_identity)
| less_or_equal(b,additive_identity)
| ~ defined(b) ),
inference(resolution,[],[f239,f3]) ).
fof(f406,plain,
( ~ less_or_equal(additive_identity,additive_identity)
| less_or_equal(b,additive_identity) ),
inference(forward_subsumption_resolution,[],[f338,f28]) ).
fof(f408,definition,
( spl0_30
<=> less_or_equal(b,additive_identity) ),
introduced(definition,[new_symbols(definition,[spl0_30])],[avatar_definition]) ).
fof(f409,plain,
( ~ less_or_equal(b,additive_identity)
| spl0_30 ),
inference(avatar_component_clause,[],[f408]) ).
fof(f410,plain,
( less_or_equal(b,additive_identity)
| ~ spl0_30 ),
inference(avatar_component_clause,[],[f408]) ).
fof(f412,definition,
( spl0_31
<=> less_or_equal(additive_identity,additive_identity) ),
introduced(definition,[new_symbols(definition,[spl0_31])],[avatar_definition]) ).
fof(f413,plain,
( less_or_equal(additive_identity,additive_identity)
| ~ spl0_31 ),
inference(avatar_component_clause,[],[f412]) ).
fof(f414,plain,
( ~ less_or_equal(additive_identity,additive_identity)
| spl0_31 ),
inference(avatar_component_clause,[],[f412]) ).
fof(f418,plain,
( ! [X0] :
( ~ less_or_equal(X0,b)
| less_or_equal(X0,additive_identity) )
| ~ spl0_30 ),
inference(resolution,[],[f410,f22]) ).
fof(f439,plain,
( less_or_equal(a,additive_identity)
| ~ spl0_30 ),
inference(resolution,[],[f418,f30]) ).
fof(f441,plain,
( $false
| ~ spl0_30 ),
inference(forward_subsumption_resolution,[],[f439,f174]) ).
fof(f442,plain,
~ spl0_30,
inference(avatar_contradiction_clause,[],[f441]) ).
fof(f447,plain,
( ~ defined(additive_identity)
| spl0_31 ),
inference(resolution,[],[f414,f163]) ).
fof(f448,plain,
( $false
| spl0_31 ),
inference(forward_subsumption_resolution,[],[f447,f14]) ).
fof(f449,plain,
spl0_31,
inference(avatar_contradiction_clause,[],[f448]) ).
fof(f464,plain,
( less_or_equal(b,additive_identity)
| ~ spl0_31 ),
inference(forward_subsumption_resolution,[],[f406,f413]) ).
fof(f465,plain,
( $false
| spl0_30
| ~ spl0_31 ),
inference(forward_subsumption_resolution,[],[f464,f409]) ).
fof(f466,plain,
( spl0_30
| ~ spl0_31 ),
inference(avatar_contradiction_clause,[],[f465]) ).
cnf(s305,plain,
~ spl0_30,
inference(sat_conversion,[],[f442]) ).
cnf(s315,plain,
spl0_31,
inference(sat_conversion,[],[f449]) ).
cnf(s325,plain,
( spl0_30
| ~ spl0_31 ),
inference(sat_conversion,[],[f466]) ).
cnf(s326,plain,
spl0_30,
inference(rat,[],[s325,s315]) ).
cnf(s327,plain,
$false,
inference(rat,[],[s305,s326]) ).
fof(f467,plain,
$false,
inference(avatar_sat_refutation,[],[s327]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : FLD058-3 : 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 : n013.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:43:06 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.19/0.28 % (1753253)Will run a generic schedule for satisfiability detection.
% 0.19/0.28 % (1753260)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=725733007:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.28 % (1753259)% WARNING: option uhcvi not known.
% 0.19/0.28 % (1753260) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1753253-1753260"...
% 0.19/0.28 % (1753260)...printing done.
% 0.19/0.28 % (1753260)Refutation found. Thanks to Tanya!
% 0.19/0.28 % SZS status Unsatisfiable for theBenchmark
% 0.19/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.28 % (1753260)------------------------------
% 0.19/0.28 % (1753260)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.28 % (1753260)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.28 % (1753260)CaDiCaL version: 2.1.3
% 0.19/0.28 % (1753260)Termination reason: Refutation
% 0.19/0.28 % (1753260)Time elapsed: 0.005 s
% 0.19/0.28 % (1753260)Peak memory usage: 12 MB
% 0.19/0.28 % (1753260)Instructions burned: 9 (million)
% 0.19/0.28 % (1753253)Success in time 0.041 s
% 0.19/0.28 % Vampire exiting
%------------------------------------------------------------------------------