%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GRP497-1 : TPTP v9.3.1. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/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:17:58 AM UTC 2026
% Result : Unsatisfiable 0.14s 0.45s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 32 ( 32 unt; 0 def)
% Number of atoms : 32 ( 31 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 9 ( 9 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 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 : 35 ( 35 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : double_divide(double_divide(identity,double_divide(X0,double_divide(X1,identity))),double_divide(double_divide(X1,double_divide(X2,X0)),identity)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
fof(f2,axiom,
! [X0,X1] : multiply(X0,X1) = double_divide(double_divide(X1,X0),identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
fof(f3,axiom,
! [X0] : inverse(X0) = double_divide(X0,identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inverse) ).
fof(f4,axiom,
! [X0] : identity = double_divide(X0,inverse(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity) ).
fof(f5,negated_conjecture,
multiply(identity,a2) != a2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_2) ).
fof(f6,plain,
a2 != multiply(identity,a2),
inference(reorient_equations,[],[f5]) ).
fof(f7,plain,
! [X0] : identity = double_divide(X0,double_divide(X0,identity)),
inference(definition_unfolding,[],[f4,f3]) ).
fof(f8,plain,
a2 != double_divide(double_divide(a2,identity),identity),
inference(definition_unfolding,[],[f6,f2]) ).
fof(f9,plain,
! [X0,X1] : double_divide(double_divide(identity,identity),double_divide(double_divide(X0,double_divide(X1,X0)),identity)) = X1,
inference(superposition,[],[f1,f7]) ).
fof(f11,plain,
! [X0,X1] : double_divide(double_divide(identity,double_divide(double_divide(X0,identity),double_divide(X1,identity))),double_divide(double_divide(X1,identity),identity)) = X0,
inference(superposition,[],[f1,f7]) ).
fof(f12,plain,
! [X2,X3,X0,X1] : double_divide(identity,double_divide(X2,double_divide(X1,identity))) = double_divide(double_divide(identity,double_divide(double_divide(double_divide(X1,double_divide(X0,X2)),identity),double_divide(X3,identity))),double_divide(double_divide(X3,X0),identity)),
inference(superposition,[],[f1,f1]) ).
fof(f13,plain,
! [X0] : double_divide(double_divide(identity,double_divide(identity,double_divide(X0,identity))),double_divide(identity,identity)) = X0,
inference(superposition,[],[f1,f7]) ).
fof(f15,plain,
identity = double_divide(identity,identity),
inference(superposition,[],[f1,f7]) ).
fof(f20,plain,
! [X0,X1] : double_divide(identity,double_divide(double_divide(X0,double_divide(X1,X0)),identity)) = X1,
inference(forward_demodulation,[],[f9,f15]) ).
fof(f25,plain,
! [X0,X1] : double_divide(identity,double_divide(X0,identity)) = double_divide(X1,double_divide(X0,X1)),
inference(superposition,[],[f20,f20]) ).
fof(f33,plain,
! [X0] : double_divide(double_divide(identity,double_divide(identity,double_divide(X0,identity))),identity) = X0,
inference(forward_demodulation,[],[f13,f15]) ).
fof(f36,plain,
! [X0,X1] : double_divide(X1,double_divide(X0,X1)) = double_divide(double_divide(identity,X0),identity),
inference(superposition,[],[f33,f20]) ).
fof(f40,plain,
! [X0] : identity = double_divide(double_divide(identity,double_divide(identity,double_divide(X0,identity))),X0),
inference(superposition,[],[f7,f33]) ).
fof(f41,plain,
! [X0] : double_divide(identity,double_divide(identity,double_divide(X0,identity))) = double_divide(identity,double_divide(double_divide(identity,X0),identity)),
inference(superposition,[],[f20,f33]) ).
fof(f242,plain,
! [X0,X1] : double_divide(identity,double_divide(identity,double_divide(X0,identity))) = double_divide(double_divide(identity,double_divide(double_divide(double_divide(X0,identity),identity),double_divide(X1,identity))),double_divide(double_divide(X1,identity),identity)),
inference(superposition,[],[f12,f15]) ).
fof(f301,plain,
! [X0] : double_divide(X0,identity) = double_divide(identity,double_divide(identity,double_divide(X0,identity))),
inference(forward_demodulation,[],[f242,f11]) ).
fof(f409,plain,
! [X0] : double_divide(X0,identity) = double_divide(identity,double_divide(double_divide(identity,double_divide(identity,double_divide(X0,identity))),identity)),
inference(superposition,[],[f25,f40]) ).
fof(f453,plain,
! [X0] : double_divide(X0,identity) = double_divide(identity,X0),
inference(forward_demodulation,[],[f409,f33]) ).
fof(f792,plain,
a2 != double_divide(double_divide(identity,a2),identity),
inference(superposition,[],[f8,f453]) ).
fof(f994,plain,
! [X0] : a2 != double_divide(X0,double_divide(a2,X0)),
inference(superposition,[],[f792,f36]) ).
fof(f1097,plain,
! [X0] : double_divide(identity,double_divide(identity,double_divide(X0,identity))) = double_divide(identity,double_divide(identity,double_divide(identity,X0))),
inference(forward_demodulation,[],[f41,f453]) ).
fof(f1098,plain,
! [X0] : double_divide(X0,identity) = double_divide(identity,double_divide(identity,double_divide(identity,X0))),
inference(forward_demodulation,[],[f1097,f301]) ).
fof(f1967,plain,
! [X0] : a2 != double_divide(double_divide(X0,a2),double_divide(identity,double_divide(X0,identity))),
inference(superposition,[],[f994,f25]) ).
fof(f1975,plain,
a2 != double_divide(identity,double_divide(identity,double_divide(double_divide(identity,double_divide(identity,double_divide(a2,identity))),identity))),
inference(superposition,[],[f1967,f40]) ).
fof(f1997,plain,
a2 != double_divide(identity,double_divide(identity,double_divide(identity,double_divide(identity,double_divide(identity,double_divide(a2,identity)))))),
inference(forward_demodulation,[],[f1975,f453]) ).
fof(f2001,plain,
a2 != double_divide(identity,double_divide(double_divide(identity,double_divide(a2,identity)),identity)),
inference(forward_demodulation,[],[f1997,f1098]) ).
fof(f2002,plain,
$false,
inference(forward_subsumption_resolution,[],[f2001,f20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP497-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.36 % Computer : n007.cluster.edu
% 0.12/0.36 % Model : x86_64 x86_64
% 0.12/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.36 % Memory : 8046.5625MB
% 0.12/0.36 % OS : Linux 6.8.0-71-generic
% 0.12/0.36 % CPULimit : 300
% 0.12/0.36 % WCLimit : 300
% 0.12/0.36 % DateTime : Sun Sep 27 10:03:57 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.14/0.40 Running first-order model finding
% 0.14/0.40 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.14/0.45 % (1175624)Will run a generic schedule for satisfiability detection.
% 0.14/0.45 % (1175632)% WARNING: option uhcvi not known.
% 0.14/0.45 % (1175632)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3015562140:i=135531:add=off:rawr=on_3000 on theBenchmark for (3000ds/135531Mi)
% 0.14/0.45 % (1175631)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3774010350_3000 on theBenchmark for (3000ds/0Mi)
% 0.14/0.45 % (1175635)dis+10_1_sil=32000:sp=arity:random_seed=519294998:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 0.14/0.45 % (1175633)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2071067598:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 0.14/0.45 % (1175636)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2447738535:i=116_3000 on theBenchmark for (3000ds/116Mi)
% 0.14/0.45 % (1175637)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1183812193:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 0.14/0.45 % (1175638)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2594800199:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_3000 on theBenchmark for (3000ds/159Mi)
% 0.14/0.45 % TRYING [1]
% 0.14/0.45 % TRYING [2]
% 0.14/0.45 % TRYING [3]
% 0.14/0.45 % TRYING [4]
% 0.14/0.45 % TRYING [5]
% 0.14/0.45 % (1175632) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1175624-1175632"...
% 0.14/0.45 % (1175632)...printing done.
% 0.14/0.45 % (1175632)Refutation found. Thanks to Tanya!
% 0.14/0.45 % SZS status Unsatisfiable for theBenchmark
% 0.14/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.45 % (1175632)------------------------------
% 0.14/0.45 % (1175632)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.14/0.45 % (1175632)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.14/0.45 % (1175632)CaDiCaL version: 2.1.3
% 0.14/0.45 % (1175632)Termination reason: Refutation
% 0.14/0.45 % (1175632)Time elapsed: 0.027 s
% 0.14/0.45 % (1175632)Peak memory usage: 12 MB
% 0.14/0.45 % (1175632)Instructions burned: 90 (million)
% 0.14/0.45 % (1175624)Success in time 0.041 s
% 0.14/0.45 % Vampire exiting
%------------------------------------------------------------------------------