%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GRP174-1 : 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.17s 0.48s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of formulae : 29 ( 29 unt; 0 def)
% Number of atoms : 29 ( 28 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 1 ( 1 ~; 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; 2 con; 0-2 aty)
% Number of variables : 30 ( 30 !; 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(f6,axiom,
! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',symmetry_of_lub) ).
fof(f11,axiom,
! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X0,X1)) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',lub_absorbtion) ).
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/sandbox/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/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_lub2) ).
fof(f17,axiom,
greatest_lower_bound(identity,a) = a,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p05b_1) ).
fof(f18,plain,
a = greatest_lower_bound(identity,a),
inference(reorient_equations,[],[f17]) ).
fof(f19,axiom,
greatest_lower_bound(identity,inverse(a)) = inverse(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p05b_2) ).
fof(f20,plain,
inverse(a) = greatest_lower_bound(identity,inverse(a)),
inference(reorient_equations,[],[f19]) ).
fof(f21,negated_conjecture,
identity != a,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p05b) ).
fof(f22,plain,
identity = least_upper_bound(identity,a),
inference(superposition,[],[f11,f18]) ).
fof(f23,plain,
identity = least_upper_bound(identity,inverse(a)),
inference(superposition,[],[f11,f20]) ).
fof(f35,plain,
! [X0,X1] : multiply(inverse(X0),multiply(X0,X1)) = multiply(identity,X1),
inference(superposition,[],[f4,f3]) ).
fof(f38,plain,
! [X0,X1] : multiply(inverse(X0),multiply(X0,X1)) = X1,
inference(forward_demodulation,[],[f35,f1]) ).
fof(f109,plain,
! [X0] : multiply(inverse(inverse(X0)),identity) = X0,
inference(superposition,[],[f38,f3]) ).
fof(f111,plain,
! [X0,X1] : multiply(X1,X0) = multiply(inverse(inverse(X1)),X0),
inference(superposition,[],[f38,f38]) ).
fof(f114,plain,
! [X0] : multiply(X0,identity) = X0,
inference(forward_demodulation,[],[f109,f111]) ).
fof(f147,plain,
! [X0,X1] : multiply(X0,least_upper_bound(identity,X1)) = least_upper_bound(X0,multiply(X0,X1)),
inference(superposition,[],[f13,f114]) ).
fof(f192,plain,
! [X0,X1] : multiply(least_upper_bound(X0,inverse(X1)),X1) = least_upper_bound(multiply(X0,X1),identity),
inference(superposition,[],[f15,f3]) ).
fof(f213,plain,
! [X0,X1] : multiply(least_upper_bound(X0,inverse(X1)),X1) = least_upper_bound(identity,multiply(X0,X1)),
inference(forward_demodulation,[],[f192,f6]) ).
fof(f1781,plain,
multiply(identity,a) = least_upper_bound(identity,multiply(identity,a)),
inference(superposition,[],[f213,f23]) ).
fof(f1810,plain,
multiply(identity,a) = multiply(identity,least_upper_bound(identity,a)),
inference(forward_demodulation,[],[f1781,f147]) ).
fof(f1818,plain,
least_upper_bound(identity,a) = multiply(identity,a),
inference(forward_demodulation,[],[f1810,f1]) ).
fof(f1822,plain,
a = least_upper_bound(identity,a),
inference(forward_demodulation,[],[f1818,f1]) ).
fof(f1823,plain,
identity = a,
inference(forward_demodulation,[],[f1822,f22]) ).
fof(f1824,plain,
$false,
inference(forward_subsumption_resolution,[],[f1823,f21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP174-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.38 % Computer : n018.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:37:38 UTC 2026
% 0.13/0.38 % CPUTime :
% 0.13/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.42 Running first-order model finding
% 0.13/0.42 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.17/0.48 % (2079693)Will run a generic schedule for satisfiability detection.
% 0.17/0.48 % (2079702)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3408623449:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.48 % (2079699)% WARNING: option uhcvi not known.
% 0.17/0.48 % (2079698)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2393642965_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.48 % (2079699)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2984359971:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.48 % (2079700)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1959084746:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.48 % (2079703)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1307227814:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.48 % (2079701)dis+10_1_sil=32000:sp=arity:random_seed=1638567531:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.48 % (2079704)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1656796954:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.48 % TRYING [1]
% 0.17/0.48 % TRYING [2]
% 0.17/0.48 % TRYING [3]
% 0.17/0.48 % TRYING [4]
% 0.17/0.48 % (2079702) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2079693-2079702"...
% 0.17/0.48 % (2079702)...printing done.
% 0.17/0.48 % (2079702)Refutation found. Thanks to Tanya!
% 0.17/0.48 % SZS status Unsatisfiable for theBenchmark
% 0.17/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.48 % (2079702)------------------------------
% 0.17/0.48 % (2079702)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.48 % (2079702)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.48 % (2079702)CaDiCaL version: 2.1.3
% 0.17/0.48 % (2079702)Termination reason: Refutation
% 0.17/0.48 % (2079702)Time elapsed: 0.022 s
% 0.17/0.48 % (2079702)Peak memory usage: 12 MB
% 0.17/0.48 % (2079702)Instructions burned: 66 (million)
% 0.17/0.48 % (2079693)Success in time 0.058 s
% 0.17/0.48 % Vampire exiting
%------------------------------------------------------------------------------