%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GRP169-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n008.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:01 AM UTC 2026
% Result : Unsatisfiable 0.13s 0.47s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 26 ( 26 unt; 0 def)
% Number of atoms : 26 ( 25 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 4 ( 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 : 30 ( 30 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : multiply(identity,X0) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_identity) ).
fof(f2,axiom,
! [X0] : multiply(inverse(X0),X0) = identity,
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/GRP004-0.ax',associativity) ).
fof(f6,axiom,
! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',symmetry_of_lub) ).
fof(f13,axiom,
! [X2,X0,X1] : multiply(X0,least_upper_bound(X1,X2)) = least_upper_bound(multiply(X0,X1),multiply(X0,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',monotony_lub1) ).
fof(f15,axiom,
! [X2,X0,X1] : multiply(least_upper_bound(X0,X1),X2) = least_upper_bound(multiply(X0,X2),multiply(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',monotony_lub2) ).
fof(f17,axiom,
least_upper_bound(inverse(a),inverse(b)) = inverse(b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p02a_1) ).
fof(f18,plain,
inverse(b) = least_upper_bound(inverse(a),inverse(b)),
inference(reorient_equations,[],[f17]) ).
fof(f19,negated_conjecture,
least_upper_bound(a,b) != a,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p02a) ).
fof(f20,plain,
a != least_upper_bound(a,b),
inference(reorient_equations,[],[f19]) ).
fof(f37,plain,
! [X0,X1] : multiply(inverse(X0),multiply(X0,X1)) = multiply(identity,X1),
inference(superposition,[],[f4,f3]) ).
fof(f40,plain,
! [X0,X1] : multiply(inverse(X0),multiply(X0,X1)) = X1,
inference(forward_demodulation,[],[f37,f1]) ).
fof(f103,plain,
! [X0] : multiply(inverse(inverse(X0)),identity) = X0,
inference(superposition,[],[f40,f3]) ).
fof(f105,plain,
! [X0,X1] : multiply(X1,X0) = multiply(inverse(inverse(X1)),X0),
inference(superposition,[],[f40,f40]) ).
fof(f108,plain,
! [X0] : multiply(X0,identity) = X0,
inference(forward_demodulation,[],[f103,f105]) ).
fof(f110,plain,
! [X0,X1] : multiply(inverse(X0),least_upper_bound(X0,X1)) = least_upper_bound(identity,multiply(inverse(X0),X1)),
inference(superposition,[],[f13,f3]) ).
fof(f186,plain,
! [X0,X1] : multiply(least_upper_bound(X0,inverse(X1)),X1) = least_upper_bound(multiply(X0,X1),identity),
inference(superposition,[],[f15,f3]) ).
fof(f207,plain,
! [X0,X1] : multiply(least_upper_bound(X0,inverse(X1)),X1) = least_upper_bound(identity,multiply(X0,X1)),
inference(forward_demodulation,[],[f186,f6]) ).
fof(f974,plain,
! [X0,X1] : multiply(X0,multiply(inverse(X0),X1)) = X1,
inference(superposition,[],[f40,f105]) ).
fof(f1587,plain,
least_upper_bound(identity,multiply(inverse(a),b)) = multiply(inverse(b),b),
inference(superposition,[],[f207,f18]) ).
fof(f1616,plain,
identity = least_upper_bound(identity,multiply(inverse(a),b)),
inference(forward_demodulation,[],[f1587,f3]) ).
fof(f1624,plain,
identity = multiply(inverse(a),least_upper_bound(a,b)),
inference(forward_demodulation,[],[f1616,f110]) ).
fof(f1628,plain,
least_upper_bound(a,b) = multiply(a,identity),
inference(superposition,[],[f974,f1624]) ).
fof(f1655,plain,
a = least_upper_bound(a,b),
inference(forward_demodulation,[],[f1628,f108]) ).
fof(f1663,plain,
$false,
inference(forward_subsumption_resolution,[],[f1655,f20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP169-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.38 % Computer : n008.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Sun Sep 27 09:35:39 UTC 2026
% 0.13/0.38 % CPUTime :
% 0.13/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.41 Running first-order model finding
% 0.13/0.41 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.13/0.47 % (974847)Will run a generic schedule for satisfiability detection.
% 0.13/0.47 % (974860)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3120404737:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.13/0.47 % (974857)% WARNING: option uhcvi not known.
% 0.13/0.47 % (974857)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2879134613:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.13/0.47 % (974858)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4018542535:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.13/0.47 % (974859)dis+10_1_sil=32000:sp=arity:random_seed=461853644:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.13/0.47 % (974856)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1253697838_2999 on theBenchmark for (2999ds/0Mi)
% 0.13/0.47 % TRYING [1]
% 0.13/0.47 % TRYING [2]
% 0.13/0.47 % TRYING [3]
% 0.13/0.47 % (974862)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2489006877:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.13/0.47 % TRYING [4]
% 0.13/0.47 % (974861)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1884140492:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.13/0.47 % (974860) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-974847-974860"...
% 0.13/0.47 % (974860)...printing done.
% 0.13/0.47 % (974860)Refutation found. Thanks to Tanya!
% 0.13/0.47 % SZS status Unsatisfiable for theBenchmark
% 0.13/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.47 % (974860)------------------------------
% 0.13/0.47 % (974860)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.13/0.47 % (974860)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.13/0.47 % (974860)CaDiCaL version: 2.1.3
% 0.13/0.47 % (974860)Termination reason: Refutation
% 0.13/0.47 % (974860)Time elapsed: 0.021 s
% 0.13/0.47 % (974860)Peak memory usage: 12 MB
% 0.13/0.47 % (974860)Instructions burned: 62 (million)
% 0.13/0.47 % (974847)Success in time 0.05 s
% 0.13/0.47 % Vampire exiting
%------------------------------------------------------------------------------