%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GRP193-2 : 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 : n026.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:08 AM UTC 2026
% Result : Unsatisfiable 0.17s 0.47s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 25 ( 25 unt; 0 def)
% Number of atoms : 25 ( 24 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 : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 17 ( 17 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : multiply(identity,X0) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_identity) ).
fof(f5,axiom,
! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',symmetry_of_glb) ).
fof(f7,axiom,
! [X2,X0,X1] : greatest_lower_bound(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(greatest_lower_bound(X0,X1),X2),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',associativity_of_glb) ).
fof(f10,axiom,
! [X0] : greatest_lower_bound(X0,X0) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',idempotence_of_gld) ).
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/sandbox2/benchmark/Axioms/GRP004-2.ax',monotony_glb2) ).
fof(f19,axiom,
greatest_lower_bound(identity,b) = identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p8_9b_2) ).
fof(f20,plain,
identity = greatest_lower_bound(identity,b),
inference(reorient_equations,[],[f19]) ).
fof(f23,axiom,
greatest_lower_bound(a,b) = identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p8_9b_4) ).
fof(f24,plain,
identity = greatest_lower_bound(a,b),
inference(reorient_equations,[],[f23]) ).
fof(f25,axiom,
greatest_lower_bound(greatest_lower_bound(a,multiply(b,c)),multiply(greatest_lower_bound(a,b),greatest_lower_bound(a,c))) = greatest_lower_bound(a,multiply(b,c)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p8_9b_5) ).
fof(f26,plain,
greatest_lower_bound(a,multiply(b,c)) = greatest_lower_bound(greatest_lower_bound(a,multiply(b,c)),multiply(greatest_lower_bound(a,b),greatest_lower_bound(a,c))),
inference(reorient_equations,[],[f25]) ).
fof(f27,negated_conjecture,
greatest_lower_bound(a,multiply(b,c)) != greatest_lower_bound(a,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p8_9b) ).
fof(f71,plain,
! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X0,greatest_lower_bound(X0,X1)),
inference(superposition,[],[f7,f10]) ).
fof(f88,plain,
! [X2,X0,X1] : greatest_lower_bound(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(X2,greatest_lower_bound(X0,X1)),
inference(superposition,[],[f5,f7]) ).
fof(f241,plain,
! [X0,X1] : multiply(greatest_lower_bound(identity,X1),X0) = greatest_lower_bound(X0,multiply(X1,X0)),
inference(superposition,[],[f16,f1]) ).
fof(f307,plain,
greatest_lower_bound(a,multiply(b,c)) = greatest_lower_bound(a,greatest_lower_bound(multiply(b,c),multiply(greatest_lower_bound(a,b),greatest_lower_bound(a,c)))),
inference(superposition,[],[f7,f26]) ).
fof(f317,plain,
greatest_lower_bound(a,multiply(b,c)) = greatest_lower_bound(a,greatest_lower_bound(multiply(b,c),multiply(identity,greatest_lower_bound(a,c)))),
inference(forward_demodulation,[],[f307,f24]) ).
fof(f326,plain,
greatest_lower_bound(a,multiply(b,c)) = greatest_lower_bound(a,greatest_lower_bound(multiply(b,c),greatest_lower_bound(a,c))),
inference(forward_demodulation,[],[f317,f1]) ).
fof(f334,plain,
greatest_lower_bound(a,multiply(b,c)) = greatest_lower_bound(a,greatest_lower_bound(c,greatest_lower_bound(multiply(b,c),a))),
inference(forward_demodulation,[],[f326,f88]) ).
fof(f342,plain,
greatest_lower_bound(a,multiply(b,c)) = greatest_lower_bound(a,greatest_lower_bound(a,greatest_lower_bound(c,multiply(b,c)))),
inference(forward_demodulation,[],[f334,f88]) ).
fof(f350,plain,
greatest_lower_bound(a,multiply(b,c)) = greatest_lower_bound(a,greatest_lower_bound(c,multiply(b,c))),
inference(forward_demodulation,[],[f342,f71]) ).
fof(f357,plain,
greatest_lower_bound(a,multiply(b,c)) = greatest_lower_bound(a,multiply(greatest_lower_bound(identity,b),c)),
inference(forward_demodulation,[],[f350,f241]) ).
fof(f362,plain,
greatest_lower_bound(a,multiply(b,c)) = greatest_lower_bound(a,multiply(identity,c)),
inference(forward_demodulation,[],[f357,f20]) ).
fof(f365,plain,
greatest_lower_bound(a,multiply(b,c)) = greatest_lower_bound(a,c),
inference(forward_demodulation,[],[f362,f1]) ).
fof(f368,plain,
$false,
inference(forward_subsumption_resolution,[],[f365,f27]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP193-2 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.38 % Computer : n026.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:39:57 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.17/0.47 % (2580808)Will run a generic schedule for satisfiability detection.
% 0.17/0.47 % (2580815)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3453345338:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.47 % (2580814)% WARNING: option uhcvi not known.
% 0.17/0.47 % (2580813)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1466166974_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.47 % (2580814)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1609100067:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.47 % (2580816)dis+10_1_sil=32000:sp=arity:random_seed=2669535832:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.47 % (2580817)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=867769588:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.47 % (2580818)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4168544498:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.47 % (2580819)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4111177228:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.47 % TRYING [1]
% 0.17/0.47 % TRYING [2]
% 0.17/0.47 % TRYING [3]
% 0.17/0.47 % (2580818) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2580808-2580818"...
% 0.17/0.47 % TRYING [4]
% 0.17/0.47 % (2580818)...printing done.
% 0.17/0.47 % (2580818)Refutation found. Thanks to Tanya!
% 0.17/0.47 % SZS status Unsatisfiable for theBenchmark
% 0.17/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.47 % (2580818)------------------------------
% 0.17/0.47 % (2580818)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.47 % (2580818)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.47 % (2580818)CaDiCaL version: 2.1.3
% 0.17/0.47 % (2580818)Termination reason: Refutation
% 0.17/0.47 % (2580818)Time elapsed: 0.010 s
% 0.17/0.47 % (2580818)Peak memory usage: 11 MB
% 0.17/0.47 % (2580818)Instructions burned: 15 (million)
% 0.17/0.47 % (2580808)Success in time 0.048 s
% 0.17/0.47 % Vampire exiting
%------------------------------------------------------------------------------