%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : FLD071-2 : 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 : n018.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:49 AM UTC 2026
% Result : Unsatisfiable 0.18s 0.31s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of formulae : 52 ( 17 unt; 3 def)
% Number of atoms : 108 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 105 ( 49 ~; 53 |; 0 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 4 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 30 ( 0 sgn 30 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f17,axiom,
! [X2,X0,X1] :
( less_or_equal(X0,X1)
| ~ less_or_equal(X0,X2)
| ~ less_or_equal(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',transitivity_of_order_relation) ).
fof(f18,axiom,
! [X0,X1] :
( less_or_equal(X0,X1)
| less_or_equal(X1,X0)
| ~ defined(X0)
| ~ defined(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',totality_of_order_relation) ).
fof(f20,axiom,
! [X0,X1] :
( less_or_equal(additive_identity,multiply(X0,X1))
| ~ less_or_equal(additive_identity,X0)
| ~ less_or_equal(additive_identity,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',compatibility_of_order_relation_and_multiplication) ).
fof(f22,axiom,
! [X0,X1] :
( equalish(X0,X1)
| ~ equalish(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',symmetry_of_equality) ).
fof(f26,axiom,
! [X2,X0,X1] :
( less_or_equal(X0,X1)
| ~ less_or_equal(X2,X1)
| ~ equalish(X2,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',compatibility_of_equality_and_order_relation) ).
fof(f30,axiom,
defined(u),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',u_is_defined) ).
fof(f31,negated_conjecture,
less_or_equal(additive_identity,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_4) ).
fof(f32,negated_conjecture,
less_or_equal(additive_identity,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_5) ).
fof(f33,negated_conjecture,
equalish(multiply(a,b),u),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply_equals_u_6) ).
fof(f34,negated_conjecture,
~ less_or_equal(additive_identity,u),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_less_or_equal_7) ).
fof(f46,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(f47,plain,
! [X0,X1] :
( ~ less_or_equal(X0,X1)
| ~ less_or_equal(X1,X0)
| ~ defined(X0)
| ~ defined(X1) ),
inference(consistent_polarity_flipping,[],[f18]) ).
fof(f49,plain,
! [X0,X1] :
( ~ less_or_equal(additive_identity,multiply(X0,X1))
| less_or_equal(additive_identity,X0)
| less_or_equal(additive_identity,X1) ),
inference(consistent_polarity_flipping,[],[f20]) ).
fof(f51,plain,
! [X0,X1] :
( ~ equalish(X0,X1)
| equalish(X1,X0) ),
inference(consistent_polarity_flipping,[],[f22]) ).
fof(f55,plain,
! [X2,X0,X1] :
( ~ less_or_equal(X0,X1)
| less_or_equal(X2,X1)
| equalish(X2,X0) ),
inference(consistent_polarity_flipping,[],[f26]) ).
fof(f57,plain,
~ less_or_equal(additive_identity,a),
inference(consistent_polarity_flipping,[],[f31]) ).
fof(f58,plain,
~ less_or_equal(additive_identity,b),
inference(consistent_polarity_flipping,[],[f32]) ).
fof(f59,plain,
~ equalish(multiply(a,b),u),
inference(consistent_polarity_flipping,[],[f33]) ).
fof(f60,plain,
less_or_equal(additive_identity,u),
inference(consistent_polarity_flipping,[],[f34]) ).
fof(f77,plain,
! [X0] :
( less_or_equal(additive_identity,X0)
| less_or_equal(X0,u) ),
inference(resolution,[],[f46,f60]) ).
fof(f83,plain,
! [X0,X1] :
( less_or_equal(additive_identity,X0)
| less_or_equal(X1,u)
| equalish(X1,X0) ),
inference(resolution,[],[f77,f55]) ).
fof(f185,definition,
( spl0_4
<=> ! [X0] :
( less_or_equal(additive_identity,X0)
| equalish(u,X0) ) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f186,plain,
( ! [X0] :
( less_or_equal(additive_identity,X0)
| equalish(u,X0) )
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f185]) ).
fof(f363,definition,
( spl0_14
<=> less_or_equal(additive_identity,multiply(a,b)) ),
introduced(definition,[new_symbols(definition,[spl0_14])],[avatar_definition]) ).
fof(f364,plain,
( ~ less_or_equal(additive_identity,multiply(a,b))
| spl0_14 ),
inference(avatar_component_clause,[],[f363]) ).
fof(f365,plain,
( less_or_equal(additive_identity,multiply(a,b))
| ~ spl0_14 ),
inference(avatar_component_clause,[],[f363]) ).
fof(f584,definition,
( spl0_25
<=> less_or_equal(u,u) ),
introduced(definition,[new_symbols(definition,[spl0_25])],[avatar_definition]) ).
fof(f585,plain,
( ~ less_or_equal(u,u)
| spl0_25 ),
inference(avatar_component_clause,[],[f584]) ).
fof(f586,plain,
( less_or_equal(u,u)
| ~ spl0_25 ),
inference(avatar_component_clause,[],[f584]) ).
fof(f601,plain,
( ~ less_or_equal(u,u)
| ~ defined(u)
| ~ defined(u)
| ~ spl0_25 ),
inference(resolution,[],[f586,f47]) ).
fof(f604,plain,
( ~ less_or_equal(u,u)
| ~ defined(u)
| ~ spl0_25 ),
inference(duplicate_literal_removal,[],[f601]) ).
fof(f605,plain,
( ~ defined(u)
| ~ spl0_25 ),
inference(forward_subsumption_resolution,[],[f604,f586]) ).
fof(f606,plain,
( $false
| ~ spl0_25 ),
inference(forward_subsumption_resolution,[],[f605,f30]) ).
fof(f607,plain,
~ spl0_25,
inference(avatar_contradiction_clause,[],[f606]) ).
fof(f616,plain,
( ! [X0] :
( less_or_equal(additive_identity,X0)
| equalish(u,X0) )
| spl0_25 ),
inference(resolution,[],[f585,f83]) ).
fof(f624,plain,
( spl0_4
| spl0_25 ),
inference(avatar_split_clause,[],[f616,f584,f185]) ).
fof(f1798,plain,
( less_or_equal(additive_identity,a)
| less_or_equal(additive_identity,b)
| ~ spl0_14 ),
inference(resolution,[],[f365,f49]) ).
fof(f1804,plain,
( less_or_equal(additive_identity,b)
| ~ spl0_14 ),
inference(forward_subsumption_resolution,[],[f1798,f57]) ).
fof(f1805,plain,
( $false
| ~ spl0_14 ),
inference(forward_subsumption_resolution,[],[f1804,f58]) ).
fof(f1806,plain,
~ spl0_14,
inference(avatar_contradiction_clause,[],[f1805]) ).
fof(f1930,plain,
( equalish(u,multiply(a,b))
| ~ spl0_4
| spl0_14 ),
inference(resolution,[],[f364,f186]) ).
fof(f2330,plain,
( equalish(multiply(a,b),u)
| ~ spl0_4
| spl0_14 ),
inference(resolution,[],[f1930,f51]) ).
fof(f2331,plain,
( $false
| ~ spl0_4
| spl0_14 ),
inference(forward_subsumption_resolution,[],[f2330,f59]) ).
fof(f2332,plain,
( ~ spl0_4
| spl0_14 ),
inference(avatar_contradiction_clause,[],[f2331]) ).
cnf(s24,plain,
~ spl0_25,
inference(sat_conversion,[],[f607]) ).
cnf(s25,plain,
( spl0_4
| spl0_25 ),
inference(sat_conversion,[],[f624]) ).
cnf(s123,plain,
~ spl0_14,
inference(sat_conversion,[],[f1806]) ).
cnf(s158,plain,
( ~ spl0_4
| spl0_14 ),
inference(sat_conversion,[],[f2332]) ).
cnf(s162,plain,
~ spl0_4,
inference(rat,[],[s158,s123]) ).
cnf(s170,plain,
spl0_25,
inference(rat,[],[s25,s162]) ).
cnf(s171,plain,
$false,
inference(rat,[],[s24,s170]) ).
fof(f2334,plain,
$false,
inference(avatar_sat_refutation,[],[s171]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : FLD071-2 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.21 % Computer : n018.cluster.edu
% 0.09/0.21 % Model : x86_64 x86_64
% 0.09/0.21 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.21 % Memory : 8046.5625MB
% 0.09/0.21 % OS : Linux 6.8.0-71-generic
% 0.09/0.21 % CPULimit : 300
% 0.09/0.21 % WCLimit : 300
% 0.09/0.21 % DateTime : Tue Sep 29 00:51:41 UTC 2026
% 0.09/0.22 % CPUTime :
% 0.09/0.22 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.24 Running first-order model finding
% 0.09/0.24 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.18/0.31 % (3948633)Will run a generic schedule for satisfiability detection.
% 0.18/0.31 % (3948639)% WARNING: option uhcvi not known.
% 0.18/0.31 % (3948639)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2865233581:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.31 % (3948638)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2388175865_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.31 % (3948640)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1345413682:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.31 % (3948641)dis+10_1_sil=32000:sp=arity:random_seed=467216555:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.31 % (3948644)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3550143738:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.31 % (3948642)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2846762946:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.31 % (3948643)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=804573289:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.31 % TRYING [1]
% 0.18/0.31 % TRYING [2]
% 0.18/0.31 % TRYING [3]
% 0.18/0.31 % TRYING [4]
% 0.18/0.31 % (3948639) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3948633-3948639"...
% 0.18/0.31 % (3948639)...printing done.
% 0.18/0.31 % (3948639)Refutation found. Thanks to Tanya!
% 0.18/0.31 % SZS status Unsatisfiable for theBenchmark
% 0.18/0.31 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.31 % (3948639)------------------------------
% 0.18/0.31 % (3948639)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.31 % (3948639)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.31 % (3948639)CaDiCaL version: 2.1.3
% 0.18/0.31 % (3948639)Termination reason: Refutation
% 0.18/0.31 % (3948639)Time elapsed: 0.023 s
% 0.18/0.31 % (3948639)Peak memory usage: 12 MB
% 0.18/0.31 % (3948639)Instructions burned: 63 (million)
% 0.18/0.31 % (3948633)Success in time 0.061 s
% 0.18/0.31 % Vampire exiting
%------------------------------------------------------------------------------