%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GRP175-2 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n018.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:03 AM UTC 2026
% Result : Unsatisfiable 0.14s 0.43s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 8
% Syntax : Number of formulae : 33 ( 33 unt; 0 def)
% Number of atoms : 33 ( 32 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 12 ( 12 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 42 ( 42 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : multiply(identity,X0) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_identity) ).
fof(f2,axiom,
! [X0] : multiply(inverse(X0),X0) = identity,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
fof(f3,plain,
! [X0] : identity = multiply(inverse(X0),X0),
inference(reorient_equations,[],[f2]) ).
fof(f4,axiom,
! [X2,X0,X1] : multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',associativity) ).
fof(f5,axiom,
! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',symmetry_of_glb) ).
fof(f14,axiom,
! [X2,X0,X1] : multiply(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(multiply(X0,X1),multiply(X0,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_glb1) ).
fof(f16,axiom,
! [X2,X0,X1] : multiply(greatest_lower_bound(X0,X1),X2) = greatest_lower_bound(multiply(X0,X2),multiply(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_glb2) ).
fof(f17,axiom,
greatest_lower_bound(identity,b) = identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p06b_1) ).
fof(f18,plain,
identity = greatest_lower_bound(identity,b),
inference(reorient_equations,[],[f17]) ).
fof(f19,negated_conjecture,
greatest_lower_bound(identity,multiply(inverse(a),multiply(b,a))) != identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p06b) ).
fof(f20,plain,
identity != greatest_lower_bound(identity,multiply(inverse(a),multiply(b,a))),
inference(reorient_equations,[],[f19]) ).
fof(f21,plain,
! [X0,X1] : multiply(inverse(X0),X0) = multiply(inverse(X1),X1),
inference(superposition,[],[f3,f3]) ).
fof(f22,plain,
! [X0,X1] : multiply(multiply(inverse(X0),X0),X1) = X1,
inference(superposition,[],[f1,f3]) ).
fof(f24,plain,
! [X0] : multiply(inverse(X0),X0) != greatest_lower_bound(multiply(inverse(X0),X0),multiply(inverse(a),multiply(b,a))),
inference(superposition,[],[f20,f3]) ).
fof(f25,plain,
! [X0,X1] : multiply(inverse(X0),multiply(X0,X1)) = X1,
inference(forward_demodulation,[],[f22,f4]) ).
fof(f28,plain,
! [X0] : multiply(inverse(X0),X0) != greatest_lower_bound(multiply(inverse(a),multiply(b,a)),multiply(inverse(X0),X0)),
inference(superposition,[],[f24,f5]) ).
fof(f114,plain,
! [X0] : multiply(inverse(inverse(X0)),identity) = X0,
inference(superposition,[],[f25,f3]) ).
fof(f116,plain,
! [X0,X1] : multiply(X1,X0) = multiply(inverse(inverse(X1)),X0),
inference(superposition,[],[f25,f25]) ).
fof(f119,plain,
! [X0] : multiply(X0,identity) = X0,
inference(forward_demodulation,[],[f114,f116]) ).
fof(f148,plain,
! [X0,X1] : multiply(X1,multiply(inverse(X0),X0)) = X1,
inference(superposition,[],[f119,f3]) ).
fof(f158,plain,
identity = inverse(identity),
inference(superposition,[],[f3,f119]) ).
fof(f172,plain,
! [X2,X0,X1] : multiply(inverse(X1),greatest_lower_bound(X2,multiply(X1,X0))) = greatest_lower_bound(multiply(inverse(X1),X2),X0),
inference(superposition,[],[f14,f25]) ).
fof(f228,plain,
! [X0] : multiply(inverse(X0),X0) = inverse(multiply(inverse(X0),X0)),
inference(superposition,[],[f158,f3]) ).
fof(f243,plain,
! [X0,X1] : multiply(greatest_lower_bound(identity,X1),X0) = greatest_lower_bound(X0,multiply(X1,X0)),
inference(superposition,[],[f16,f1]) ).
fof(f738,plain,
! [X0] : inverse(multiply(inverse(X0),X0)) != greatest_lower_bound(multiply(inverse(a),multiply(b,a)),inverse(multiply(inverse(X0),X0))),
inference(superposition,[],[f28,f148]) ).
fof(f745,plain,
! [X0] : inverse(multiply(inverse(X0),X0)) != multiply(inverse(a),greatest_lower_bound(multiply(b,a),multiply(a,inverse(multiply(inverse(X0),X0))))),
inference(forward_demodulation,[],[f738,f172]) ).
fof(f762,plain,
! [X0] : multiply(inverse(X0),X0) != multiply(inverse(a),greatest_lower_bound(multiply(b,a),multiply(a,multiply(inverse(X0),X0)))),
inference(forward_demodulation,[],[f745,f228]) ).
fof(f764,plain,
! [X0] : multiply(inverse(X0),X0) != multiply(inverse(a),greatest_lower_bound(multiply(b,a),a)),
inference(forward_demodulation,[],[f762,f148]) ).
fof(f765,plain,
! [X0] : multiply(inverse(X0),X0) != multiply(inverse(a),greatest_lower_bound(a,multiply(b,a))),
inference(forward_demodulation,[],[f764,f5]) ).
fof(f766,plain,
! [X0] : multiply(inverse(X0),X0) != multiply(inverse(a),multiply(greatest_lower_bound(identity,b),a)),
inference(forward_demodulation,[],[f765,f243]) ).
fof(f767,plain,
! [X0] : multiply(inverse(X0),X0) != multiply(inverse(a),multiply(identity,a)),
inference(forward_demodulation,[],[f766,f18]) ).
fof(f768,plain,
! [X0] : multiply(inverse(X0),X0) != multiply(inverse(a),a),
inference(forward_demodulation,[],[f767,f1]) ).
fof(f769,plain,
$false,
inference(forward_subsumption_resolution,[],[f768,f21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP175-2 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.35 % Computer : n018.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Sun Sep 27 09:37:53 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.10/0.35 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.14/0.38 Running first-order model finding
% 0.14/0.39 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.14/0.43 % (2080103)Will run a generic schedule for satisfiability detection.
% 0.14/0.43 % (2080113)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2533509038:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.14/0.43 % (2080109)% WARNING: option uhcvi not known.
% 0.14/0.43 % (2080108)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3673365922_2999 on theBenchmark for (2999ds/0Mi)
% 0.14/0.43 % (2080109)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4208388152:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.14/0.43 % (2080110)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=738771641:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.14/0.43 % (2080114)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2495667999:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.14/0.43 % (2080111)dis+10_1_sil=32000:sp=arity:random_seed=3763727442:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.14/0.43 % (2080112)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3314220371:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.14/0.43 % TRYING [1]
% 0.14/0.43 % TRYING [2]
% 0.14/0.43 % (2080113) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2080103-2080113"...
% 0.14/0.43 % TRYING [3]
% 0.14/0.43 % (2080113)...printing done.
% 0.14/0.43 % (2080113)Refutation found. Thanks to Tanya!
% 0.14/0.43 % SZS status Unsatisfiable for theBenchmark
% 0.14/0.43 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.43 % (2080113)------------------------------
% 0.14/0.43 % (2080113)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.14/0.43 % (2080113)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.14/0.43 % (2080113)CaDiCaL version: 2.1.3
% 0.14/0.43 % (2080113)Termination reason: Refutation
% 0.14/0.43 % (2080113)Time elapsed: 0.009 s
% 0.14/0.43 % (2080113)Peak memory usage: 12 MB
% 0.14/0.43 % (2080113)Instructions burned: 27 (million)
% 0.14/0.43 % (2080103)Success in time 0.035 s
% 0.14/0.43 % Vampire exiting
%------------------------------------------------------------------------------