%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : BOO025-1 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n005.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:36:12 AM UTC 2026
% Result : Unsatisfiable 0.84s 0.45s
% Output : Refutation 0.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 45
% Number of leaves : 7
% Syntax : Number of formulae : 69 ( 69 unt; 0 def)
% Number of atoms : 69 ( 68 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 75 ( 75 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : multiply(add(X0,X1),X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply_add) ).
fof(f2,axiom,
! [X2,X0,X1] : multiply(X0,add(X1,X2)) = add(multiply(X1,X0),multiply(X2,X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply_add_property) ).
fof(f3,axiom,
! [X0] : add(X0,inverse(X0)) = n1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',additive_inverse) ).
fof(f4,axiom,
! [X2,X0,X1] : pixley(X0,X1,X2) = add(multiply(X0,inverse(X1)),add(multiply(X0,X2),multiply(inverse(X1),X2))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pixley_defn) ).
fof(f5,axiom,
! [X0,X1] : pixley(X0,X0,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pixley1) ).
fof(f6,axiom,
! [X0,X1] : pixley(X0,X1,X1) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pixley2) ).
fof(f8,negated_conjecture,
multiply(b,inverse(b)) != multiply(a,inverse(a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_equal_identity) ).
fof(f9,plain,
! [X0,X1] : add(multiply(X0,inverse(X0)),add(multiply(X0,X1),multiply(inverse(X0),X1))) = X1,
inference(definition_unfolding,[],[f5,f4]) ).
fof(f10,plain,
! [X0,X1] : add(multiply(X0,inverse(X1)),add(multiply(X0,X1),multiply(inverse(X1),X1))) = X0,
inference(definition_unfolding,[],[f6,f4]) ).
fof(f12,plain,
! [X0] : inverse(X0) = multiply(n1,inverse(X0)),
inference(superposition,[],[f1,f3]) ).
fof(f13,plain,
! [X2,X0,X1] : multiply(X0,add(add(X1,X0),X2)) = add(X0,multiply(X2,X0)),
inference(superposition,[],[f2,f1]) ).
fof(f14,plain,
! [X0,X1] : multiply(inverse(X0),add(n1,X1)) = add(inverse(X0),multiply(X1,inverse(X0))),
inference(superposition,[],[f2,f12]) ).
fof(f15,plain,
! [X2,X0,X1] : multiply(X0,add(X1,add(X2,X0))) = add(multiply(X1,X0),X0),
inference(superposition,[],[f2,f1]) ).
fof(f16,plain,
! [X0,X1] : multiply(inverse(X0),add(X1,n1)) = add(multiply(X1,inverse(X0)),inverse(X0)),
inference(superposition,[],[f2,f12]) ).
fof(f17,plain,
! [X2,X0,X1] : multiply(X2,X0) = multiply(multiply(X0,add(X1,X2)),multiply(X2,X0)),
inference(superposition,[],[f1,f2]) ).
fof(f20,plain,
! [X0,X1] : add(X0,multiply(inverse(add(X1,X0)),X0)) = multiply(X0,n1),
inference(superposition,[],[f13,f3]) ).
fof(f23,plain,
! [X0] : multiply(inverse(X0),n1) = add(inverse(X0),multiply(inverse(n1),inverse(X0))),
inference(superposition,[],[f20,f3]) ).
fof(f38,plain,
! [X0,X1] : multiply(inverse(X0),X1) = multiply(multiply(X1,n1),multiply(inverse(X0),X1)),
inference(superposition,[],[f17,f3]) ).
fof(f72,plain,
! [X0] : add(inverse(X0),inverse(X0)) = multiply(inverse(X0),add(n1,n1)),
inference(superposition,[],[f14,f12]) ).
fof(f89,plain,
! [X0] : add(inverse(X0),inverse(X0)) = multiply(multiply(add(n1,n1),n1),add(inverse(X0),inverse(X0))),
inference(superposition,[],[f38,f72]) ).
fof(f95,plain,
! [X0] : add(inverse(X0),inverse(X0)) = multiply(n1,add(inverse(X0),inverse(X0))),
inference(forward_demodulation,[],[f89,f1]) ).
fof(f116,plain,
! [X0,X1] : add(multiply(X0,inverse(X0)),multiply(X1,add(X0,inverse(X0)))) = X1,
inference(forward_demodulation,[],[f9,f2]) ).
fof(f117,plain,
! [X0,X1] : add(multiply(X0,inverse(X0)),multiply(X1,n1)) = X1,
inference(forward_demodulation,[],[f116,f3]) ).
fof(f118,plain,
! [X0] : add(inverse(n1),multiply(X0,n1)) = X0,
inference(superposition,[],[f117,f12]) ).
fof(f125,plain,
! [X0] : add(X0,n1) = add(inverse(n1),n1),
inference(superposition,[],[f118,f1]) ).
fof(f131,plain,
! [X0,X1] : add(X1,n1) = add(X0,n1),
inference(superposition,[],[f125,f125]) ).
fof(f160,plain,
! [X0,X1] : multiply(X1,add(X0,n1)) = add(X1,multiply(n1,X1)),
inference(superposition,[],[f13,f131]) ).
fof(f162,plain,
! [X0,X1] : add(inverse(X1),inverse(X1)) = multiply(inverse(X1),add(X0,n1)),
inference(superposition,[],[f72,f131]) ).
fof(f765,plain,
! [X0,X1] : add(multiply(X0,inverse(X1)),multiply(X1,add(X0,inverse(X1)))) = X0,
inference(forward_demodulation,[],[f10,f2]) ).
fof(f774,plain,
inverse(n1) = add(multiply(inverse(n1),inverse(n1)),add(inverse(n1),inverse(n1))),
inference(superposition,[],[f765,f95]) ).
fof(f786,plain,
multiply(inverse(n1),inverse(n1)) = add(multiply(multiply(inverse(n1),inverse(n1)),inverse(n1)),inverse(n1)),
inference(superposition,[],[f15,f774]) ).
fof(f792,plain,
multiply(inverse(n1),inverse(n1)) = multiply(inverse(n1),add(multiply(inverse(n1),inverse(n1)),n1)),
inference(forward_demodulation,[],[f786,f16]) ).
fof(f793,plain,
multiply(inverse(n1),inverse(n1)) = add(inverse(n1),multiply(n1,inverse(n1))),
inference(forward_demodulation,[],[f792,f160]) ).
fof(f794,plain,
multiply(inverse(n1),inverse(n1)) = multiply(inverse(n1),add(n1,n1)),
inference(forward_demodulation,[],[f793,f14]) ).
fof(f795,plain,
add(inverse(n1),inverse(n1)) = multiply(inverse(n1),inverse(n1)),
inference(forward_demodulation,[],[f794,f72]) ).
fof(f803,plain,
inverse(n1) = multiply(multiply(inverse(n1),inverse(n1)),inverse(n1)),
inference(superposition,[],[f1,f795]) ).
fof(f811,plain,
multiply(inverse(n1),inverse(n1)) = add(inverse(n1),multiply(n1,add(multiply(inverse(n1),inverse(n1)),inverse(n1)))),
inference(superposition,[],[f765,f803]) ).
fof(f820,plain,
multiply(inverse(n1),inverse(n1)) = add(inverse(n1),multiply(n1,multiply(inverse(n1),add(inverse(n1),n1)))),
inference(forward_demodulation,[],[f811,f16]) ).
fof(f822,plain,
multiply(inverse(n1),inverse(n1)) = add(inverse(n1),multiply(n1,add(inverse(n1),inverse(n1)))),
inference(forward_demodulation,[],[f820,f162]) ).
fof(f824,plain,
multiply(inverse(n1),inverse(n1)) = add(inverse(n1),add(inverse(n1),inverse(n1))),
inference(forward_demodulation,[],[f822,f95]) ).
fof(f825,plain,
multiply(inverse(n1),inverse(n1)) = add(inverse(n1),multiply(inverse(n1),inverse(n1))),
inference(forward_demodulation,[],[f824,f795]) ).
fof(f826,plain,
multiply(inverse(n1),inverse(n1)) = multiply(inverse(n1),n1),
inference(forward_demodulation,[],[f825,f23]) ).
fof(f829,plain,
multiply(inverse(n1),n1) = add(inverse(n1),multiply(inverse(n1),n1)),
inference(superposition,[],[f23,f826]) ).
fof(f840,plain,
inverse(n1) = multiply(inverse(n1),n1),
inference(forward_demodulation,[],[f829,f118]) ).
fof(f859,plain,
! [X0] : add(inverse(n1),multiply(X0,n1)) = multiply(n1,add(inverse(n1),X0)),
inference(superposition,[],[f2,f840]) ).
fof(f860,plain,
! [X0] : multiply(n1,add(inverse(n1),X0)) = X0,
inference(forward_demodulation,[],[f859,f118]) ).
fof(f910,plain,
! [X0] : multiply(X0,n1) = multiply(n1,X0),
inference(superposition,[],[f860,f118]) ).
fof(f959,plain,
! [X0] : add(inverse(n1),multiply(n1,X0)) = X0,
inference(superposition,[],[f118,f910]) ).
fof(f1250,plain,
! [X0] : inverse(X0) = add(inverse(n1),inverse(X0)),
inference(superposition,[],[f959,f12]) ).
fof(f1285,plain,
n1 = inverse(inverse(n1)),
inference(superposition,[],[f1250,f3]) ).
fof(f1322,plain,
! [X0] : add(multiply(X0,n1),multiply(inverse(n1),add(X0,n1))) = X0,
inference(superposition,[],[f765,f1285]) ).
fof(f1326,plain,
! [X0] : add(multiply(X0,n1),add(inverse(n1),inverse(n1))) = X0,
inference(forward_demodulation,[],[f1322,f162]) ).
fof(f1335,plain,
! [X0] : add(multiply(X0,n1),multiply(inverse(n1),inverse(n1))) = X0,
inference(forward_demodulation,[],[f1326,f795]) ).
fof(f1339,plain,
! [X0] : add(multiply(X0,n1),multiply(inverse(n1),n1)) = X0,
inference(forward_demodulation,[],[f1335,f826]) ).
fof(f1342,plain,
! [X0] : multiply(n1,add(X0,inverse(n1))) = X0,
inference(forward_demodulation,[],[f1339,f2]) ).
fof(f1423,plain,
! [X0] : multiply(inverse(n1),n1) = multiply(X0,multiply(inverse(n1),n1)),
inference(superposition,[],[f17,f1342]) ).
fof(f1430,plain,
! [X0] : multiply(n1,inverse(n1)) = multiply(X0,multiply(n1,inverse(n1))),
inference(forward_demodulation,[],[f1423,f910]) ).
fof(f1438,plain,
! [X0] : inverse(n1) = multiply(X0,inverse(n1)),
inference(forward_demodulation,[],[f1430,f12]) ).
fof(f1493,plain,
! [X0] : add(inverse(n1),multiply(n1,add(X0,inverse(n1)))) = X0,
inference(superposition,[],[f765,f1438]) ).
fof(f1514,plain,
! [X0] : add(X0,inverse(n1)) = X0,
inference(forward_demodulation,[],[f1493,f959]) ).
fof(f1521,plain,
! [X0] : multiply(n1,X0) = X0,
inference(superposition,[],[f1342,f1514]) ).
fof(f1548,plain,
! [X0] : add(inverse(n1),X0) = X0,
inference(superposition,[],[f1521,f860]) ).
fof(f1694,plain,
! [X0] : inverse(n1) = add(multiply(inverse(n1),inverse(X0)),multiply(X0,inverse(X0))),
inference(superposition,[],[f765,f1548]) ).
fof(f1739,plain,
! [X0] : inverse(n1) = multiply(inverse(X0),add(inverse(n1),X0)),
inference(forward_demodulation,[],[f1694,f2]) ).
fof(f1757,plain,
! [X0] : inverse(n1) = multiply(inverse(X0),X0),
inference(forward_demodulation,[],[f1739,f1548]) ).
fof(f1879,plain,
! [X0] : inverse(n1) = add(multiply(X0,inverse(X0)),inverse(n1)),
inference(superposition,[],[f117,f1757]) ).
fof(f1882,plain,
! [X0] : multiply(X0,inverse(X0)) = inverse(n1),
inference(forward_demodulation,[],[f1879,f1514]) ).
fof(f2259,plain,
multiply(b,inverse(b)) != inverse(n1),
inference(superposition,[],[f8,f1882]) ).
fof(f2260,plain,
$false,
inference(forward_subsumption_resolution,[],[f2259,f1882]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : BOO025-1 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.24 % Computer : n005.cluster.edu
% 0.12/0.24 % Model : x86_64 x86_64
% 0.12/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.24 % Memory : 8046.5625MB
% 0.12/0.24 % OS : Linux 6.8.0-71-generic
% 0.12/0.24 % CPULimit : 300
% 0.12/0.24 % WCLimit : 300
% 0.12/0.24 % DateTime : Mon Sep 28 21:04:32 UTC 2026
% 0.12/0.25 % CPUTime :
% 0.12/0.25 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.28 Running first-order model finding
% 0.12/0.28 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.84/0.45 % (1174729)Will run a generic schedule for satisfiability detection.
% 0.84/0.45 % (1174739)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3544640194:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 0.84/0.45 % (1174735)% WARNING: option uhcvi not known.
% 0.84/0.45 % (1174734)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1560152385_3000 on theBenchmark for (3000ds/0Mi)
% 0.84/0.45 % TRYING [1]
% 0.84/0.45 % TRYING [2]
% 0.84/0.45 % (1174735)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2601063591:i=135531:add=off:rawr=on_3000 on theBenchmark for (3000ds/135531Mi)
% 0.84/0.45 % (1174738)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1541551565:i=116_3000 on theBenchmark for (3000ds/116Mi)
% 0.84/0.45 % (1174737)dis+10_1_sil=32000:sp=arity:random_seed=3823925428:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 0.84/0.45 % TRYING [3]
% 0.84/0.45 % TRYING [4]
% 0.84/0.45 % (1174736)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=324151867:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 0.84/0.45 % (1174740)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=443132157:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_3000 on theBenchmark for (3000ds/159Mi)
% 0.84/0.45 % (1174739)Instruction limit reached!
% 0.84/0.45 % (1174739)------------------------------
% 0.84/0.45 % (1174739)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.84/0.45 % (1174739)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.84/0.45 % (1174739)CaDiCaL version: 2.1.3
% 0.84/0.45 % (1174739)Termination reason: Instruction limit
% 0.84/0.45 % (1174739)Termination phase: Saturation
% 0.84/0.45 % (1174739)Time elapsed: 0.060 s
% 0.84/0.45 % (1174739)Peak memory usage: 13 MB
% 0.84/0.45 % (1174739)Instructions burned: 133 (million)
% 0.84/0.45 % (1174749)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=352875498:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.84/0.45 % TRYING [1]
% 0.84/0.45 % TRYING [2]
% 0.84/0.45 % TRYING [3]
% 0.84/0.45 % TRYING [4]
% 0.84/0.45 % TRYING [5]
% 0.84/0.45 % (1174737)Instruction limit reached!
% 0.84/0.45 % (1174737)------------------------------
% 0.84/0.45 % (1174737)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.84/0.45 % (1174737)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.84/0.45 % (1174737)CaDiCaL version: 2.1.3
% 0.84/0.45 % (1174737)Termination reason: Instruction limit
% 0.84/0.45 % (1174737)Termination phase: Saturation
% 0.84/0.45 % (1174737)Time elapsed: 0.100 s
% 0.84/0.45 % (1174737)Peak memory usage: 12 MB
% 0.84/0.45 % (1174737)Instructions burned: 103 (million)
% 0.84/0.45 % TRYING [5]
% 0.84/0.45 % (1174738)Instruction limit reached!
% 0.84/0.45 % (1174738)------------------------------
% 0.84/0.45 % (1174738)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.84/0.45 % (1174738)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.84/0.45 % (1174738)CaDiCaL version: 2.1.3
% 0.84/0.45 % (1174738)Termination reason: Instruction limit
% 0.84/0.45 % (1174738)Termination phase: Saturation
% 0.84/0.45 % (1174738)Time elapsed: 0.119 s
% 0.84/0.45 % (1174738)Peak memory usage: 13 MB
% 0.84/0.45 % (1174738)Instructions burned: 116 (million)
% 0.84/0.45 % (1174736) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1174729-1174736"...
% 0.84/0.45 % (1174736)...printing done.
% 0.84/0.45 % (1174736)Refutation found. Thanks to Tanya!
% 0.84/0.45 % SZS status Unsatisfiable for theBenchmark
% 0.84/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.84/0.46 % (1174736)------------------------------
% 0.84/0.46 % (1174736)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.84/0.46 % (1174736)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.84/0.46 % (1174736)CaDiCaL version: 2.1.3
% 0.84/0.46 % (1174736)Termination reason: Refutation
% 0.84/0.46 % (1174736)Time elapsed: 0.092 s
% 0.84/0.46 % (1174736)Peak memory usage: 12 MB
% 0.84/0.46 % (1174736)Instructions burned: 85 (million)
% 0.84/0.46 % (1174729)Success in time 0.164 s
% 0.84/0.46 % Vampire exiting
%------------------------------------------------------------------------------