%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GRP601-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 : n019.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:12 AM UTC 2026
% Result : Unsatisfiable 0.18s 0.55s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 3
% Syntax : Number of formulae : 27 ( 27 unt; 0 def)
% Number of atoms : 27 ( 26 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 8 ( 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 : 58 ( 58 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : inverse(double_divide(inverse(double_divide(X0,inverse(double_divide(X1,double_divide(X0,X2))))),X2)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
fof(f2,axiom,
! [X0,X1] : multiply(X0,X1) = inverse(double_divide(X1,X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
fof(f3,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_1) ).
fof(f4,plain,
inverse(double_divide(a1,inverse(a1))) != inverse(double_divide(b1,inverse(b1))),
inference(definition_unfolding,[],[f3,f2,f2]) ).
fof(f5,plain,
! [X2,X3,X0,X1] : inverse(double_divide(X2,inverse(double_divide(X0,double_divide(X2,double_divide(X1,X3)))))) = inverse(double_divide(inverse(double_divide(X1,X0)),X3)),
inference(superposition,[],[f1,f1]) ).
fof(f7,plain,
! [X2,X0,X1] : inverse(double_divide(inverse(double_divide(inverse(double_divide(X0,X1)),X2)),double_divide(X0,X2))) = X1,
inference(superposition,[],[f1,f5]) ).
fof(f12,plain,
! [X2,X0,X1] : inverse(double_divide(X0,double_divide(inverse(double_divide(X1,X0)),double_divide(X1,X2)))) = X2,
inference(superposition,[],[f7,f7]) ).
fof(f20,plain,
! [X2,X3,X0,X1] : double_divide(inverse(double_divide(X2,X1)),double_divide(X2,X0)) = inverse(double_divide(inverse(double_divide(X0,X3)),double_divide(X1,X3))),
inference(superposition,[],[f7,f12]) ).
fof(f84,plain,
! [X2,X0,X1] : double_divide(inverse(double_divide(X1,X2)),double_divide(X1,inverse(double_divide(X2,X0)))) = X0,
inference(superposition,[],[f20,f7]) ).
fof(f88,plain,
! [X2,X0,X1] : inverse(double_divide(X2,inverse(double_divide(inverse(double_divide(X0,X1)),double_divide(X2,X1))))) = X0,
inference(superposition,[],[f12,f20]) ).
fof(f185,plain,
! [X2,X0,X1] : inverse(double_divide(X2,inverse(inverse(double_divide(inverse(double_divide(X0,X1)),double_divide(X0,X1)))))) = X2,
inference(superposition,[],[f88,f20]) ).
fof(f260,plain,
! [X2,X0,X1] : inverse(double_divide(X2,inverse(double_divide(inverse(double_divide(X0,X1)),double_divide(X0,X1))))) = X2,
inference(superposition,[],[f185,f20]) ).
fof(f361,plain,
! [X2,X0,X1] : inverse(double_divide(X2,double_divide(inverse(double_divide(X0,X1)),double_divide(X0,X1)))) = X2,
inference(superposition,[],[f260,f20]) ).
fof(f496,plain,
! [X0,X1] : inverse(double_divide(X1,double_divide(inverse(X0),X0))) = X1,
inference(superposition,[],[f361,f84]) ).
fof(f560,plain,
! [X0,X1] : inverse(double_divide(inverse(double_divide(inverse(X1),X0)),X1)) = X0,
inference(superposition,[],[f496,f7]) ).
fof(f625,plain,
! [X0,X1] : inverse(double_divide(X0,double_divide(inverse(X1),X0))) = X1,
inference(superposition,[],[f560,f560]) ).
fof(f705,plain,
! [X0] : inverse(inverse(X0)) = X0,
inference(superposition,[],[f625,f84]) ).
fof(f707,plain,
! [X0,X1] : double_divide(X1,double_divide(X1,X0)) = X0,
inference(superposition,[],[f625,f12]) ).
fof(f753,plain,
! [X0,X1] : inverse(X0) = double_divide(X0,double_divide(inverse(X1),X1)),
inference(superposition,[],[f705,f496]) ).
fof(f892,plain,
! [X0,X1] : double_divide(inverse(X1),X1) = double_divide(X0,inverse(X0)),
inference(superposition,[],[f707,f753]) ).
fof(f898,plain,
! [X0,X1] : inverse(inverse(double_divide(inverse(inverse(double_divide(X0,X1))),X0))) = X1,
inference(superposition,[],[f84,f753]) ).
fof(f929,plain,
! [X0,X1] : double_divide(inverse(inverse(double_divide(X0,X1))),X0) = X1,
inference(forward_demodulation,[],[f898,f705]) ).
fof(f971,plain,
! [X0,X1] : double_divide(double_divide(X0,X1),X0) = X1,
inference(forward_demodulation,[],[f929,f705]) ).
fof(f988,plain,
! [X0,X1] : double_divide(X1,X0) = double_divide(X0,X1),
inference(superposition,[],[f971,f707]) ).
fof(f1675,plain,
! [X0,X1] : double_divide(X0,inverse(X0)) = double_divide(X1,inverse(X1)),
inference(forward_demodulation,[],[f892,f988]) ).
fof(f1987,plain,
! [X0] : inverse(double_divide(a1,inverse(a1))) != inverse(double_divide(X0,inverse(X0))),
inference(superposition,[],[f4,f1675]) ).
fof(f2258,plain,
$false,
inference(equality_resolution,[],[f1987]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP601-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.39 % Computer : n019.cluster.edu
% 0.13/0.39 % Model : x86_64 x86_64
% 0.13/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39 % Memory : 8046.5625MB
% 0.13/0.39 % OS : Linux 6.8.0-71-generic
% 0.13/0.39 % CPULimit : 300
% 0.13/0.39 % WCLimit : 300
% 0.13/0.39 % DateTime : Sun Sep 27 10:08:04 UTC 2026
% 0.13/0.40 % CPUTime :
% 0.13/0.40 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.43 Running first-order model finding
% 0.13/0.43 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.18/0.55 % (2864835)Will run a generic schedule for satisfiability detection.
% 0.18/0.55 % (2864844)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2155571405:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.55 % (2864841)% WARNING: option uhcvi not known.
% 0.18/0.55 % (2864843)dis+10_1_sil=32000:sp=arity:random_seed=2240267898:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.55 % (2864840)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2588113988_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.55 % (2864841)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1184454162:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.55 % (2864845)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1328920183:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.55 % (2864842)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2841443862:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.55 % TRYING [1]
% 0.18/0.55 % TRYING [2]
% 0.18/0.55 % TRYING [3]
% 0.18/0.55 % TRYING [4]
% 0.18/0.55 % (2864846)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4167538191:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.55 % (2864844)Instruction limit reached!
% 0.18/0.55 % (2864844)------------------------------
% 0.18/0.55 % (2864844)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.55 % (2864844)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.55 % (2864844)CaDiCaL version: 2.1.3
% 0.18/0.55 % (2864844)Termination reason: Instruction limit
% 0.18/0.55 % (2864844)Termination phase: Saturation
% 0.18/0.55 % (2864844)Time elapsed: 0.040 s
% 0.18/0.55 % (2864844)Peak memory usage: 13 MB
% 0.18/0.55 % (2864844)Instructions burned: 117 (million)
% 0.18/0.55 % (2864854)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3230883303:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.18/0.55 % TRYING [1]
% 0.18/0.55 % TRYING [2]
% 0.18/0.55 % TRYING [3]
% 0.18/0.55 % (2864843)Instruction limit reached!
% 0.18/0.55 % (2864843)------------------------------
% 0.18/0.55 % (2864843)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.55 % (2864843)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.55 % (2864843)CaDiCaL version: 2.1.3
% 0.18/0.55 % (2864843)Termination reason: Instruction limit
% 0.18/0.55 % (2864843)Termination phase: Saturation
% 0.18/0.55 % (2864843)Time elapsed: 0.058 s
% 0.18/0.55 % (2864843)Peak memory usage: 12 MB
% 0.18/0.55 % (2864843)Instructions burned: 103 (million)
% 0.18/0.55 % (2864842) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2864835-2864842"...
% 0.18/0.55 % (2864842)...printing done.
% 0.18/0.55 % (2864842)Refutation found. Thanks to Tanya!
% 0.18/0.55 % SZS status Unsatisfiable for theBenchmark
% 0.18/0.55 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.55 % (2864842)------------------------------
% 0.18/0.55 % (2864842)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.55 % (2864842)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.55 % (2864842)CaDiCaL version: 2.1.3
% 0.18/0.55 % (2864842)Termination reason: Refutation
% 0.18/0.55 % (2864842)Time elapsed: 0.068 s
% 0.18/0.55 % (2864842)Peak memory usage: 13 MB
% 0.18/0.55 % (2864842)Instructions burned: 125 (million)
% 0.18/0.55 % (2864835)Success in time 0.106 s
% 0.18/0.55 % Vampire exiting
%------------------------------------------------------------------------------