%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GRP537-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 : n007.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:18:03 AM UTC 2026
% Result : Unsatisfiable 0.10s 0.46s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 16 ( 16 unt; 0 def)
% Number of atoms : 16 ( 15 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 7 ( 7 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 19 ( 19 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : divide(divide(X0,X1),divide(divide(X0,X2),X1)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
fof(f2,axiom,
! [X2,X0,X1] : multiply(X0,X1) = divide(X0,divide(divide(X2,X2),X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
fof(f3,axiom,
! [X0,X1] : inverse(X0) = divide(divide(X1,X1),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inverse) ).
fof(f4,axiom,
! [X0] : identity = divide(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',identity) ).
fof(f5,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_1) ).
fof(f6,plain,
! [X0,X1] : divide(X1,X1) = divide(X0,X0),
inference(superposition,[],[f4,f4]) ).
fof(f18,plain,
! [X0] : inverse(X0) = divide(identity,X0),
inference(superposition,[],[f3,f4]) ).
fof(f19,plain,
! [X0] : multiply(inverse(a1),a1) != multiply(divide(divide(X0,X0),b1),b1),
inference(superposition,[],[f5,f3]) ).
fof(f22,plain,
multiply(inverse(a1),a1) != multiply(divide(identity,b1),b1),
inference(superposition,[],[f19,f4]) ).
fof(f24,plain,
multiply(divide(identity,b1),b1) != multiply(divide(identity,a1),a1),
inference(forward_demodulation,[],[f22,f18]) ).
fof(f31,plain,
! [X2,X0,X1] : divide(divide(X1,X2),divide(divide(X0,X0),X2)) = X1,
inference(superposition,[],[f1,f6]) ).
fof(f44,plain,
! [X0,X1] : multiply(X0,X1) = divide(X0,divide(identity,X1)),
inference(superposition,[],[f2,f4]) ).
fof(f50,plain,
! [X0] : multiply(divide(identity,a1),a1) != divide(divide(identity,b1),divide(divide(X0,X0),b1)),
inference(superposition,[],[f24,f2]) ).
fof(f55,plain,
identity != multiply(divide(identity,a1),a1),
inference(forward_demodulation,[],[f50,f31]) ).
fof(f58,plain,
identity != divide(divide(identity,a1),divide(identity,a1)),
inference(forward_demodulation,[],[f55,f44]) ).
fof(f61,plain,
$false,
inference(forward_subsumption_resolution,[],[f58,f4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP537-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.10/0.37 % Computer : n007.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 27 10:04:24 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.41 Running first-order model finding
% 0.10/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.10/0.46 % (1177163)Will run a generic schedule for satisfiability detection.
% 0.10/0.46 % (1177186)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=182971370:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.10/0.46 % (1177186) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1177163-1177186"...
% 0.10/0.46 % (1177186)...printing done.
% 0.10/0.46 % (1177181)% WARNING: option uhcvi not known.
% 0.10/0.46 % (1177186)Refutation found. Thanks to Tanya!
% 0.10/0.46 % SZS status Unsatisfiable for theBenchmark
% 0.10/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.46 % (1177186)------------------------------
% 0.10/0.46 % (1177186)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.46 % (1177186)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.46 % (1177186)CaDiCaL version: 2.1.3
% 0.10/0.46 % (1177186)Termination reason: Refutation
% 0.10/0.46 % (1177186)Time elapsed: 0.002 s
% 0.10/0.46 % (1177186)Peak memory usage: 11 MB
% 0.10/0.46 % (1177186)Instructions burned: 3 (million)
% 0.10/0.46 % (1177163)Success in time 0.037 s
% 0.10/0.46 % Vampire exiting
%------------------------------------------------------------------------------