%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GRP455-1 : TPTP v9.3.1. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n026.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 10:17:52 AM UTC 2026
% Result : Unsatisfiable 0.12s 0.45s
% Output : Refutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 21 ( 21 unt; 0 def)
% Number of atoms : 21 ( 20 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 27 ( 27 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : divide(divide(identity,divide(X0,divide(X1,divide(divide(divide(X0,X0),X0),X2)))),X2) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
fof(f2,axiom,
! [X0,X1] : multiply(X0,X1) = divide(X0,divide(identity,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
fof(f4,axiom,
! [X0] : identity = divide(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',identity) ).
fof(f5,negated_conjecture,
multiply(identity,a2) != a2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_2) ).
fof(f6,plain,
a2 != multiply(identity,a2),
inference(reorient_equations,[],[f5]) ).
fof(f7,plain,
a2 != divide(identity,divide(identity,a2)),
inference(definition_unfolding,[],[f6,f2]) ).
fof(f8,plain,
! [X2,X0,X1] : divide(divide(identity,divide(X0,divide(X1,divide(divide(identity,X0),X2)))),X2) = X1,
inference(forward_demodulation,[],[f1,f4]) ).
fof(f9,plain,
! [X0,X1] : divide(divide(identity,divide(identity,divide(X0,divide(identity,X1)))),X1) = X0,
inference(superposition,[],[f8,f4]) ).
fof(f10,plain,
! [X2,X3,X0,X1] : divide(divide(identity,divide(divide(X1,divide(X0,divide(divide(identity,X1),X2))),divide(X3,X0))),X2) = X3,
inference(superposition,[],[f8,f8]) ).
fof(f11,plain,
! [X0,X1] : divide(divide(identity,divide(X0,divide(X1,identity))),divide(identity,X0)) = X1,
inference(superposition,[],[f8,f4]) ).
fof(f12,plain,
! [X0,X1] : divide(divide(identity,X0),X1) = divide(divide(identity,divide(X0,identity)),X1),
inference(superposition,[],[f8,f4]) ).
fof(f24,plain,
! [X0] : divide(divide(identity,identity),divide(identity,divide(X0,identity))) = X0,
inference(superposition,[],[f11,f4]) ).
fof(f31,plain,
! [X0] : divide(identity,divide(identity,divide(X0,identity))) = X0,
inference(forward_demodulation,[],[f24,f4]) ).
fof(f36,plain,
! [X0] : divide(X0,divide(identity,identity)) = X0,
inference(superposition,[],[f11,f31]) ).
fof(f45,plain,
! [X0] : divide(X0,identity) = X0,
inference(forward_demodulation,[],[f36,f4]) ).
fof(f119,plain,
! [X0] : divide(divide(identity,divide(identity,identity)),divide(identity,divide(X0,identity))) = X0,
inference(superposition,[],[f10,f9]) ).
fof(f137,plain,
! [X0] : divide(divide(identity,identity),divide(identity,divide(X0,identity))) = X0,
inference(forward_demodulation,[],[f119,f12]) ).
fof(f153,plain,
! [X0] : divide(divide(identity,identity),divide(identity,X0)) = X0,
inference(forward_demodulation,[],[f137,f45]) ).
fof(f156,plain,
! [X0] : divide(identity,divide(identity,X0)) = X0,
inference(forward_demodulation,[],[f153,f4]) ).
fof(f162,plain,
a2 != a2,
inference(superposition,[],[f7,f156]) ).
fof(f179,plain,
$false,
inference(trivial_inequality_removal,[],[f162]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP455-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.38 % Computer : n026.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Sun Sep 27 10:07:56 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.41 Running first-order model finding
% 0.12/0.41 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.12/0.45 % (2595566)Will run a generic schedule for satisfiability detection.
% 0.12/0.45 % (2595582)dis+10_1_sil=32000:sp=arity:random_seed=1571503741:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.12/0.45 % (2595582) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2595566-2595582"...
% 0.12/0.45 % (2595579)% WARNING: option uhcvi not known.
% 0.12/0.45 % (2595582)...printing done.
% 0.12/0.45 % (2595582)Refutation found. Thanks to Tanya!
% 0.12/0.45 % SZS status Unsatisfiable for theBenchmark
% 0.12/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.45 % (2595582)------------------------------
% 0.12/0.45 % (2595582)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.12/0.45 % (2595582)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.12/0.45 % (2595582)CaDiCaL version: 2.1.3
% 0.12/0.45 % (2595582)Termination reason: Refutation
% 0.12/0.45 % (2595582)Time elapsed: 0.003 s
% 0.12/0.45 % (2595582)Peak memory usage: 11 MB
% 0.12/0.45 % (2595582)Instructions burned: 9 (million)
% 0.12/0.45 % (2595566)Success in time 0.031 s
% 0.12/0.45 % Vampire exiting
%------------------------------------------------------------------------------