%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : FLD067-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n020.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:19 AM UTC 2026
% Result : Unsatisfiable 3.41s 1.15s
% Output : Refutation 3.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 27 ( 10 unt; 2 def)
% Number of atoms : 50 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 53 ( 30 ~; 21 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] :
( equalish(add(X0,additive_inverse(X0)),additive_identity)
| ~ defined(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',existence_of_inverse_addition) ).
fof(f12,axiom,
! [X0] :
( defined(additive_inverse(X0))
| ~ defined(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',well_definedness_of_additive_inverse) ).
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/sandbox2/benchmark/theBenchmark.p',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/sandbox2/benchmark/theBenchmark.p',compatibility_of_equality_and_order_relation) ).
fof(f28,axiom,
defined(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_is_defined) ).
fof(f30,negated_conjecture,
less_or_equal(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_3) ).
fof(f31,negated_conjecture,
~ less_or_equal(additive_identity,add(b,additive_inverse(a))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_less_or_equal_4) ).
fof(f45,plain,
! [X0] :
( ~ less_or_equal(X0,add(b,additive_inverse(a)))
| ~ equalish(X0,additive_identity) ),
inference(resolution,[],[f26,f31]) ).
fof(f109,definition,
( spl0_7
<=> defined(additive_inverse(a)) ),
introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).
fof(f110,plain,
( ~ defined(additive_inverse(a))
| spl0_7 ),
inference(avatar_component_clause,[],[f109]) ).
fof(f119,plain,
( ~ defined(a)
| spl0_7 ),
inference(resolution,[],[f110,f12]) ).
fof(f120,plain,
( $false
| spl0_7 ),
inference(forward_subsumption_resolution,[],[f119,f28]) ).
fof(f121,plain,
spl0_7,
inference(avatar_contradiction_clause,[],[f120]) ).
fof(f125,plain,
! [X0] :
( ~ equalish(add(X0,additive_inverse(a)),additive_identity)
| ~ defined(additive_inverse(a))
| ~ less_or_equal(X0,b) ),
inference(resolution,[],[f45,f19]) ).
fof(f132,definition,
( spl0_11
<=> ! [X0] :
( ~ equalish(add(X0,additive_inverse(a)),additive_identity)
| ~ less_or_equal(X0,b) ) ),
introduced(definition,[new_symbols(definition,[spl0_11])],[avatar_definition]) ).
fof(f133,plain,
( ! [X0] :
( ~ equalish(add(X0,additive_inverse(a)),additive_identity)
| ~ less_or_equal(X0,b) )
| ~ spl0_11 ),
inference(avatar_component_clause,[],[f132]) ).
fof(f134,plain,
( ~ spl0_7
| spl0_11 ),
inference(avatar_split_clause,[],[f125,f132,f109]) ).
fof(f204,plain,
( ~ less_or_equal(a,b)
| ~ defined(a)
| ~ spl0_11 ),
inference(resolution,[],[f133,f3]) ).
fof(f207,plain,
( ~ defined(a)
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[],[f204,f30]) ).
fof(f208,plain,
( $false
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[],[f207,f28]) ).
fof(f209,plain,
~ spl0_11,
inference(avatar_contradiction_clause,[],[f208]) ).
cnf(s7,plain,
spl0_7,
inference(sat_conversion,[],[f121]) ).
cnf(s9,plain,
( ~ spl0_7
| spl0_11 ),
inference(sat_conversion,[],[f134]) ).
cnf(s11,plain,
~ spl0_11,
inference(sat_conversion,[],[f209]) ).
cnf(s12,plain,
~ spl0_7,
inference(rat,[],[s9,s11]) ).
cnf(s13,plain,
$false,
inference(rat,[],[s7,s12]) ).
fof(f210,plain,
$false,
inference(avatar_sat_refutation,[],[s13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : FLD067-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.19 % Computer : n020.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Tue Sep 29 00:49:20 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 Running first-order theorem proving
% 0.08/0.22 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.41/1.15 % (738461)Input is clausal, will run a generic CNF schedule.
% 3.41/1.15 % (738466)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=3593872484:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 3.41/1.15 % (738467)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=2198273657:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 3.41/1.15 % (738471)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2330990309:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 3.41/1.15 % (738468)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=537206569:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 3.41/1.15 % (738469)lrs+10_1_sil=8000:sp=occurrence:random_seed=4290981248:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 3.41/1.15 % (738470)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=3307486020:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 3.41/1.15 % (738470)First to succeed.
% 3.41/1.15 % (738470)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-738461"
% 3.41/1.15 % (738471)Also succeeded, but the first one will report.
% 3.41/1.15 % (738472)dis-21_1_sil=8000:lcm=predicate:random_seed=1540958866:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/117Mi)
% 3.41/1.15 % (738469)Also succeeded, but the first one will report.
% 3.41/1.15 % (738472)Also succeeded, but the first one will report.
% 3.41/1.15 % (738470)Refutation found. Thanks to Tanya!
% 3.41/1.15 % SZS status Unsatisfiable for theBenchmark
% 3.41/1.15 % SZS output start Proof for theBenchmark
% See solution above
% 3.41/1.15 % (738470)------------------------------
% 3.41/1.15 % (738470)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.41/1.15 % (738470)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.41/1.15 % (738470)CaDiCaL version: 2.1.3
% 3.41/1.15 % (738470)Termination reason: Refutation
% 3.41/1.15 % (738470)Time elapsed: 0.005 s
% 3.41/1.15 % (738470)Peak memory usage: 89 MB
% 3.41/1.15 % (738470)Instructions burned: 5 (million)
% 3.41/1.15 % (738470)------------------------------
% 3.41/1.15 % (738470)------------------------------
% 3.41/1.15 % (738461)Success in time 0.404 s
% 3.41/1.15 % Vampire exiting
%------------------------------------------------------------------------------