%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : FLD031-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:38 AM UTC 2026
% Result : Unsatisfiable 0.20s 0.34s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 14
% Syntax : Number of formulae : 54 ( 17 unt; 4 def)
% Number of atoms : 113 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 122 ( 63 ~; 55 |; 0 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 5 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 33 ( 0 sgn 33 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
! [X0] :
( equalish(multiply(multiplicative_identity,X0),X0)
| ~ defined(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',existence_of_identity_multiplication) ).
fof(f7,axiom,
! [X0] :
( equalish(multiply(X0,multiplicative_inverse(X0)),multiplicative_identity)
| ~ defined(X0)
| equalish(X0,additive_identity) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',existence_of_inverse_multiplication) ).
fof(f15,axiom,
! [X0] :
( defined(multiplicative_inverse(X0))
| ~ defined(X0)
| equalish(X0,additive_identity) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',well_definedness_of_multiplicative_inverse) ).
fof(f22,axiom,
! [X0,X1] :
( equalish(X0,X1)
| ~ equalish(X1,X0) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/FLD001-0.ax',transitivity_of_equality) ).
fof(f25,axiom,
! [X2,X0,X1] :
( equalish(multiply(X0,X1),multiply(X2,X1))
| ~ defined(X1)
| ~ equalish(X0,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',compatibility_of_equality_and_multiplication) ).
fof(f28,axiom,
defined(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_is_defined) ).
fof(f29,negated_conjecture,
equalish(a,multiplicative_identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_equals_multiplicative_identity_2) ).
fof(f30,negated_conjecture,
~ equalish(a,additive_identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_not_equal_to_additive_identity_3) ).
fof(f31,negated_conjecture,
~ equalish(multiplicative_inverse(a),multiplicative_identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiplicative_inverses_not_equal) ).
fof(f37,plain,
! [X0] :
( ~ equalish(multiply(multiplicative_identity,X0),X0)
| ~ defined(X0) ),
inference(consistent_polarity_flipping,[],[f6]) ).
fof(f38,plain,
! [X0] :
( ~ equalish(multiply(X0,multiplicative_inverse(X0)),multiplicative_identity)
| ~ defined(X0)
| ~ equalish(X0,additive_identity) ),
inference(consistent_polarity_flipping,[],[f7]) ).
fof(f41,plain,
! [X0] :
( defined(multiplicative_inverse(X0))
| ~ defined(X0)
| ~ equalish(X0,additive_identity) ),
inference(consistent_polarity_flipping,[],[f15]) ).
fof(f44,plain,
! [X0,X1] :
( equalish(X1,X0)
| ~ equalish(X0,X1) ),
inference(consistent_polarity_flipping,[],[f22]) ).
fof(f45,plain,
! [X2,X0,X1] :
( equalish(X2,X1)
| equalish(X0,X2)
| ~ equalish(X0,X1) ),
inference(consistent_polarity_flipping,[],[f23]) ).
fof(f47,plain,
! [X2,X0,X1] :
( ~ equalish(multiply(X0,X1),multiply(X2,X1))
| ~ defined(X1)
| equalish(X0,X2) ),
inference(consistent_polarity_flipping,[],[f25]) ).
fof(f50,plain,
~ equalish(a,multiplicative_identity),
inference(consistent_polarity_flipping,[],[f29]) ).
fof(f51,plain,
equalish(a,additive_identity),
inference(consistent_polarity_flipping,[],[f30]) ).
fof(f52,plain,
equalish(multiplicative_inverse(a),multiplicative_identity),
inference(consistent_polarity_flipping,[],[f31]) ).
fof(f53,plain,
~ equalish(multiplicative_identity,a),
inference(resolution,[],[f44,f50]) ).
fof(f72,plain,
! [X0,X1] :
( equalish(X0,multiply(multiplicative_identity,X1))
| ~ equalish(X0,X1)
| ~ defined(X1) ),
inference(resolution,[],[f45,f37]) ).
fof(f80,definition,
( spl0_1
<=> defined(a) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f82,plain,
( ~ defined(a)
| spl0_1 ),
inference(avatar_component_clause,[],[f80]) ).
fof(f95,plain,
( $false
| spl0_1 ),
inference(resolution,[],[f82,f28]) ).
fof(f96,plain,
spl0_1,
inference(avatar_contradiction_clause,[],[f95]) ).
fof(f378,plain,
! [X0,X1] :
( equalish(X1,multiply(X0,multiplicative_inverse(X0)))
| ~ equalish(X0,additive_identity)
| ~ defined(X0)
| ~ equalish(X1,multiplicative_identity) ),
inference(resolution,[],[f38,f45]) ).
fof(f857,plain,
! [X2,X0,X1] :
( equalish(X1,X2)
| ~ defined(X0)
| ~ equalish(multiply(X2,X0),multiply(X1,X0)) ),
inference(resolution,[],[f47,f44]) ).
fof(f3628,plain,
! [X0] :
( ~ equalish(multiply(a,X0),multiply(multiplicative_identity,X0))
| ~ defined(X0) ),
inference(resolution,[],[f857,f53]) ).
fof(f3684,plain,
! [X0] :
( ~ defined(X0)
| ~ equalish(multiply(a,X0),X0)
| ~ defined(X0) ),
inference(resolution,[],[f3628,f72]) ).
fof(f3689,plain,
! [X0] :
( ~ equalish(multiply(a,X0),X0)
| ~ defined(X0) ),
inference(duplicate_literal_removal,[],[f3684]) ).
fof(f3693,plain,
! [X0] :
( ~ equalish(X0,multiply(a,X0))
| ~ defined(X0) ),
inference(resolution,[],[f3689,f44]) ).
fof(f4282,plain,
( ~ equalish(a,additive_identity)
| ~ defined(a)
| ~ equalish(multiplicative_inverse(a),multiplicative_identity)
| ~ defined(multiplicative_inverse(a)) ),
inference(resolution,[],[f378,f3693]) ).
fof(f4298,definition,
( spl0_127
<=> defined(multiplicative_inverse(a)) ),
introduced(definition,[new_symbols(definition,[spl0_127])],[avatar_definition]) ).
fof(f4300,plain,
( ~ defined(multiplicative_inverse(a))
| spl0_127 ),
inference(avatar_component_clause,[],[f4298]) ).
fof(f4302,definition,
( spl0_128
<=> equalish(multiplicative_inverse(a),multiplicative_identity) ),
introduced(definition,[new_symbols(definition,[spl0_128])],[avatar_definition]) ).
fof(f4304,plain,
( ~ equalish(multiplicative_inverse(a),multiplicative_identity)
| spl0_128 ),
inference(avatar_component_clause,[],[f4302]) ).
fof(f4306,definition,
( spl0_129
<=> equalish(a,additive_identity) ),
introduced(definition,[new_symbols(definition,[spl0_129])],[avatar_definition]) ).
fof(f4308,plain,
( ~ equalish(a,additive_identity)
| spl0_129 ),
inference(avatar_component_clause,[],[f4306]) ).
fof(f4309,plain,
( ~ spl0_127
| ~ spl0_128
| ~ spl0_1
| ~ spl0_129 ),
inference(avatar_split_clause,[],[f4282,f4306,f80,f4302,f4298]) ).
fof(f4310,plain,
( ~ defined(a)
| ~ equalish(a,additive_identity)
| spl0_127 ),
inference(resolution,[],[f4300,f41]) ).
fof(f4311,plain,
( $false
| spl0_129 ),
inference(resolution,[],[f4308,f51]) ).
fof(f4320,plain,
spl0_129,
inference(avatar_contradiction_clause,[],[f4311]) ).
fof(f4321,plain,
( ~ spl0_129
| ~ spl0_1
| spl0_127 ),
inference(avatar_split_clause,[],[f4310,f4298,f80,f4306]) ).
fof(f4322,plain,
( $false
| spl0_128 ),
inference(resolution,[],[f4304,f52]) ).
fof(f4341,plain,
spl0_128,
inference(avatar_contradiction_clause,[],[f4322]) ).
cnf(s3,plain,
spl0_1,
inference(sat_conversion,[],[f96]) ).
cnf(s144,plain,
( ~ spl0_1
| ~ spl0_127
| ~ spl0_128
| ~ spl0_129 ),
inference(sat_conversion,[],[f4309]) ).
cnf(s145,plain,
spl0_129,
inference(sat_conversion,[],[f4320]) ).
cnf(s146,plain,
( ~ spl0_1
| spl0_127
| ~ spl0_129 ),
inference(sat_conversion,[],[f4321]) ).
cnf(s147,plain,
spl0_128,
inference(sat_conversion,[],[f4341]) ).
cnf(s148,plain,
( ~ spl0_1
| ~ spl0_127 ),
inference(rat,[],[s144,s145,s147]) ).
cnf(s194,plain,
spl0_127,
inference(rat,[],[s146,s145,s3]) ).
cnf(s195,plain,
$false,
inference(rat,[],[s148,s194,s3]) ).
fof(f4342,plain,
$false,
inference(avatar_sat_refutation,[],[s195]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : FLD031-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.19 % Computer : n013.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:29:37 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.22 Running first-order model finding
% 0.08/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.20/0.34 % (1746092)Will run a generic schedule for satisfiability detection.
% 0.20/0.34 % (1746097)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1018835678_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.34 % TRYING [1]
% 0.20/0.34 % TRYING [2]
% 0.20/0.34 % TRYING [3]
% 0.20/0.34 % (1746098)% WARNING: option uhcvi not known.
% 0.20/0.34 % TRYING [4]
% 0.20/0.34 % (1746098)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4202319589:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.34 % (1746102)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2993855556:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.34 % (1746099)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1880326468:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.34 % (1746100)dis+10_1_sil=32000:sp=arity:random_seed=654471201:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.34 % (1746101)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4206090250:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.34 % (1746103)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2777443765:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.34 % TRYING [5]
% 0.20/0.34 % TRYING [6]
% 0.20/0.34 % (1746103) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1746092-1746103"...
% 0.20/0.34 % (1746103)...printing done.
% 0.20/0.34 % (1746100)Instruction limit reached!
% 0.20/0.34 % (1746100)------------------------------
% 0.20/0.34 % (1746100)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.34 % (1746100)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.34 % (1746100)CaDiCaL version: 2.1.3
% 0.20/0.34 % (1746100)Termination reason: Instruction limit
% 0.20/0.34 % (1746100)Termination phase: Saturation
% 0.20/0.34 % (1746100)Time elapsed: 0.063 s
% 0.20/0.34 % (1746100)Peak memory usage: 12 MB
% 0.20/0.34 % (1746100)Instructions burned: 103 (million)
% 0.20/0.34 % (1746103)Refutation found. Thanks to Tanya!
% 0.20/0.34 % SZS status Unsatisfiable for theBenchmark
% 0.20/0.34 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.34 % (1746103)------------------------------
% 0.20/0.34 % (1746103)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.34 % (1746103)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.34 % (1746103)CaDiCaL version: 2.1.3
% 0.20/0.34 % (1746103)Termination reason: Refutation
% 0.20/0.34 % (1746103)Time elapsed: 0.061 s
% 0.20/0.34 % (1746103)Peak memory usage: 14 MB
% 0.20/0.34 % (1746103)Instructions burned: 97 (million)
% 0.20/0.34 % (1746092)Success in time 0.109 s
% 0.20/0.34 % Vampire exiting
%------------------------------------------------------------------------------