%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GRP598-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 : n001.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:11 AM UTC 2026
% Result : Unsatisfiable 0.16s 0.46s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of formulae : 21 ( 21 unt; 0 def)
% Number of atoms : 21 ( 20 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 6 ( 6 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 11 ( 3 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 : 36 ( 36 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : double_divide(double_divide(X0,X1),inverse(double_divide(X0,inverse(double_divide(inverse(X2),X1))))) = X2,
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(multiply(inverse(b2),b2),a2) != a2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_2) ).
fof(f4,plain,
a2 != multiply(multiply(inverse(b2),b2),a2),
inference(reorient_equations,[],[f3]) ).
fof(f5,plain,
a2 != inverse(double_divide(a2,inverse(double_divide(b2,inverse(b2))))),
inference(definition_unfolding,[],[f4,f2,f2]) ).
fof(f6,plain,
! [X2,X3,X0,X1] : double_divide(X0,inverse(double_divide(double_divide(X1,X2),inverse(double_divide(inverse(X3),inverse(double_divide(X1,inverse(double_divide(inverse(X0),X2))))))))) = X3,
inference(superposition,[],[f1,f1]) ).
fof(f7,plain,
! [X2,X0,X1] : double_divide(double_divide(double_divide(inverse(X1),X2),inverse(double_divide(inverse(X0),X2))),inverse(X0)) = X1,
inference(superposition,[],[f1,f1]) ).
fof(f20,plain,
! [X2,X3,X0,X1] : double_divide(X0,inverse(double_divide(double_divide(double_divide(X1,X2),inverse(double_divide(X1,inverse(double_divide(inverse(inverse(X3)),X2))))),inverse(X0)))) = X3,
inference(superposition,[],[f6,f6]) ).
fof(f28,plain,
! [X3,X0] : double_divide(X0,inverse(double_divide(inverse(X3),inverse(X0)))) = X3,
inference(forward_demodulation,[],[f20,f1]) ).
fof(f32,plain,
! [X0,X1] : double_divide(double_divide(X1,inverse(X1)),inverse(X0)) = X0,
inference(superposition,[],[f1,f28]) ).
fof(f45,plain,
! [X0,X1] : double_divide(inverse(X0),inverse(double_divide(X1,inverse(X1)))) = X0,
inference(superposition,[],[f32,f28]) ).
fof(f69,plain,
! [X2,X0,X1] : double_divide(double_divide(X0,inverse(double_divide(inverse(X2),inverse(double_divide(X1,inverse(X1)))))),inverse(X2)) = X0,
inference(superposition,[],[f7,f45]) ).
fof(f72,plain,
! [X2,X0,X1] : double_divide(X0,inverse(double_divide(inverse(X0),inverse(double_divide(inverse(X2),inverse(double_divide(X1,inverse(X1)))))))) = X2,
inference(superposition,[],[f1,f45]) ).
fof(f75,plain,
! [X2,X0] : double_divide(X0,inverse(double_divide(inverse(X0),inverse(X2)))) = X2,
inference(forward_demodulation,[],[f72,f45]) ).
fof(f77,plain,
! [X2,X0] : double_divide(double_divide(X0,inverse(X2)),inverse(X2)) = X0,
inference(forward_demodulation,[],[f69,f45]) ).
fof(f81,plain,
! [X0,X1] : double_divide(X1,inverse(X1)) = double_divide(X0,inverse(X0)),
inference(superposition,[],[f77,f32]) ).
fof(f108,plain,
! [X0] : a2 != inverse(double_divide(a2,inverse(double_divide(X0,inverse(X0))))),
inference(superposition,[],[f5,f81]) ).
fof(f159,plain,
! [X0] : inverse(inverse(X0)) = X0,
inference(superposition,[],[f75,f45]) ).
fof(f170,plain,
a2 != inverse(inverse(a2)),
inference(superposition,[],[f108,f75]) ).
fof(f181,plain,
a2 != a2,
inference(superposition,[],[f170,f159]) ).
fof(f201,plain,
$false,
inference(trivial_inequality_removal,[],[f181]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP598-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.09/0.36 % Computer : n001.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sun Sep 27 10:13:45 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.40 Running first-order model finding
% 0.09/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.16/0.46 % (3334180)Will run a generic schedule for satisfiability detection.
% 0.16/0.46 % (3334191)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4269301826_2999 on theBenchmark for (2999ds/0Mi)
% 0.16/0.46 % TRYING [1]
% 0.16/0.46 % TRYING [2]
% 0.16/0.46 % TRYING [3]
% 0.16/0.46 % (3334193)% WARNING: option uhcvi not known.
% 0.16/0.46 % (3334193)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3243288323:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.16/0.46 % (3334196)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2158191511:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.16/0.46 % (3334195)dis+10_1_sil=32000:sp=arity:random_seed=76576697:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/0.46 % (3334194)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3783668390:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.16/0.46 % (3334198)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=60406141:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.16/0.46 % (3334197)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1503906806:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.16/0.46 % TRYING [4]
% 0.16/0.46 % (3334194) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3334180-3334194"...
% 0.16/0.46 % (3334194)...printing done.
% 0.16/0.46 % (3334194)Refutation found. Thanks to Tanya!
% 0.16/0.46 % SZS status Unsatisfiable for theBenchmark
% 0.16/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.46 % (3334194)------------------------------
% 0.16/0.46 % (3334194)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.46 % (3334194)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.46 % (3334194)CaDiCaL version: 2.1.3
% 0.16/0.46 % (3334194)Termination reason: Refutation
% 0.16/0.46 % (3334194)Time elapsed: 0.010 s
% 0.16/0.46 % (3334194)Peak memory usage: 11 MB
% 0.16/0.46 % (3334194)Instructions burned: 14 (million)
% 0.16/0.46 % (3334180)Success in time 0.058 s
% 0.16/0.46 % Vampire exiting
%------------------------------------------------------------------------------