%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GRP488-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 : n017.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:56 AM UTC 2026
% Result : Unsatisfiable 0.11s 0.45s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 5
% Syntax : Number of formulae : 30 ( 30 unt; 0 def)
% Number of atoms : 30 ( 29 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 27 ( 27 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : double_divide(X0,double_divide(double_divide(double_divide(identity,double_divide(double_divide(X0,identity),double_divide(X1,X2))),X1),identity)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
fof(f2,axiom,
! [X0,X1] : multiply(X0,X1) = double_divide(double_divide(X1,X0),identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
fof(f3,axiom,
! [X0] : inverse(X0) = double_divide(X0,identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inverse) ).
fof(f4,plain,
! [X0] : double_divide(X0,identity) = inverse(X0),
inference(reorient_equations,[],[f3]) ).
fof(f5,axiom,
! [X0] : identity = double_divide(X0,inverse(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',identity) ).
fof(f6,negated_conjecture,
multiply(identity,a2) != a2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_2) ).
fof(f7,plain,
a2 != multiply(identity,a2),
inference(reorient_equations,[],[f6]) ).
fof(f8,plain,
! [X0] : identity = double_divide(X0,double_divide(X0,identity)),
inference(definition_unfolding,[],[f5,f4]) ).
fof(f9,plain,
a2 != double_divide(double_divide(a2,identity),identity),
inference(definition_unfolding,[],[f7,f2]) ).
fof(f10,plain,
! [X0,X1] : double_divide(X1,identity) = double_divide(X0,double_divide(double_divide(double_divide(identity,double_divide(double_divide(X0,identity),identity)),X1),identity)),
inference(superposition,[],[f1,f8]) ).
fof(f12,plain,
! [X0] : identity = double_divide(X0,double_divide(double_divide(double_divide(identity,identity),double_divide(X0,identity)),identity)),
inference(superposition,[],[f1,f8]) ).
fof(f14,plain,
identity = double_divide(double_divide(identity,identity),double_divide(identity,identity)),
inference(superposition,[],[f12,f8]) ).
fof(f20,plain,
identity = double_divide(identity,double_divide(double_divide(double_divide(identity,identity),identity),identity)),
inference(superposition,[],[f1,f14]) ).
fof(f24,plain,
! [X0] : double_divide(X0,identity) = double_divide(double_divide(identity,identity),double_divide(double_divide(identity,X0),identity)),
inference(superposition,[],[f10,f20]) ).
fof(f32,plain,
! [X0] : identity = double_divide(double_divide(double_divide(identity,double_divide(double_divide(double_divide(identity,identity),identity),identity)),X0),double_divide(double_divide(X0,identity),identity)),
inference(superposition,[],[f12,f10]) ).
fof(f34,plain,
! [X0] : identity = double_divide(double_divide(identity,X0),double_divide(double_divide(X0,identity),identity)),
inference(forward_demodulation,[],[f32,f20]) ).
fof(f43,plain,
! [X0,X1] : double_divide(double_divide(X1,identity),identity) = double_divide(X0,double_divide(double_divide(double_divide(identity,double_divide(double_divide(X0,identity),identity)),double_divide(identity,X1)),identity)),
inference(superposition,[],[f1,f34]) ).
fof(f44,plain,
! [X1] : double_divide(double_divide(X1,identity),identity) = double_divide(double_divide(identity,X1),identity),
inference(forward_demodulation,[],[f43,f10]) ).
fof(f53,plain,
a2 != double_divide(double_divide(identity,a2),identity),
inference(superposition,[],[f9,f44]) ).
fof(f102,plain,
identity = double_divide(identity,identity),
inference(superposition,[],[f24,f34]) ).
fof(f118,plain,
! [X0] : double_divide(X0,identity) = double_divide(identity,double_divide(double_divide(identity,X0),identity)),
inference(superposition,[],[f24,f102]) ).
fof(f122,plain,
! [X0] : identity = double_divide(X0,double_divide(double_divide(identity,double_divide(X0,identity)),identity)),
inference(superposition,[],[f12,f102]) ).
fof(f149,plain,
! [X0] : double_divide(X0,identity) = double_divide(identity,double_divide(double_divide(X0,identity),identity)),
inference(superposition,[],[f118,f44]) ).
fof(f198,plain,
! [X0,X1] : double_divide(X0,double_divide(double_divide(double_divide(identity,double_divide(double_divide(X0,identity),identity)),X1),identity)) = double_divide(double_divide(identity,double_divide(X1,identity)),identity),
inference(superposition,[],[f1,f122]) ).
fof(f201,plain,
! [X1] : double_divide(X1,identity) = double_divide(double_divide(identity,double_divide(X1,identity)),identity),
inference(forward_demodulation,[],[f198,f10]) ).
fof(f251,plain,
! [X0] : double_divide(double_divide(identity,double_divide(double_divide(identity,identity),double_divide(identity,X0))),identity) = X0,
inference(superposition,[],[f1,f149]) ).
fof(f264,plain,
! [X0] : double_divide(double_divide(identity,double_divide(identity,double_divide(identity,X0))),identity) = X0,
inference(forward_demodulation,[],[f251,f102]) ).
fof(f330,plain,
! [X0] : double_divide(double_divide(identity,X0),identity) = X0,
inference(superposition,[],[f201,f264]) ).
fof(f399,plain,
a2 != a2,
inference(superposition,[],[f53,f330]) ).
fof(f415,plain,
$false,
inference(trivial_inequality_removal,[],[f399]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP488-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37 % Computer : n017.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 27 10:01:21 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.40 Running first-order model finding
% 0.11/0.40 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.11/0.45 % (2307467)Will run a generic schedule for satisfiability detection.
% 0.11/0.45 % (2307474)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=55985555:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.11/0.45 % (2307473)% WARNING: option uhcvi not known.
% 0.11/0.45 % (2307473)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2453079136:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.11/0.45 % (2307475)dis+10_1_sil=32000:sp=arity:random_seed=2919915296:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.11/0.45 % (2307474) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2307467-2307474"...
% 0.11/0.45 % (2307476)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1894173680:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.11/0.45 % (2307477)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3743763903:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.11/0.45 % (2307474)...printing done.
% 0.11/0.45 % (2307474)Refutation found. Thanks to Tanya!
% 0.11/0.45 % SZS status Unsatisfiable for theBenchmark
% 0.11/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.45 % (2307474)------------------------------
% 0.11/0.45 % (2307474)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.45 % (2307474)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.45 % (2307474)CaDiCaL version: 2.1.3
% 0.11/0.45 % (2307474)Termination reason: Refutation
% 0.11/0.45 % (2307474)Time elapsed: 0.006 s
% 0.11/0.45 % (2307474)Peak memory usage: 12 MB
% 0.11/0.45 % (2307474)Instructions burned: 18 (million)
% 0.11/0.45 % (2307467)Success in time 0.037 s
% 0.11/0.45 % Vampire exiting
%------------------------------------------------------------------------------