%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GRP605-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 : n016.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.38s 0.50s
% Output : Refutation 0.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 3
% Syntax : Number of formulae : 35 ( 35 unt; 0 def)
% Number of atoms : 35 ( 34 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 : 9 ( 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 : 81 ( 81 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : double_divide(inverse(double_divide(X0,inverse(double_divide(inverse(X1),double_divide(X0,X2))))),X2) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
fof(f2,axiom,
! [X0,X1] : multiply(X0,X1) = inverse(double_divide(X1,X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
fof(f3,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox/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(f6,plain,
! [X2,X3,X0,X1] : double_divide(X2,inverse(double_divide(inverse(X0),double_divide(X2,double_divide(X1,X3))))) = double_divide(inverse(double_divide(X1,inverse(X0))),X3),
inference(superposition,[],[f1,f1]) ).
fof(f11,plain,
! [X2,X0,X1] : double_divide(inverse(double_divide(inverse(double_divide(X0,inverse(X1))),X2)),double_divide(X0,X2)) = X1,
inference(superposition,[],[f1,f6]) ).
fof(f18,plain,
! [X2,X0,X1] : double_divide(inverse(X0),double_divide(inverse(double_divide(X1,inverse(X0))),double_divide(X1,inverse(X2)))) = X2,
inference(superposition,[],[f11,f11]) ).
fof(f31,plain,
! [X2,X0,X1] : double_divide(inverse(double_divide(inverse(X0),double_divide(X1,double_divide(X1,inverse(X2))))),X0) = X2,
inference(superposition,[],[f18,f1]) ).
fof(f43,plain,
! [X2,X3,X0,X1] : double_divide(inverse(X0),double_divide(inverse(double_divide(X1,double_divide(X1,inverse(X2)))),double_divide(X3,double_divide(X3,inverse(X0))))) = X2,
inference(superposition,[],[f31,f31]) ).
fof(f44,plain,
! [X2,X3,X0,X1] : double_divide(inverse(double_divide(X1,inverse(X0))),X2) = double_divide(inverse(double_divide(X1,X2)),double_divide(X3,double_divide(X3,inverse(X0)))),
inference(superposition,[],[f1,f31]) ).
fof(f87,plain,
! [X2,X3,X0,X1] : double_divide(inverse(double_divide(inverse(double_divide(X0,double_divide(X0,inverse(X1)))),inverse(X1))),double_divide(X2,double_divide(X2,inverse(X3)))) = X3,
inference(superposition,[],[f31,f44]) ).
fof(f95,plain,
! [X3,X0,X1] : double_divide(inverse(double_divide(inverse(double_divide(X0,double_divide(X0,inverse(X1)))),inverse(X3))),inverse(X1)) = X3,
inference(forward_demodulation,[],[f87,f44]) ).
fof(f107,plain,
! [X2,X0,X1] : double_divide(inverse(X0),double_divide(inverse(double_divide(X1,double_divide(X1,inverse(X2)))),inverse(X2))) = X0,
inference(superposition,[],[f95,f1]) ).
fof(f143,plain,
! [X2,X3,X0,X1] : double_divide(inverse(double_divide(inverse(double_divide(inverse(X0),inverse(X1))),double_divide(inverse(double_divide(X2,double_divide(X2,inverse(X3)))),inverse(X3)))),X0) = X1,
inference(superposition,[],[f11,f107]) ).
fof(f148,plain,
! [X0,X1] : double_divide(inverse(double_divide(inverse(X0),inverse(X1))),X0) = X1,
inference(forward_demodulation,[],[f143,f107]) ).
fof(f265,plain,
! [X0,X1] : double_divide(inverse(X0),double_divide(inverse(X1),X1)) = X0,
inference(superposition,[],[f148,f1]) ).
fof(f299,plain,
! [X0,X1] : double_divide(inverse(double_divide(inverse(X1),X1)),inverse(X0)) = X0,
inference(superposition,[],[f265,f148]) ).
fof(f356,plain,
! [X2,X0,X1] : double_divide(inverse(X1),double_divide(inverse(double_divide(inverse(double_divide(inverse(X2),X2)),inverse(X1))),X0)) = X0,
inference(superposition,[],[f18,f299]) ).
fof(f367,plain,
! [X2,X0,X1] : double_divide(inverse(double_divide(inverse(double_divide(inverse(X1),X1)),inverse(double_divide(inverse(X2),X0)))),inverse(X0)) = X2,
inference(superposition,[],[f1,f299]) ).
fof(f368,plain,
! [X2,X0] : double_divide(inverse(double_divide(inverse(X2),X0)),inverse(X0)) = X2,
inference(forward_demodulation,[],[f367,f299]) ).
fof(f374,plain,
! [X0,X1] : double_divide(inverse(X1),double_divide(inverse(X1),X0)) = X0,
inference(forward_demodulation,[],[f356,f299]) ).
fof(f388,plain,
! [X0,X1] : double_divide(inverse(X1),X1) = double_divide(inverse(X0),X0),
inference(superposition,[],[f374,f265]) ).
fof(f393,plain,
! [X0,X1] : inverse(X1) = double_divide(X0,double_divide(X0,inverse(X1))),
inference(superposition,[],[f374,f107]) ).
fof(f581,plain,
! [X0] : inverse(inverse(X0)) = X0,
inference(superposition,[],[f368,f148]) ).
fof(f640,plain,
! [X0,X1] : double_divide(inverse(X1),double_divide(X0,inverse(X0))) = X1,
inference(superposition,[],[f265,f581]) ).
fof(f646,plain,
! [X0,X1] : double_divide(X0,double_divide(X0,X1)) = X1,
inference(superposition,[],[f374,f581]) ).
fof(f647,plain,
! [X0,X1] : double_divide(inverse(X1),X1) = double_divide(X0,inverse(X0)),
inference(superposition,[],[f388,f581]) ).
fof(f753,plain,
! [X2,X0,X1] : double_divide(inverse(inverse(X0)),double_divide(inverse(double_divide(X1,double_divide(X1,inverse(X2)))),X0)) = X2,
inference(superposition,[],[f43,f640]) ).
fof(f772,plain,
! [X2,X0] : double_divide(inverse(inverse(X0)),double_divide(inverse(inverse(X2)),X0)) = X2,
inference(forward_demodulation,[],[f753,f393]) ).
fof(f782,plain,
! [X2,X0] : double_divide(inverse(inverse(X0)),double_divide(X2,X0)) = X2,
inference(forward_demodulation,[],[f772,f581]) ).
fof(f783,plain,
! [X2,X0] : double_divide(X0,double_divide(X2,X0)) = X2,
inference(forward_demodulation,[],[f782,f581]) ).
fof(f820,plain,
! [X0,X1] : double_divide(X1,X0) = double_divide(X0,X1),
inference(superposition,[],[f646,f783]) ).
fof(f1400,plain,
! [X0,X1] : double_divide(X0,inverse(X0)) = double_divide(X1,inverse(X1)),
inference(forward_demodulation,[],[f647,f820]) ).
fof(f1578,plain,
! [X0] : inverse(double_divide(a1,inverse(a1))) != inverse(double_divide(X0,inverse(X0))),
inference(superposition,[],[f4,f1400]) ).
fof(f1709,plain,
$false,
inference(equality_resolution,[],[f1578]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP605-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 : n016.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:14:47 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.41 Running first-order model finding
% 0.11/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.38/0.50 % (2408306)Will run a generic schedule for satisfiability detection.
% 0.38/0.50 % (2408317)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3284269386:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.38/0.50 % (2408311)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4127800158_2999 on theBenchmark for (2999ds/0Mi)
% 0.38/0.50 % (2408313)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4219997616:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.38/0.50 % (2408314)dis+10_1_sil=32000:sp=arity:random_seed=2214917290:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.38/0.50 % (2408315)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3375153229:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.38/0.50 % (2408316)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1085274049:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.38/0.50 % TRYING [1]
% 0.38/0.50 % TRYING [2]
% 0.38/0.50 % TRYING [3]
% 0.38/0.50 % (2408312)% WARNING: option uhcvi not known.
% 0.38/0.50 % TRYING [4]
% 0.38/0.50 % (2408312)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1790168911:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.38/0.50 % (2408317)Instruction limit reached!
% 0.38/0.50 % (2408317)------------------------------
% 0.38/0.50 % (2408317)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.38/0.50 % (2408317)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.38/0.50 % (2408317)CaDiCaL version: 2.1.3
% 0.38/0.50 % (2408317)Termination reason: Instruction limit
% 0.38/0.50 % (2408317)Termination phase: Saturation
% 0.38/0.50 % (2408317)Time elapsed: 0.053 s
% 0.38/0.50 % (2408317)Peak memory usage: 12 MB
% 0.38/0.50 % (2408317)Instructions burned: 162 (million)
% 0.38/0.50 % (2408313) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2408306-2408313"...
% 0.38/0.50 % (2408313)...printing done.
% 0.38/0.50 % (2408313)Refutation found. Thanks to Tanya!
% 0.38/0.50 % SZS status Unsatisfiable for theBenchmark
% 0.38/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.38/0.50 % (2408313)------------------------------
% 0.38/0.50 % (2408313)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.38/0.50 % (2408313)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.38/0.50 % (2408313)CaDiCaL version: 2.1.3
% 0.38/0.50 % (2408313)Termination reason: Refutation
% 0.38/0.50 % (2408313)Time elapsed: 0.053 s
% 0.38/0.50 % (2408313)Peak memory usage: 12 MB
% 0.38/0.50 % (2408313)Instructions burned: 95 (million)
% 0.38/0.50 % (2408306)Success in time 0.087 s
% 0.38/0.50 % Vampire exiting
%------------------------------------------------------------------------------